Resumen
Underwater autonomous path planning is a critical component of intelligent underwater vehicle system design, especially for maritime conservation and monitoring missions. Effective path planning for these robots necessitates considering various constraints related to robot kinematics, optimization objectives, and other pertinent factors. Sample-based strategies have successfully tackled this problem, particularly the rapidly exploring random tree star (RRT*) algorithm. However, conventional path-searching algorithms may face challenges in the marine environment due to unique terrain undulations, sparse and unpredictable obstacles, and inconsistent results across multiple planning iterations. To address these issues, we propose a new approach specifically tailored to the distinct features of the marine environment for navigation path planning of underwater vehicles, named bidirectional cached rapidly exploring random tree star (BCRRT*). By incorporating bidirectional path planning and caching algorithms on top of the RRT*, the search process can be expedited, and an efficient path connection can be achieved. When encountering new obstacles, ineffective portions of the cached path can be efficiently modified and severed, thus minimizing the computational workload while enhancing the algorithm?s adaptability. A certain number of simulation experiments were conducted, demonstrating that our proposed method outperformed cutting-edge techniques like the RRT* in several critical metrics such as the density of path nodes, planning time, and dynamic adaptability.