Research on Path Planning Based on Improved A* Algorithm
It studies the optimization method of A* algorithm in path planning of 2D and 2D models.Reduce unnecessary search space and redundant paths in open lists through real-time threshold method and penalty factor method.Adopting custom priority queues,binary heap methods,and hash tables to replace the processing methods in traditional A* algorithms.In the study of 2D maps,local A* algorithm is used to avoid large-scale searches.The experimental results show that the improved A*algorithm significantly improves the speed of search and path planning,reduces computational time and memory consumption,and verifies the feasibility and effectiveness of the algorithm.
国家科技期刊平台
NSTL
万方数据
