AStar-名称说明 [英] AStar - explanation of name

问题描述

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

I am looking for an explanation why the AStar / A* algorithm is called AStar. All similar (shortest path problem) algorithms are often named like its developer(s), so what is AStar standing for?

推荐答案

有称为A1和A2的算法.后来，事实证明A2是最佳算法，实际上也是可能的最佳算法，因此他给它取了一个名称A *，该符号象征性地包含了所有可能的版本号.

There were algorithms called A1 and A2. Later, it was proved that A2 was optimal and in fact also the best algorithm possible, so he gave it the name A* which symbolically includes all possible version numbers.

来源:

1964年，尼尔斯·尼尔森(Nils Nilsson)发明了一种基于启发式的方法来提高Dijkstra算法的速度.该算法称为A1. 1967年，Bertram Raphael对该算法进行了重大改进，但未能显示出最优性.他称此算法为A2.然后在1968年，彼得·哈特(Peter E. Hart)提出了一个论点，证明了当使用一致的启发式方法而只进行少量更改时，A2是最佳的.他对算法的证明还包括一节，表明在给定条件下，新的A2算法是可能的最佳算法.因此，他将Kleene star语法中的新算法命名为以A开头并包括所有可能的版本号或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.*

Nosrati, Masoud, Ronak Karimi, and Hojat Allah Hasanvand. "Investigation of the(star) search algorithms: Characteristics, methods and approaches." World Applied Programming 2.4 (2012): 251-256.*

这篇关于AStar-名称说明的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！