Journal of System Simulation ›› 2025, Vol. 37 ›› Issue (11): 2804-2811.doi: 10.16182/j.issn1004731x.joss.24-0693

• Papers • Previous Articles    

Research on Path Smoothing Processing of Mobile Robot Based on Improved A* Algorithm

Chen Mengyuan1, Qiao Guifang1,2, Zou Xu1, Cao Jiayu1, Tian Lei1   

  1. 1.School of Automation, Nanjing Institute of Technology, Nanjing 210096, China
    2.School of Instrument Science and Engineering, Southeast University, Nanjing 210096, China
  • Received:2024-07-01 Revised:2024-07-30 Online:2025-11-18 Published:2025-11-27
  • Contact: Qiao Guifang

Abstract:

Traditional bidirectional A* algorithm has many path inflection points, undergoes smoothness, and faces diagonal obstacles in path traversing. Therefore, an improved bidirectional A* algorithm was proposed. Local path constraint search was added to the forward search and backward search, respectively to solve the problem of planning paths traversing diagonal obstacles, and the effectiveness of the improved bidirectional A* algorithm to avoid traversing diagonal obstacles was verified through simulations. The path inflection points were optimized by introducing the cubic B-spline curve, and the paths before and after smoothing were tracked and controlled, respectively by using the differential-driven mobile robot. The differential mobile robot's sudden changes in velocity and acceleration were effectively mitigated. The results prove the effectiveness of the improved bidirectional A* algorithm to avoid the diagonal obstacles and improve the path smoothness.

Key words: path planning, fusion algorithm, path smoothing, bidirectional search, spline curve

CLC Number: