LAO*: A heuristic search algorithm that finds solutions with loops

Artificial Intelligence

Volumn 129, Issue 1-2, 2001, Pages 35-62

  Hansen, Eric A ^a   Zilberstein, Shlomo ^b  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

^b The Manning College of Information and Computer Sciences   (United States)

Author keywords

Dynamic programming; Heuristic search; Markov decision problems

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MARKOV PROCESSES; PROBLEM SOLVING;

HEURISTIC SEARCH ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 0035369425     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00106-0     Document Type: Article

References (21)

1. Learning to act using real-time dynamic programming
2. Admissibility of AO* when heuristics overestimate
3. The advantages of using depth and breadth components in heuristic search
4. Planning under time constraints in stochastic domains
5. Integrating planning and execution in stochastic domains
6. Generalized best-first search strategies and the optimality of A*
7. Heuristic search in cyclic AND/OR graphs
8. Improving the learning efficiencies of realtime search
9. An efficient algorithm for searching implicit AND/OR graphs with cycles
10. Real-time heuristic search
11. Optimal frozen period in a periodic review inventory model with updateable demand forecasts
12. Additive AND/OR graphs
13. Optimizing decision trees through heuristically guided search
14. A heuristic search algorithm with modifiable estimate
15. Search problem-solving and game-playing trees for minimal cost solutions
16. Application of heuristic search and information theory to sequential fault diagnosis
17. First results on the effect of error in heuristic search
18. Control strategies for a stochastic planner