A new result on the complexity of heuristic estimates for the A★ algorithm
- 31 May 1992
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 55 (1) , 129-143
- https://doi.org/10.1016/0004-3702(92)90045-y
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Planning as search: A quantitative approachArtificial Intelligence, 1987
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985
- A result on the computational complexity of heuristic estimates for the A∗ algorithmInformation Sciences, 1984
- A method for computing heuristics in problem solvingInformation Sciences, 1979
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968