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 有用 wsmbaw0707 2014-11-11 22:01:59
牛逼
0 有用 WingStone 2011-04-13 23:27:10
内容不错, 排版不行...
0 有用 溪风蝉月 2012-07-14 11:06:43
AI书籍经典之作
0 有用 Guanlan 2010-06-24 16:03:50
通俗易懂，挺有趣的一本书
0 有用 Jacky 2012-01-16 21:07:21
刚看完，非常的棒，再加上有完整的完整的代码，理解的更快了
0 有用 wayne 2022-10-21 10:53:32 四川
非常好的书,从移动到寻路,到目标抉择,美中不足是寻路的地块切分没有细讲,然后模糊逻辑那章稍微有点不好消化(翻译问题?)
0 有用 囚徒 2021-08-29 13:33:49
写的很细致，适合新手。
0 有用 小碧俐 2020-03-20 22:56:24
总结下游戏人工智能的三个主要方面: 1.多层状态机 2.图搜索算法 3.目标驱动
0 有用 KID 2019-12-20 17:44:40
翻译不行
0 有用 汪杨 2017-06-28 11:03:27
关于有限自动机的一些技术写的很清楚