A* search algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "A* search algorithm" in English language version.

refsWebsite

Global rank English rank

16doi.org

2^nd place

8semanticscholar.org

11^th place

8^th place

8web.archive.org

1^st place

4worldcat.org

5^th place

3stanford.edu

179^th place

183^rd place

3aaai.org

9,352^nd place

5,696^th place

2harvard.edu

18^th place

17^th place

2books.google.com

3^rd place

2ijcai.org

low place

1zenodo.org

621^st place

380^th place

1uci.edu

3,063^rd place

2,041^st place

1polytechnique.fr

low place

1archive.org

6^th place

1auckland.ac.nz

4,539^th place

2,858^th place

1acm.org

1,185^th place

840^th place

1nih.gov

4^th place

1stofanet.dk

low place

1berkeley.edu

580^th place

462^nd place

1tau.ac.il

4,464^th place

4,468^th place

1cmu.edu

1,564^th place

1,028^th place

1umd.edu

1,747^th place

1,277^th place

1jair.org

low place

1arxiv.org

69^th place

59^th place

1cambridge.org

305^th place

264^th place

1eur.nl

low place

9,966^th place

1princeton.edu

741^st place

577^th place

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

aaai.org

Edelkamp, Stefan; Jabbar, Shahid; Lluch-Lafuente, Alberto (2005). "Cost-Algebraic Heuristic Search". Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI) (PDF). pp. 1362–1367. ISBN 978-1-57735-236-5.
Zhang, Zhifu; N. R. Sturtevant (2009). Using Inconsistent Heuristics on A* Search. Twenty-First International Joint Conference on Artificial Intelligence. pp. 634–639.

ojs.aaai.org

Chen, Jingwei; Sturtevant, Nathan R. (2021-05-18). "Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions". Proceedings of the AAAI Conference on Artificial Intelligence. 35 (5): 3688–3696. doi:10.1609/aaai.v35i5.16485. ISSN 2374-3468.

acm.org (Global: 1,185^th place; English: 840^th place)

dl.acm.org

Köll, Andreas; Hermann Kaindl (August 1992). "A new approach to dynamic weighting". Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI-92). Vienna, Austria: Wiley. pp. 16–17. ISBN 978-0-471-93608-4.

archive.org (Global: 6^th place; English: 6^th place)

