Smooth Optimised A*-Guided DWA for Mobile Robot Path Planning

摘要

In mobile robot path planning, the traditional A* algorithm suffers from high path redundancy and poor smoothness, while the Dynamic Window Approach (DWA) tends to deviate from the global optimal path and has low efficiency in avoiding dynamic obstacles when integrated with global path planning. To address these issues, a smoothing optimised A*-guided DWA fusion algorithm (SOA-DWA) is proposed in this paper. Firstly, the A* algorithm was improved by introducing a path smoothing strategy and path pruning mechanism, generating a globally optimal path that complied with the vehicle kinematic constraints. Secondly, three sub-functions were introduced into the evaluation function of the DWA algorithm: the distance evaluation between the reference trajectory and the global path, the path direction evaluation, and the dynamic obstacle avoidance evaluation, to enhance the real-time performance of dynamic obstacle avoidance and the consistency of the global path. The SOA-DWA algorithm ensured that the mobile robot could effectively avoid obstacles in complex environments without deviating from the global optimal path. Thirdly, experimental results show that in a static environment, the path length and turning angle of the SOA-DWA algorithm are reduced by an average of 13.3% and 16.25%, respectively, compared with the traditional algorithm. In a dynamic environment, the path length and turning angle are reduced by an average of 10.5% and 14.5% compared to the traditional DWA algorithm, respectively, significantly improving the smoothness of the path and driving safety. Compared to the existing fusion algorithm, the SOA-DWA algorithm reduces the path length by an average of 10.1%, improves planning efficiency by an average of 42%, and effectively enhances obstacle avoidance efficiency. Finally, the effectiveness of the improved algorithm proposed in this paper was further verified by mobile robot experiments.