Applications of the Improved A* Algorithm for Route Planning

In the shortest route searching algorithm, A* algorithm is proposed to improve the searching efficiency by reducing the route searching space through the heuristic function, in which it usually takes the distance and direction as two elements. But the elements of the function are not accordant. If making them unitary, it will affect the searching efficiency. The paper improves the cost function which takes the distance to the segment between the head and tail nodes as an element instead of the direction. The experimental results show that the efficiency of A* algorithm has been improved greatly.