Path planning for A*algorithm based on searching 24 neighborhoods
CUI Bao-xia
WANG Miao-chi
DUAN Yong
Abstract：In order to solve the problem that the path length is not the best and the turning point is many when the traditional A*algorithm is used in the path planning of mobile robot, a path planning for A*algorithm based on searching 24 neighborhoods was proposed. The heuristic search strategy was further improved on the basis of the traditional A*algorithm, the number of searching neighborhood in the traditional A*algorithm was extended from 8 discrete points to 24 points,and then more searching directions could be increased. The results show that the improved A*algorithm can realize the purpose of shorter path length,and can reduce the number of turning points simultaneously. The operating path of mobile robot also becomes smoother. The proposed method has stronger practical significance and application background,and the effectiveness of the design method is verified through the actually operating process.
Keywords：robotpath planninggrid methodgliding property8 neighborhoodsoptimal pathheuristic search24 neighborhoods
Publication Date：2018-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：5( 180-184 )