计算机与数字工程2025，Vol.53Issue(4)：930-935,941,7.DOI:10.3969/j.issn.1672-9722.2025.04.003
基于改进A-star的路径规划算法
Path Planning Algorithm Based on the Improved A-Star
摘要
Abstract
Aiming at the problem of too many nodes in the traditional A*path planning algorithm with four fields and four di-rections and eight fields and eight directions,this paper proposes an improved A*path planning algorithm with 16 fields and 16 di-rections to reduce the number of nodes in the path.Compared with the traditional A*algorithm,the improved A*algorithm is simu-lated by Matlab in the grid map environment with different scales and different proportions of obstacles.The results show that the im-proved A*algorithm can reduce the number of nodes in the overall path planning route and improve the working efficiency of AGV.关键词
路径规划/A*算法/AGVKey words
path planning/A*algorithm/AGV分类
计算机与自动化引用本文复制引用
李兴州,何锋,李凤阳..基于改进A-star的路径规划算法[J].计算机与数字工程,2025,53(4):930-935,941,7.基金项目
贵州黔科合支撑基金项目(编号:[2021]一般283)资助. （编号:[2021]一般283）
