<u>Correction</u> to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"

@article{Hart1972uCorrectionuT,
  title={<u>Correction</u> to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"},
  author={P. Hart and N. Nilsson and B. Raphael},
  journal={SIGART Newsl.},
  year={1972},
  volume={37},
  pages={28-29}
}
Our paper on the use of heuristic information in graph searching defined a path-finding algorithm, A*, and proved that it had two important properties. In the notation of the paper, we proved that if the heuristic function ñ (n) is a lower bound on the true minimal cost from node n to a goal node, then A* is <u>admissible;</u> i.e., it would find a minimal cost path if any path to a goal node existed. Further, we proved that if the heuristic function also satisfied something called the <u… Expand
On the Complexity of Admissible Search Algorithms
  • A. Martelli
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1977
Generalized best-first search strategies and the optimality of A*
A heuristic search approach for solving a minimum path problem requiring arc cost determination
A Metric Space Approach to the Specification of the Heuristic Function for the A* Algorithm
Reconsideration of a theorem on admissible ordered search algorithms
  • M. Newborn
  • Mathematics, Computer Science
  • ACM '76
  • 1976
A heuristic search algorithm for path determination with learning
A best-first search algorithm guided by a set-valued heuristic
Multiobjective A*
...
1
2
3
4
5
...