A brief introduction of an improved A∗ search algorithm

This article is about A* search algorithm, which is a computer algorithm that is widely used in path-finding and graph traversal. The process of plotting an efficiently traversal path between points, called nodes. Noted for its performance and accuracy, it enjoys widespread use. In this paper, an analysis on the determination of the heuristic function and excute heuristic searching and realize the A* algorithm. At this point, we propose a more efficient method of heuristic function. Especially, A* algorithm is widely used in game development. Finally, we can prove that A* algorithm is effective and simple.