Dijkstra’s algorithm builds a shortest path tree one edge at a time by first
adding the source node to the SPT and then by adding the edge that gives
the shortest path from the source to a node not already on the SPT. This
process results in an SPT containing the shortest path from every node in
the graph to the source node. (查看原文)
Dijkstra’s algorithm searches by minimizing the cost of the path so far. It
can be improved significantly by taking into account, when putting nodes
on the frontier, anestimateof the cost to the target from each node under
consideration. This estimate is usually referred to as aheuristic, and the
name given to the algorithm that uses this method of heuristically directed
search is A* (pronounced ay-star).
A* proceeds in an almost identical fashion to Dijkstra’s search algo-rithm. The only difference is in the calculation of the costs of the nodes on
the search frontier. The adjusted cost,F, to the node when positioned on the
priority queue (the search frontier), is calculated as:
F = G+H (5.3)
where G is the cumulative cost to reach a node andHis the heuristic e... (查看原文)
岁月的快门
人民邮电出版社2012版
涅瓦纳
0 有用 nexgenmatrix 2011-05-04 16:11:18
非常棒的一本书，不只是讲游戏AI，其中的OO设计也是相当酷。
0 有用 溪风蝉月 2012-07-14 11:06:43
AI书籍经典之作
0 有用 KID 2019-12-20 17:44:40
翻译不行
0 有用 田园的拾荒者 2012-12-09 21:34:08
ai book
0 有用 Lucadna 2013-04-03 15:22:42
浅显易懂