Global Path Search based on A* Algorithm

In the field of games and GIS development, the shortest path search is often involved, and the A* algorithm with heuristic functions is one of the more commonly used search algorithms. By studying the path search algorithm, on the basis of the simulation of the theory, combined with different heuristic algorithms to achieve the path planning strategy. Taking the terrain environment designed by self-design as the experimental platform, the path search algorithm is studied and the four measurement methods are compared. The final experimental results show that the path finding with the diagonal distance as the heuristic function is better reduced. The scope and scale of the algorithm search effectively improve the operational efficiency of the A* algorithm.