Abstract
Aiming at the problems of strong random search characteristics and high volatility of planning path in bi-directional Rapidly-exploring Random Tree (bi-RRT) algorithm, a new random tree growth strategy is proposed, the connection between random trees is improved to improve the path-finding speed of the algorithm, and the improved bi-RRT algorithm is used to design a path planning algorithm for unmanned ships in narrow waters. At the end of this paper, the unmanned ship path planning experiment in the island and reef area is carried out, and the experimental results show that the unmanned ship path planning algorithm based on the improved bi-RRT algorithm can quickly provide a safe path for the unmanned ship in narrow waters, and has advantages over the traditional bi-RRT algorithm in terms of time performance, planning path length and volatility, which can provide relevant reference for the research of unmanned ship intelligent navigation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
