An Adaptive Path Planning Algorithm for USV in Complex Waterways: SA-Bi-APF-RRT*

Le résumé fourni par la source

In recent years, the RRT* algorithm has been widely applied in industrial fields because of its asymptotic optimality. However, the traditional RRT* algorithm exhibits limitations in terms of convergence speed and quality of generated paths, and its path exploration capability in complex environments remains inadequate. To address these issues, this study proposes a self-adaptive bidirectional APF-RRT* (SA-Bi-APF-RRT*) algorithm. Specifically, a hierarchical node expansion mechanism is established, enabling dynamic adjustment of the new node expansion strategy. Furthermore, a bidirectional artificial potential field (APF) guidance strategy is introduced to enhance obstacle avoidance performance. An obstacle range density evaluation module, which autonomously adjusts APF parameters according to the density distribution of surrounding obstacles, is then incorporated. Additionally, the algorithm integrates a segmented greedy approach with Bézier curve fitting techniques to achieve simultaneous optimization of path length and smoothness, while ensuring path safety. Finally, the proposed algorithm is compared against RRT*, GB-RRT*, Bi-RRT*, APF-RRT*, and Bi-APF-RRT*, demonstrating superior adaptability and efficiency in environments characterized by low iteration counts and high obstacle density. Results indicate that the SA-Bi-APF-RRT* algorithm constitutes a promising optimization solution for USVs path planning tasks.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.