Pearl, Judea (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley. ISBN 978-0-201-05594-8.

arxiv.org (Global: 69^th place; English: 59^th place)

Hansen, Eric A.; Zhou, Rong (2007). "Anytime Heuristic Search". Journal of Artificial Intelligence Research. 28: 267–297. arXiv:1110.2737. doi:10.1613/jair.2096. S2CID 9832874.

auckland.ac.nz (Global: 4,539^th place; English: 2,858^th place)

cs.auckland.ac.nz

Pohl, Ira (August 1973). "The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving" (PDF). Proceedings of the Third International Joint Conference on Artificial Intelligence (IJCAI-73). Vol. 3. California, USA. pp. 11–17.

berkeley.edu (Global: 580^th place; English: 462^nd place)

people.eecs.berkeley.edu

Klein, Dan; Manning, Christopher D. (2003). "A* parsing: fast exact Viterbi parse selection" (PDF). Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics. pp. 119–126. doi:10.3115/1073445.1073461.

books.google.com (Global: 3^rd place; English: 3^rd place)

De Smith, Michael John; Goodchild, Michael F.; Longley, Paul (2007), Geospatial Analysis: A Comprehensive Guide to Principles, Techniques and Software Tools, Troubadour Publishing Ltd, p. 344, ISBN 9781905886609.
Hetland, Magnus Lie (2010), Python Algorithms: Mastering Basic Algorithms in the Python Language, Apress, p. 214, ISBN 9781430232377, archived from the original on 15 February 2022.

cambridge.org (Global: 305^th place; English: 264^th place)

Fareh, Raouf; Baziyad, Mohammed; Rahman, Mohammad H.; Rabie, Tamer; Bettayeb, Maamar (2019-05-14). "Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot". Robotica. 38 (2): 235–255. doi:10.1017/S0263574719000572. ISSN 0263-5747. S2CID 181849209.

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

cs.cmu.edu

Ferguson, Dave; Likhachev, Maxim; Stentz, Anthony (2005). "A Guide to Heuristic-based Path Planning" (PDF). Proceedings of the international workshop on planning under uncertainty for autonomous systems, international conference on automated planning and scheduling (ICAPS). pp. 9–18. Archived (PDF) from the original on 2016-06-29.

doi.org (Global: 2^nd place; English: 2^nd place)

Delling, D.; Sanders, P.; Schultes, D.; Wagner, D. (2009). "Engineering Route Planning Algorithms". Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation. Lecture Notes in Computer Science. Vol. 5515. Springer. pp. 117–139. doi:10.1007/978-3-642-02094-0_7. ISBN 978-3-642-02093-3.
Zeng, W.; Church, R. L. (2009). "Finding shortest paths on real road networks: the case for A*". International Journal of Geographical Information Science. 23 (4): 531–543. Bibcode:2009IJGIS..23..531Z. doi:10.1080/13658810801949850. S2CID 14833639.
Hart, P. E.; Nilsson, N.J.; Raphael, B. (1968). "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". IEEE Transactions on Systems Science and Cybernetics. 4 (2): 100–7. doi:10.1109/TSSC.1968.300136.
Doran, J. E.; Michie, D. (1966-09-20). "Experiments with the Graph Traverser program". Proc. R. Soc. Lond. A. 294 (1437): 235–259. Bibcode:1966RSPSA.294..235D. doi:10.1098/rspa.1966.0205. S2CID 21698093.
Hart, Peter E.; Nilsson, Nils J.; Raphael, Bertram (1972-12-01). "Correction to 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths'" (PDF). ACM SIGART Bulletin (37): 28–29. doi:10.1145/1056777.1056779. S2CID 6386648.
Dechter, Rina; Judea Pearl (1985). "Generalized best-first search strategies and the optimality of A*". Journal of the ACM. 32 (3): 505–536. doi:10.1145/3828.3830. S2CID 2092415.
Nannicini, Giacomo; Delling, Daniel; Schultes, Dominik; Liberti, Leo (2012). "Bidirectional A* search on time-dependent road networks" (PDF). Networks. 59 (2): 240–251. doi:10.1002/NET.20438.
Martelli, Alberto (1977). "On the Complexity of Admissible Search Algorithms". Artificial Intelligence. 8 (1): 1–13. doi:10.1016/0004-3702(77)90002-9.
Felner, Ariel; Uzi Zahavi (2011). "Inconsistent heuristics in theory and practice". Artificial Intelligence. 175 (9–10): 1570–1603. doi:10.1016/j.artint.2011.02.001.
Chen, Jingwei; Sturtevant, Nathan R. (2021-05-18). "Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions". Proceedings of the AAAI Conference on Artificial Intelligence. 35 (5): 3688–3696. doi:10.1609/aaai.v35i5.16485. ISSN 2374-3468.
Pearl, Judea; Jin H. Kim (1982). "Studies in semi-admissible heuristics". IEEE Transactions on Pattern Analysis and Machine Intelligence. 4 (4): 392–399. doi:10.1109/TPAMI.1982.4767270. PMID 21869053. S2CID 3176931.
Klein, Dan; Manning, Christopher D. (2003). "A* parsing: fast exact Viterbi parse selection" (PDF). Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics. pp. 119–126. doi:10.3115/1073445.1073461.
Kagan E.; Ben-Gal I. (2014). "A Group-Testing Algorithm with Online Informational Learning" (PDF). IIE Transactions. 46 (2): 164–184. doi:10.1080/0740817X.2013.803639. S2CID 18588494. Archived from the original (PDF) on 2016-11-05. Retrieved 2016-02-12.
Nau, Dana S.; Kumar, Vipin; Kanal, Laveen (1984). "General branch and bound, and its relation to A∗ and AO∗" (PDF). Artificial Intelligence. 23 (1): 29–58. doi:10.1016/0004-3702(84)90004-3. Archived (PDF) from the original on 2012-10-04.
Hansen, Eric A.; Zhou, Rong (2007). "Anytime Heuristic Search". Journal of Artificial Intelligence Research. 28: 267–297. arXiv:1110.2737. doi:10.1613/jair.2096. S2CID 9832874.
Fareh, Raouf; Baziyad, Mohammed; Rahman, Mohammad H.; Rabie, Tamer; Bettayeb, Maamar (2019-05-14). "Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot". Robotica. 38 (2): 235–255. doi:10.1017/S0263574719000572. ISSN 0263-5747. S2CID 181849209.

eur.nl (Global: low place; English: 9,966^th place)

repub.eur.nl

Pijls, Wim; Post, Henk. Yet another bidirectional algorithm for shortest paths (PDF) (Technical report). Econometric Institute, Erasmus University Rotterdam. EI 2009-10. Archived (PDF) from the original on 2014-06-11.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Zeng, W.; Church, R. L. (2009). "Finding shortest paths on real road networks: the case for A*". International Journal of Geographical Information Science. 23 (4): 531–543. Bibcode:2009IJGIS..23..531Z. doi:10.1080/13658810801949850. S2CID 14833639.
Doran, J. E.; Michie, D. (1966-09-20). "Experiments with the Graph Traverser program". Proc. R. Soc. Lond. A. 294 (1437): 235–259. Bibcode:1966RSPSA.294..235D. doi:10.1098/rspa.1966.0205. S2CID 21698093.

ijcai.org (Global: low place; English: low place)

Chen, Jingwei; Sturtevant, Nathan R. (2019). "Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search". Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization: 1220–1226.
Ghallab, Malik; Dennis Allard (August 1983). "A_ε – an efficient near admissible heuristic search algorithm" (PDF). Proceedings of the Eighth International Joint Conference on Artificial Intelligence (IJCAI-83). Vol. 2. Karlsruhe, Germany. pp. 789–791. Archived from the original (PDF) on 2014-08-06.

jair.org (Global: low place; English: low place)

Hansen, Eric A.; Zhou, Rong (2007). "Anytime Heuristic Search". Journal of Artificial Intelligence Research. 28: 267–297. arXiv:1110.2737. doi:10.1613/jair.2096. S2CID 9832874.

nih.gov (Global: 4^th place; English: 4^th place)

pubmed.ncbi.nlm.nih.gov

Pearl, Judea; Jin H. Kim (1982). "Studies in semi-admissible heuristics". IEEE Transactions on Pattern Analysis and Machine Intelligence. 4 (4): 392–399. doi:10.1109/TPAMI.1982.4767270. PMID 21869053. S2CID 3176931.

polytechnique.fr (Global: low place; English: low place)

lix.polytechnique.fr

Nannicini, Giacomo; Delling, Daniel; Schultes, Dominik; Liberti, Leo (2012). "Bidirectional A* search on time-dependent road networks" (PDF). Networks. 59 (2): 240–251. doi:10.1002/NET.20438.

princeton.edu (Global: 741^st place; English: 577^th place)

cs.princeton.edu

Goldberg, Andrew V.; Harrelson, Chris; Kaplan, Haim; Werneck, Renato F. "Efficient Point-to-Point Shortest Path Algorithms" (PDF). Princeton University. Archived (PDF) from the original on 18 May 2022.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Zeng, W.; Church, R. L. (2009). "Finding shortest paths on real road networks: the case for A*". International Journal of Geographical Information Science. 23 (4): 531–543. Bibcode:2009IJGIS..23..531Z. doi:10.1080/13658810801949850. S2CID 14833639.
Doran, J. E.; Michie, D. (1966-09-20). "Experiments with the Graph Traverser program". Proc. R. Soc. Lond. A. 294 (1437): 235–259. Bibcode:1966RSPSA.294..235D. doi:10.1098/rspa.1966.0205. S2CID 21698093.
Hart, Peter E.; Nilsson, Nils J.; Raphael, Bertram (1972-12-01). "Correction to 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths'" (PDF). ACM SIGART Bulletin (37): 28–29. doi:10.1145/1056777.1056779. S2CID 6386648.
Dechter, Rina; Judea Pearl (1985). "Generalized best-first search strategies and the optimality of A*". Journal of the ACM. 32 (3): 505–536. doi:10.1145/3828.3830. S2CID 2092415.
Pearl, Judea; Jin H. Kim (1982). "Studies in semi-admissible heuristics". IEEE Transactions on Pattern Analysis and Machine Intelligence. 4 (4): 392–399. doi:10.1109/TPAMI.1982.4767270. PMID 21869053. S2CID 3176931.
Kagan E.; Ben-Gal I. (2014). "A Group-Testing Algorithm with Online Informational Learning" (PDF). IIE Transactions. 46 (2): 164–184. doi:10.1080/0740817X.2013.803639. S2CID 18588494. Archived from the original (PDF) on 2016-11-05. Retrieved 2016-02-12.
Hansen, Eric A.; Zhou, Rong (2007). "Anytime Heuristic Search". Journal of Artificial Intelligence Research. 28: 267–297. arXiv:1110.2737. doi:10.1613/jair.2096. S2CID 9832874.
Fareh, Raouf; Baziyad, Mohammed; Rahman, Mohammad H.; Rabie, Tamer; Bettayeb, Maamar (2019-05-14). "Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot". Robotica. 38 (2): 235–255. doi:10.1017/S0263574719000572. ISSN 0263-5747. S2CID 181849209.

stanford.edu (Global: 179^th place; English: 183^rd place)

ai.stanford.edu

Nilsson, Nils J. (2009-10-30). The Quest for Artificial Intelligence (PDF). Cambridge: Cambridge University Press. ISBN 9780521122931. One of the first problems we considered was how to plan a sequence of 'way points' that Shakey could use in navigating from place to place. […] Shakey's navigation problem is a search problem, similar to ones I have mentioned earlier.
Nilsson, Nils J. (2009-10-30). The Quest for Artificial Intelligence (PDF). Cambridge: Cambridge University Press. ISBN 9780521122931. Bertram Raphael, who was directing work on Shakey at that time, observed that a better value for the score would be the sum of the distance traveled so far from the initial position plus my heuristic estimate of how far the robot had to go.

theory.stanford.edu

"Variants of A*". theory.stanford.edu. Retrieved 2023-06-09.

stofanet.dk (Global: low place; English: low place)

home1.stofanet.dk

Reese, Bjørn (1999). AlphA*: An ε-admissible heuristic search algorithm (Report). Institute for Production Technology, University of Southern Denmark. Archived from the original on 2016-01-31. Retrieved 2014-11-05.

tau.ac.il (Global: 4,464^th place; English: 4,468^th place)

eng.tau.ac.il

Kagan E.; Ben-Gal I. (2014). "A Group-Testing Algorithm with Online Informational Learning" (PDF). IIE Transactions. 46 (2): 164–184. doi:10.1080/0740817X.2013.803639. S2CID 18588494. Archived from the original (PDF) on 2016-11-05. Retrieved 2016-02-12.

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

ics.uci.edu

Hart, Peter E.; Nilsson, Nils J.; Raphael, Bertram (1972-12-01). "Correction to 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths'" (PDF). ACM SIGART Bulletin (37): 28–29. doi:10.1145/1056777.1056779. S2CID 6386648.

umd.edu (Global: 1,747^th place; English: 1,277^th place)

cs.umd.edu

Nau, Dana S.; Kumar, Vipin; Kanal, Laveen (1984). "General branch and bound, and its relation to A∗ and AO∗" (PDF). Artificial Intelligence. 23 (1): 29–58. doi:10.1016/0004-3702(84)90004-3. Archived (PDF) from the original on 2012-10-04.

web.archive.org (Global: 1^st place; English: 1^st place)

Hetland, Magnus Lie (2010), Python Algorithms: Mastering Basic Algorithms in the Python Language, Apress, p. 214, ISBN 9781430232377, archived from the original on 15 February 2022.
Ghallab, Malik; Dennis Allard (August 1983). "A_ε – an efficient near admissible heuristic search algorithm" (PDF). Proceedings of the Eighth International Joint Conference on Artificial Intelligence (IJCAI-83). Vol. 2. Karlsruhe, Germany. pp. 789–791. Archived from the original (PDF) on 2014-08-06.
Reese, Bjørn (1999). AlphA*: An ε-admissible heuristic search algorithm (Report). Institute for Production Technology, University of Southern Denmark. Archived from the original on 2016-01-31. Retrieved 2014-11-05.
Kagan E.; Ben-Gal I. (2014). "A Group-Testing Algorithm with Online Informational Learning" (PDF). IIE Transactions. 46 (2): 164–184. doi:10.1080/0740817X.2013.803639. S2CID 18588494. Archived from the original (PDF) on 2016-11-05. Retrieved 2016-02-12.
Ferguson, Dave; Likhachev, Maxim; Stentz, Anthony (2005). "A Guide to Heuristic-based Path Planning" (PDF). Proceedings of the international workshop on planning under uncertainty for autonomous systems, international conference on automated planning and scheduling (ICAPS). pp. 9–18. Archived (PDF) from the original on 2016-06-29.
Nau, Dana S.; Kumar, Vipin; Kanal, Laveen (1984). "General branch and bound, and its relation to A∗ and AO∗" (PDF). Artificial Intelligence. 23 (1): 29–58. doi:10.1016/0004-3702(84)90004-3. Archived (PDF) from the original on 2012-10-04.
Pijls, Wim; Post, Henk. Yet another bidirectional algorithm for shortest paths (PDF) (Technical report). Econometric Institute, Erasmus University Rotterdam. EI 2009-10. Archived (PDF) from the original on 2014-06-11.
Goldberg, Andrew V.; Harrelson, Chris; Kaplan, Haim; Werneck, Renato F. "Efficient Point-to-Point Shortest Path Algorithms" (PDF). Princeton University. Archived (PDF) from the original on 18 May 2022.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Russell, Stuart J.; Norvig, Peter (2018). Artificial intelligence a modern approach (4th ed.). Boston: Pearson. ISBN 978-0134610993. OCLC 1021874142.
Pohl, Ira (1970). "First results on the effect of error in heuristic search". Machine Intelligence 5. Edinburgh University Press: 219–236. ISBN 978-0-85224-176-9. OCLC 1067280266.
Chen, Jingwei; Sturtevant, Nathan R. (2021-05-18). "Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions". Proceedings of the AAAI Conference on Artificial Intelligence. 35 (5): 3688–3696. doi:10.1609/aaai.v35i5.16485. ISSN 2374-3468.
Fareh, Raouf; Baziyad, Mohammed; Rahman, Mohammad H.; Rabie, Tamer; Bettayeb, Maamar (2019-05-14). "Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot". Robotica. 38 (2): 235–255. doi:10.1017/S0263574719000572. ISSN 0263-5747. S2CID 181849209.

zenodo.org (Global: 621^st place; English: 380^th place)

Zeng, W.; Church, R. L. (2009). "Finding shortest paths on real road networks: the case for A*". International Journal of Geographical Information Science. 23 (4): 531–543. Bibcode:2009IJGIS..23..531Z. doi:10.1080/13658810801949850. S2CID 14833639.

A* search algorithm (English Wikipedia)

aaai.org (Global: 9,352nd place; English: 5,696th place)

aaai.org

ojs.aaai.org

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 69th place; English: 59th place)

