Comparison of Discrete Artificial Potential Field Algorithm and Wave-Front Algorithm for Autonomous Ship Trajectory Planning

34Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The article presents a novel, efficient graph search algorithm for path planning. The algorithm was inspired by the potential field method and therefore it is called the Discrete Artificial Potential Field (DAPF) algorithm. Additional trajectory optimization algorithm is also applied as a path smoothing mechanism. The algorithm is intended for use in Intelligent Transportation Systems of autonomous ships. The algorithm was implemented in the MATLAB programming language and tested by extensive simulation experiments. Results show that the algorithm can generate a collision-free path in an environment with static and dynamic obstacles, achieving near-real run time. The algorithm was also compared with the state-of-the-art graph search algorithm - a wave-front algorithm. Obtained results demonstrate that DAPF achieves better results in terms of both solution quality and run time.

Cite

CITATION STYLE

APA

Lazarowska, A. (2020). Comparison of Discrete Artificial Potential Field Algorithm and Wave-Front Algorithm for Autonomous Ship Trajectory Planning. IEEE Access, 8, 221013–221026. https://doi.org/10.1109/ACCESS.2020.3043539

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free