Abstract
With the rapid development of artificial intelligence technology, the problem of intelligent path finding is gradually important, which can optimize the robot walking route and the movement problem of NPCs in the game is improved. Among many shortest path algorithms, A-star algorithm to find the path is one very classic way. In this thesis, the authors mainly study the principle of A star algorithm and compare it with Dijkstra algorithm, and conclude that A-star algorithm is more effective and convenient. In this essay, writer used Raster Method to simulate the environment with obstacle, the distance between every two grids is calculated using Manhattan Distance Formula, which regulate the convenient way of moving is from top to bottom and move around. Through the outcome of the simulation of A star algorithm in Matlab, it shows that it is a better way to search the shortest path.
Publisher
Darcy & Roy Press Co. Ltd.
Reference12 articles.
1. Xiong, R., & LIU, Y. (2015). Improvement and parallelization of A* algorithm. Journal of Computer Applications, 35(7), 1843.
2. Jing, X., & Yang, X. (2018). Application and Improvement of Heuristic Function in A* Algorithm. In 2018 37th Chinese Control Conference (CCC) IEEE.
3. Faisal, M., & Zamzami, E. M. (2020). Comparative analysis of inter-centroid K-Means performance using euclidean distance, canberra distance and manhattan distance. In Journal of Physics: Conference Series, 1566(1), 012112.
4. Candra, A. (2021). Application of A-Star Algorithm on Pathfinding Game. Journal of Physics: Conference Series, 1898(78), 012047.
5. Duchoň, F., Babinec, A., Kajan, M., Beňo, P., Florek, M., Fico, T., & Jurišica, L. (2014). Path planning with modified a star algorithm for a mobile robot. Procedia Engineering, 96, 59-69.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献