A Two-Stage Path Planning Algorithm Based on Rapid-Exploring Random Tree for Ships Navigating in Multi-Obstacle Water Areas Considering COLREGs

Abstract

A two-stage ship path planning method is proposed, based on the Rapid-exploring Random Tree (RRT) algorithm, which is composed of global path planning and local path planning, addressing the important problem of finding an economical and safe path from start to destination for ships under dynamic environment, especially in waters with multiple obstacles and multiple target ships. The global path planning takes into consideration the ship draft and Under Keel Clearance to find navigable water using RRT, and reduces the path length and waypoints based on elliptic sampling and smoothing. In the local path planning, a dynamic collision risk detection model is constructed by introducing the Quaternion Ship Domain under a dynamic environment, and the restrictions of ship manoeuvrability and COLREGs are also involved. The simulation results show that the proposed model can find a satisfactory path within a few iterations, and keep clear of both static obstacles and dynamic ships. The research can be used to make and verify planned ship routes before sailing and to guide officers to make decisions regarding collision avoidance.