<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}
}
  • P. Hart, N. Nilsson, B. Raphael
  • Published 1972
  • Computer Science
  • SIGART Newsl.
  • 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.