| Summary: | This study presents a novel ship route planning algorithm that takes into account both operational economy and safety by integrating the A∗ algorithm with a collision avoidance algorithm that evaluates the Collision Risk Index (CRI) between the own ship and the target ship. The CRI-based A∗ algorithm defines a penalty zone, allowing the own ship to explore safe routes based on the International Regulations for Preventing Collisions at Sea 1972 (COLREGs) and performs an adaptive and effective node search on an extended local map grid according to various encounter situations. The proposed algorithm is validated through simulations of head-on, fine-broad crossing, converging crossing, and overtaking encounters, indicating an economical and safe optimum route compared to conventional ship domain-based route planning.
|
|---|