The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
LAO∗: A heuristic search algorithm that finds solutions with loops
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1995) · Cited by 10,558
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457 · cited 5×
“Nilsson [18] also used the name AO* for this more general algorithm.”
BackgroundMethodInfluentialProblem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
Learning to act using real-time dynamic programming
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00011-o · Cited by 1,104
Generalized best-first search strategies and the optimality of A*
Dechter, R., & Pearl, J. (1985) · Journal of the ACM · doi:10.1145/3828.3830 · Cited by 1,071
Korf, R. E. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90054-4 · Cited by 917
Principles of artificial intelligence
McDermott, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90026-0 · Cited by 814
Application of heuristic search and information theory to sequential fault diagnosis
Pattipati, K. R., & Alexandridis, M. G. (1990) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.105086 · Cited by 248
Price, K. (1980) · ACM SIGART Bulletin · doi:10.1145/1056441.1056445 · Cited by 201
Planning under time constraints in stochastic domains
Dean, T., Kaelbling, L. P., Kirman, J., & Nicholson, A. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00086-g · Cited by 198
Cited by
Reinforcement Learning and Markov Decision Processes
van Otterlo, M., & Wiering, M. (2012) · Adaptation, Learning, and Optimization · doi:10.1007/978-3-642-27645-3_1 · Cited by 628
Online Planning Algorithms for POMDPs
Ross, S., Pineau, J., Paquet, S., & Chaib-draa, B. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2567 · Cited by 496
(2004) · doi:10.5555/1036843.1036906 · Cited by 417
Deliberation for autonomous robots: A survey
Ingrand, F., & Ghallab, M. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.003 · Cited by 309
Hansen, E. A., & Zhou, R. (2007) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2096 · Cited by 259
Self-citation
Metadata
- Authors
- Hansen, E. A., & Zilberstein, S.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2001-06
- Volume
- 129
- Issue
- 1-2
- Pages
- 35-62
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2105757562
- Cited by
- 388
- References
- 17
- FWCI
- 8.64
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: LAO∗: A heuristic search algorithm that finds solutions with loops. https://app.cochat.ai/papers/10.1016/s0004-3702(01)00106-0
- The paper
- Hansen, E. A., & Zilberstein, S. (2001). LAO∗: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(01)00106-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.