Linear-space best-first search
- 1 July 1993
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 62 (1), 41-78
- https://doi.org/10.1016/0004-3702(93)90045-d
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Reducing reexpansions in iterative-deepening search by controlling cutoff boundsArtificial Intelligence, 1991
- Real-time heuristic searchArtificial Intelligence, 1990
- Heuristic search in restricted memoryArtificial Intelligence, 1989
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985
- Heuristic search viewed as path finding in a graphArtificial Intelligence, 1970
- 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