Robot Path Planning Algorithm based on Improved A* and DWA

Aiming at the problems of low search efficiency of A* algorithm in traditional path planning, many redundant points, and inability to avoid unknown obstacles in real-time in complex environments, this paper proposes a path planning algorithm based on A* combined with Dynamic Window Approach (DWA) algorithm. First, the evaluation function of the traditional A* algorithm and the expansion strategy of sub-nodes are improved to improve the safety and search efficiency of the global path. Then the redundant nodes in the global path are processed to reduce the number of turning points and improve the smoothness of the global path. to improve the instability and energy consumption of the robot during travel; finally, based on the global path planning, the DWA algorithm is introduced to perform path planning in the local unknown environment. The local path planning is completed by retaining the key path turning points as intermediate path guidance. Real-time obstacle avoidance. Through simulation experiments, the effectiveness and feasibility of the fusion algorithm are verified.