Intelligent Pathfinding Algorithm in Web Games

Abstract

In recent years, with the hardware development of the web game is getting better and better, the game graphics computing ratio decreased a lot, the traditional scene and picture effect obtained great development at the same time, players began to pay attention to the content of a video game, hope the game role behavior can more close to real people, which makes the game developers in the artificial intelligence to enhance investment in the game, and in game ai, the role of intelligent pathfinding system is always the key point of the research. Intelligent pathfinding algorithm plays A leading role in intelligent pathfinding system. At present, the most classic intelligent pathfinding algorithm used in video games is A* (A-Star) algorithm. Many other excellent pathfinding algorithms are also developed from this algorithm. The purpose of this paper is to get rid of the limitation of having to use standard A* algorithm functions to guide pathfinding so as to quickly find A shortest path in the map. In this paper, through A detailed study of the standard A* algorithm, several optimization methods are proposed to improve it. Firstly, heuristic coefficients are added to the heuristic function of A* algorithm to optimize the search for redundant paths in pathfinding process. Binary heap is used to maintain the open list in A* algorithm. Then, the path weight in the map is optimized. The generated path is smoothed by “take the median insertion method”, and the A* algorithm is further optimized by the zonal search method, so that it can be applied to A wider range of game map types. Finally, through the test of a simulation experiment program produced by Unity3D engine, the above methods are verified. The results of this paper show that after improving the standard intelligent pathfinding algorithm, pathfinding efficiency is higher, the range of use is wider, the player experience is better, and it can be applied in the game.