auckland.ac.nz (Global: 4,539th place; English: 2,858th place)

cs.auckland.ac.nz

berkeley.edu (Global: 580th place; English: 462nd place)

people.eecs.berkeley.edu

books.google.com (Global: 3rd place; English: 3rd place)

cambridge.org (Global: 305th place; English: 264th place)

cmu.edu (Global: 1,564th place; English: 1,028th place)

cs.cmu.edu

doi.org (Global: 2nd place; English: 2nd place)

eur.nl (Global: low place; English: 9,966th place)

repub.eur.nl

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

ijcai.org (Global: low place; English: low place)

jair.org (Global: low place; English: low place)

nih.gov (Global: 4th place; English: 4th place)

pubmed.ncbi.nlm.nih.gov

polytechnique.fr (Global: low place; English: low place)

lix.polytechnique.fr

princeton.edu (Global: 741st place; English: 577th place)

cs.princeton.edu

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

stanford.edu (Global: 179th place; English: 183rd place)

ai.stanford.edu

theory.stanford.edu

stofanet.dk (Global: low place; English: low place)

home1.stofanet.dk

tau.ac.il (Global: 4,464th place; English: 4,468th place)

eng.tau.ac.il

uci.edu (Global: 3,063rd place; English: 2,041st place)

ics.uci.edu

umd.edu (Global: 1,747th place; English: 1,277th place)

cs.umd.edu

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

zenodo.org (Global: 621st place; English: 380th place)

aaai.org (Global: 9,352^nd place; English: 5,696^th place)

acm.org (Global: 1,185^th place; English: 840^th place)

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

auckland.ac.nz (Global: 4,539^th place; English: 2,858^th place)

berkeley.edu (Global: 580^th place; English: 462^nd place)

books.google.com (Global: 3^rd place; English: 3^rd place)

cambridge.org (Global: 305^th place; English: 264^th place)

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

eur.nl (Global: low place; English: 9,966^th place)

harvard.edu (Global: 18^th place; English: 17^th place)

nih.gov (Global: 4^th place; English: 4^th place)

princeton.edu (Global: 741^st place; English: 577^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

stanford.edu (Global: 179^th place; English: 183^rd place)

tau.ac.il (Global: 4,464^th place; English: 4,468^th place)

uci.edu (Global: 3,063^rd place; English: 2,041^st place)

umd.edu (Global: 1,747^th place; English: 1,277^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)

zenodo.org (Global: 621^st place; English: 380^th place)