# <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

#### 154 Citations

Completeness and Admissibility for General Heuristic Search Algorithms—A Theoretical Study: Basic Concepts and Proofs

- Computer Science
- J. Heuristics
- 1999

Generalized best-first search strategies and the optimality of A*

- Mathematics, Computer Science
- JACM
- 1985

A heuristic search approach for solving a minimum path problem requiring arc cost determination

- Computer Science
- IEEE Trans. Syst. Man Cybern. Part A
- 1996

A Metric Space Approach to the Specification of the Heuristic Function for the A* Algorithm

- Computer Science, Mathematics
- IEEE Trans. Syst. Man Cybern. Syst.
- 1994

Reconsideration of a theorem on admissible ordered search algorithms

- Mathematics, Computer Science
- ACM '76
- 1976

A heuristic search algorithm for path determination with learning

- Computer Science
- IEEE Trans. Syst. Man Cybern. Part A
- 1998

A best-first search algorithm guided by a set-valued heuristic

- Mathematics, Computer Science
- IEEE Trans. Syst. Man Cybern.
- 1995