algorithm - AStar - 名称解释

Question

我正在寻找 AStar/A* 算法为何称为 AStar 的解释。所有类似的(最短路径问题)算法通常都像其开发者一样命名，那么 AStar 代表什么？

Answer 1

有称为 A1 和 A2 的算法。后来证明A2是最优的，实际上也是最好的算法，所以他给它起了一个名字A*，象征性地包含了所有可能的版本号。

来源:

In 1964 Nils Nilsson invented a heuristic based approach to increase the speed of Dijkstra's algorithm. This algorithm was called A1. In 1967 Bertram Raphael made dramatic improvements upon this algorithm, but failed to show optimality. He called this algorithm A2. Then in 1968 Peter E. Hart introduced an argument that proved A2 was optimal when using a consistent heuristic with only minor changes. His proof of the algorithm also included a section that showed that the new A2 algorithm was the best algorithm possible given the conditions. He thus named the new algorithm in Kleene star syntax to be the algorithm that starts with A and includes all possible version numbers or A*

Nosrati、Masoud、Ronak Karimi 和 Hojat Allah Hasanvand。 “*(星号)搜索算法的调查:特征、方法和途径。”世界应用编程 2.4(2012 年):251-256。