Path planning of scenic spots based on improved A* algorithm

Abstract

Traditional scenic route planning only considers the shortest path, which ignores the information of scenic road conditions. As the most effective direct search method to solve the shortest path in static road network, A* algorithm can plan the optimal scenic route by comprehensively evaluating the weights of each expanded node in the gridded scenic area. However, A* algorithm has the problem of traversing more nodes and ignoring the cost of road in the route planning. In order to bring better travel experience to the travelers, the above factors are taken into account. This paper presents a path planning method based on the improved A* algorithm. Firstly, the heuristic function of the A* algorithm is weighted by exponential decay to improve the calculation efficiency of the algorithm. Secondly, in order to increase the practicality of the A* algorithm, the impact factors that road conditions is introduced to the evaluation function. Finally, the feasibility of the improved A* algorithm is verified through simulation experiments. Experimental results show that the improved A* algorithm can effectively reduce the calculation time and road cost.