Publisher
Springer Nature Singapore
Reference14 articles.
1. Li J, Tinka A, Kiesel S, Durham JW, Satish Kumar TK, Koenig S (2020) Lifelong multi-agent path finding in large-scale warehouses. In: Proceedings of the international joint conference on autonomous agents and multiagent-systems, AAMAS
2. Permana SH, Bintoro KY, Arifitama B, Syahputra A (2018) Comparative analysis of pathfinding algorithms A*, Dijkstra, and BFS on maze runner game. Int J Inf Syst Technol 1(2):1–8
3. Zhang H-M, Li M-L, Yang L (2018) Safe path planning of mobile robot based on improved A* algorithm in complex terrains. Algorithms 11(4):1–18
4. Monzonís DL (2019) Pathfinding algorithms in graphs and applications. B.S. Thesis, Faculty of Mathematics and Computer Science, University of Barcelona, Barcelona, Spain
5. Baldi S, Maric N, Dornberger R, Hanne T (2018) Pathfinding optimization when solving the paparazzi problem Comparing A* and Dijkstra’s algorithm. In: 2018 6th international symposium on computational and business intelligence (ISCBI), Basel, Switzerland, pp 16–22
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献