An Improved A* Algorithm Applying to Path Planning of Games

Abstract Pathfinding is the core issues in the artificial intelligence field of games, and how to establish an effective method of pathfinding is still focused on. A* algorithm is the most widespread type of game pathfinding at present but the problems still exist such as the curve path and the time-consuming. Based on the analysis and research of traditional A* algorithm, this paper proposes an A* algorithm based on region search. Firstly, the algorithm divides the game map into several connected regions where the role can move freely and without barriers. Then the algorithm uses region search instead of node search. It reduces the search path and the search time. According to the portal between regions, the optimal feasible path is extracted from the region paths. It can effectively solve the zigzag path problem. Experimental simulation results show that the algorithm has shorter search time and can generate smoother path and meet the real-time and real experience requirements of pathfinding in the game.