Encyclopedia of Operations Research and Management Science

2013 Edition
| Editors: Saul I. Gass, Michael C. Fu

A* Algorithm

Reference work entry
DOI: https://doi.org/10.1007/978-1-4419-1153-7_200001

A heuristic search procedure that selects a node in its search tree for expansion such that the selected node has minimum value of the sum of the cost to reach the node plus a heuristic cost value for that node, where the heuristic cost underestimates the true minimum cost of completion.

See

References

  1. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4, 100–107.CrossRefGoogle Scholar
  2. Pearl, J. (1984). Heuristics. Reading, MA: Addison-Wesley.Google Scholar

Copyright information

© Springer Science+Business Media New York 2013