Differential evolution algorithm for ship path planning in open waters

Abstract

A basic problem in the design of a decision support system for ship collision avoidance is path optimization in a complex and dynamic navigational environment. This paper introduces a new path planning method based on the differential evolution (DE) algorithm to calculate a safe, optimal path for a ship. The algorithm was tested on a set of traffic scenarios typically encountered in open waters. The simulation test results prove the method's ability to solve a path planning problem for ships. We also discuss the optimality, consistency, and performance of the algorithm and provide a comparison of this algorithm with the particle swarm optimization (PSO) algorithm. The comparison results clearly show a significant advantage of the DE algorithm over the PSO algorithm in the areas of output optimality, algorithm consistency, and execution efficiency.