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

@article{Hansen2001LAOAH,
  title={LAO*: A heuristic search algorithm that finds solutions with loops},
  author={Eric A. Hansen and Shlomo Zilberstein},
  journal={Artif. Intell.},
  year={2001},
  volume={129},
  pages={35-62}
}
Classic heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree, or an acyclic graph (AO*). In this paper, we describe a novel generalization of heuristic search, called LAO*, that can find solutions with loops. We show that LAO* can be used to solve Markov decision problems and that it shares the advantage heuristic search has over dynamic programming for other classes of problems. Given a start state, it can find an optimal solution without evaluating… CONTINUE READING
Highly Influential
This paper has highly influenced 52 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 421 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 285 extracted citations

422 Citations

02040'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 422 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Admissibility of AO* when heuristics overestimate

  • P. P. Chakrabarti, S. Ghose, S. C. DeSarkar
  • Artificial Intelligence 34
  • 1988
Highly Influential
4 Excerpts

Optimal frozen period in a periodic review inventory model with updateable demand forecasts

  • Z. Lian, A. Deshmukh, J. Wang
  • in: Proc. 15th International Conference on…
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…