# <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… CONTINUE READING

#### Topics from this paper.

156 Citations

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

- Computer Science
- 1999

- 15
- PDF

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

- Computer Science
- 1996

- 6

A metric space approach to the specification of the heuristic function for the A* algorithm

- Mathematics
- 1994

- 22
- PDF

Reconsideration of a theorem on admissible ordered search algorithms

- Mathematics, Computer Science
- 1976