Journal of System Simulation ›› 2025, Vol. 37 ›› Issue (2): 498-507.doi: 10.16182/j.issn1004731x.joss.23-1183

• Papers • Previous Articles    

Improved Bidirectional A* Quadratic Path Planning Algorithm for Mobile Robots

Li Jiongyi1, Li Qiang1, Zhang Xinwen1, Htet Zin Myo1, Cai Yongbin2   

  1. 1.School of Mechanical and Energy Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China
    2.Hangzhou Suchuang Automation Control Technology Co. , LTD, Hangzhou 310004, China
  • Received:2023-09-22 Revised:2023-11-13 Online:2025-02-14 Published:2025-02-10
  • Contact: Li Qiang

Abstract:

Aiming at the problems of the traditional A* algorithm, such as the unhoped intersection between the planned path and the obstacles, the planned path has many inflection points and the search time is long, an improved bidirectional A* quadratic path planning algorithm for the indoor environments is proposed. Through the expansion of the map, the intersection between the planned path and the obstacle is solved. By new heuristic functions and bidirectional expansion methods, the search speed and accuracy of the bidirectional A* algorithm are improved. Turning cost function and adaptive weight are introduced to reduce the number of turning points. Quadratic programming and second-order Bezier curves are used to smooth the path, and the redundant nodes and the corners that do not conform to actual movement are deleted. Simulation results show that, the search speed is increased by 55.7%, the path length is shortened by 15.6%, and the inflection points and corners are reduced by 31.6% and 56.1%.

Key words: evaluation function, path smoothing, bidirectional A* algorithm, quadratic programming, path planning, mobile robots

CLC Number: