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.

Details

Title
Path planning of scenic spots based on improved A* algorithm
Author
Wang, Xingdong 1 ; Zhang Haowei 1 ; Liu, Shuo 1 ; Wang, Jialu 2 ; Wang, Yuhua 1 ; Shangguan Donghui 3 

 Henan University of Technology, College of Information Science and Engineering, Zhengzhou, China (GRID:grid.412099.7) (ISNI:0000 0001 0703 7066) 
 Anshun University, School of Resources and Environmental Engineering, Anshun, China (GRID:grid.488144.5) (ISNI:0000 0004 7417 3852) 
 Chinese Academy Sciences, State Key Laboratory of Cryospheric Science, Northwest Institute of Eco-Environment and Resources, Lanzhou, China (GRID:grid.9227.e) (ISNI:0000000119573309) 
Publication year
2022
Publication date
2022
Publisher
Nature Publishing Group
e-ISSN
20452322
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
2622677452
Copyright
© The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.