The Optimization of A* Algorithm in the Practical Path Finding Application

In this paper, the analysis process of optimizing the evaluation function of A* algorithm is described, for improving the path finding method during the process of game designing. A practical path finding application contrast analysis between the non-optimized evaluation function and the optimized evaluation function is shown vividly. The non-optimized evaluation function makes the path extend along the edge of barrier, and it wastes steps. However, the optimized evaluation function anticipates the existence of obstacles, and it is cost-effective. As a result in a concrete comparison application, the step number is reduced from 22 to 16. Therefore, the problem of finding the optimal path has been solved.