Breadth-first heuristic search
- 1 April 2006
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 170 (4-5) , 385-408
- https://doi.org/10.1016/j.artint.2005.12.002
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- External A*Published by Springer Nature ,2004
- Disjoint pattern database heuristicsArtificial Intelligence, 2002
- Planning as heuristic searchArtificial Intelligence, 2001
- Linear-space best-first searchArtificial Intelligence, 1993
- Criticizing solutions to relaxed models yields powerful admissible heuristicsInformation Sciences, 1992
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959