LAO∗: A heuristic search algorithm that finds solutions with loops
- 1 June 2001
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 129 (1-2) , 35-62
- https://doi.org/10.1016/s0004-3702(01)00106-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An efficient algorithm for searching implicit AND/OR graphs with cyclesArtificial Intelligence, 2000
- Planning under time constraints in stochastic domainsArtificial Intelligence, 1995
- Learning to act using real-time dynamic programmingArtificial Intelligence, 1995
- Integrating Planning and Execution in Stochastic DomainsPublished by Elsevier ,1994
- Application of heuristic search and information theory to sequential fault diagnosisIEEE Transactions on Systems, Man, and Cybernetics, 1990
- Admissibility of AO∗ when heuristics overestimateArtificial Intelligence, 1987
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985
- A heuristic search algorithm with modifiable estimateArtificial Intelligence, 1984
- Principles of Artificial IntelligenceComputer Music Journal, 1980
- Optimizing decision trees through heuristically guided searchCommunications of the ACM, 1978