现代信息科技2024，Vol.8Issue(10)：51-55,59,6.DOI:10.19850/j.cnki.2096-4706.2024.10.011
基于改进A*算法的路径规划研究
Research on Path Planning Based on Improved A* Algorithm
摘要
Abstract
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.关键词
路径规划/三维规划/惩罚因子/二叉堆与自定义优先级队列/实时阈值/局部A*算法Key words
path planning/3D planning/penalty factor/binary heap and custom priority queue/real-time threshold/local A* algorithm分类
信息技术与安全科学引用本文复制引用
蔡梓丰,张延生,梁先樟,罗世豪..基于改进A*算法的路径规划研究[J].现代信息科技,2024,8(10):51-55,59,6.基金项目
广东省普通高校特色创新项目(2022KTSX188) （2022KTSX188）
