Algorisme de cerca A* (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algorisme de cerca A*" in Catalan language version.

refsWebsite

Global rank Catalan rank

2^nd place

6^th place

1,564^th place

1,883^rd place

low place

low place

621^st place

1,615^th place

5^th place

5^th place

741^st place

583^rd place

5,559^th place

3,229^th place

3,600^th place

2,764^th place

942^nd place

600^th place

anu.edu.au

users.cecs.anu.edu.au

; Grastien, Alban«Improving Jump Point Search». Association for the Advancement of Artificial Intelligence.

cmu.edu

ri.cmu.edu

Krause, Alex «Anytime Dynamic A*: An Anytime, Replanning Algorithm». Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and Scheduling, 2005.
David Ferguson, Anthony Stentz, "The Field D* Algorithm for Improved Path Planning and Replanning in Uniform and Non-Uniform Cost Environments," tech. report CMU-RI-TR-05-19, Robotics Institute, Carnegie Mellon University, June, 2005

doi.org

dx.doi.org

Hart, P.; Nilsson, N. J.; Raphael, B. «A Formal Basis for the Heuristic Determination of Minimum Cost Paths». IEEE Transactions on Systems Science and Cybernetics, 4, 2, 1968, pàg. 100–107. DOI: 10.1109/TSSC.1968.300136.
Zhang, An; Li, Chong; Bi, Wenhao «Rectangle expansion A∗ pathfinding for grid maps». Chinese Journal of Aeronautics, 29, 5, 2016, pàg. 1385-1396. DOI: 10.1016/j.cja.2016.04.023 [Consulta: 9 setembre 2021].
R. Fareh, M. Baziyad, M. H. Rahman, T. Rabie, M. Bettayeb «Investigating Reduced Path Planning Strategy for Differential Wheeled Mobile Robot». Cambridge University Press, 38, 2, 2020, pàg. 235-255. DOI: 10.1017/S0263574719000572.
Korf, Richard E. «Depth-first Iterative-Deepening: An Optimal Admissible Tree Search». Artificial Intelligence, 27, 1985, pàg. 97–109. DOI: 10.1016/0004-3702(85)90084-0.
Mitchell, J. S. B.; Papadimitriou, C. H. «The weighted region problem: Finding shortest paths through a weighted planar subdivision». Journal of the ACM, 38, 1991, pàg. 18–73. DOI: 10.1145/102782.102784.

idm-lab.org

A. Nash, K. Daniel, S. Koenig and A. Felner. Theta*: Any-Angle Path Planning on Grids. In Proceedings of the AAAI Conference on Artificial Intelligence, pages 1177–1183, 2007.
Nash, A.; Koenig, S.; Likhachev, M. «Incremental Phi*: Incremental Any-Angle Path Planning on Grids». Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2009, pàg. 1824–1830.

princeton.edu

cs.princeton.edu

«Efficient Point-to-Point Shortest Path Algorithms». Princeton University.

sc.edu

cse.sc.edu

Korf, Richard E. «Depth-first Iterative-Deepening: An Optimal Admissible Tree Search». Artificial Intelligence, 27, 1985, pàg. 97–109. DOI: 10.1016/0004-3702(85)90084-0.

ualberta.ca

webdocs.cs.ualberta.ca

P. Yap, N. Burch, R. Holte, and J. Schaeffer, Block A*: Database-Driven Search with Applications in Any-angle Path-Planning. Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011.

worldcat.org

Russell, Stuart J. Artificial intelligence: A modern approach. 4a ed.. Boston: Pearson, 2018. ISBN 978-0134610993. OCLC 1021874142.

zenodo.org

Zeng, W.; Church, R. L. «Finding shortest paths on real road networks: the case for A*». International Journal of Geographical Information Science, 23, 4, 2009, pàg. 531-543.