Journal of System Simulation ›› 2025, Vol. 37 ›› Issue (6): 1555-1564.doi: 10.16182/j.issn1004731x.joss.24-0143

• Papers • Previous Articles    

Research on Robot Dynamic Obstacle Avoidance Method Based on Improved A* and Dynamic Window Algorithm

Zhang Yan, Li Binghua, Huo Tao, Liu Rong   

  1. School of Computer and Information Engineering, Tianjin Chengjian University, Tianjin 300380, China
  • Received:2024-02-06 Revised:2024-04-24 Online:2025-06-20 Published:2025-06-18
  • Contact: Liu Rong

Abstract:

Aiming at the problems that the traditional A* algorithm has too many extension nodes and path turning points, and can't deal with dynamic obstacles in complex environment, a robot obstacle avoidance method combining improved A* algorithm and DWA algorithm is proposed. The A* algorithm improves the neighborhood expansion method and effectively avoids the problem of redundant nodes in the classical four-neighborhood expansion and the path through the obstacle in the eight-neighborhood expansion. A quadrant selection method is proposed, which can effectively reduce the number of extended nodes in the path search process. The redundant point elimination strategy is proposed to eliminate the redundant nodes in the path, and the DWA algorithm is used to carry out local path planning between each two adjacent nodes to ensure the dynamic obstacle avoidance based on the global optimal path. The experimental results show the feasibility of the algorithm in robot path planning.

Key words: robot path planning, improved A * algorithm, DWA algorithm, dynamic obstacle avoidance

CLC Number: