Path Planning Algorithm Based on the Improved A-Star
LI Xingzhou
HE Feng
LI Fengyang
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.
Keywords：path planningA*algorithmAGV
Publication Date：2025-04-20
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：7( 930-935,941 )