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.
Highlights
Traditional scenic route planning only considers the shortest path, which ignores the information of scenic road conditions
In order to provide better scenic route planning for passengers, this paper presents a route planning method based on improved A* algorithm
This paper introduces one impact factors (road condition level p(n)) to the evaluation function, The improved g(n) is as follows: m g(n) = p(n) i=1 where m represents the number of road sections passed from the starting node S to the current node n. p(n) can be set as linear functions f(x) = ax + b, where x represents the actual distance of the r oad[28]
Summary
Traditional scenic route planning only considers the shortest path, which ignores the information of scenic road conditions. In the improvement of the algorithm, Zhang et al proposed a path planning method based on dijkstra, which can save driving time and oil consumption[4]. As the most effective direct search method for solving the shortest path in static road network, A* algorithm has been improved countless.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
