正在加载图片...
Greedy search Evaluation function h(n)(heuristic) estimate of cost from n to the closest goal E.g.,hsLD(n)=straight-line distance from n to Bucharest Greedy search expands the node that appears to be closest to goal Chapter 4.Sections 1-2 6Greedy search Evaluation function h(n) (heuristic) = estimate of cost from n to the closest goal E.g., hSLD(n) = straight-line distance from n to Bucharest Greedy search expands the node that appears to be closest to goal Chapter 4, Sections 1–2 6
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有