Cargando…
Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning
Ship collision avoidance is a complex process that is influenced by numerous factors. In this study, we propose a novel method called the Optimal Collision Avoidance Point (OCAP) for unmanned surface vehicles (USVs) to determine when to take appropriate actions to avoid collisions. The approach comb...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10181654/ https://www.ncbi.nlm.nih.gov/pubmed/37177771 http://dx.doi.org/10.3390/s23094567 |
_version_ | 1785041625964085248 |
---|---|
author | Zhu, Hongyang Ding, Yi |
author_facet | Zhu, Hongyang Ding, Yi |
author_sort | Zhu, Hongyang |
collection | PubMed |
description | Ship collision avoidance is a complex process that is influenced by numerous factors. In this study, we propose a novel method called the Optimal Collision Avoidance Point (OCAP) for unmanned surface vehicles (USVs) to determine when to take appropriate actions to avoid collisions. The approach combines a model that accounts for the two degrees of freedom in USV dynamics with a velocity obstacle method for obstacle detection and avoidance. The method calculates the change in the USV’s navigation state based on the critical condition of collision avoidance. First, the coordinates of the optimal collision avoidance point in the current ship encounter state are calculated based on the relative velocities and kinematic parameters of the USV and obstacles. Then, the increments of the vessel’s linear velocity and heading angle that can reach the optimal collision avoidance point are set as a constraint for dynamic window sampling. Finally, the algorithm evaluates the probabilities of collision hazards for trajectories that satisfy the critical condition and uses the resulting collision avoidance probability value as a criterion for course assessment. The resulting collision avoidance algorithm is optimized for USV maneuverability and is capable of handling multiple moving obstacles in real-time. Experimental results show that the OCAP algorithm has higher and more robust path-finding efficiency than the other two algorithms when the dynamic obstacle density is higher. |
format | Online Article Text |
id | pubmed-10181654 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2023 |
publisher | MDPI |
record_format | MEDLINE/PubMed |
spelling | pubmed-101816542023-05-13 Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning Zhu, Hongyang Ding, Yi Sensors (Basel) Article Ship collision avoidance is a complex process that is influenced by numerous factors. In this study, we propose a novel method called the Optimal Collision Avoidance Point (OCAP) for unmanned surface vehicles (USVs) to determine when to take appropriate actions to avoid collisions. The approach combines a model that accounts for the two degrees of freedom in USV dynamics with a velocity obstacle method for obstacle detection and avoidance. The method calculates the change in the USV’s navigation state based on the critical condition of collision avoidance. First, the coordinates of the optimal collision avoidance point in the current ship encounter state are calculated based on the relative velocities and kinematic parameters of the USV and obstacles. Then, the increments of the vessel’s linear velocity and heading angle that can reach the optimal collision avoidance point are set as a constraint for dynamic window sampling. Finally, the algorithm evaluates the probabilities of collision hazards for trajectories that satisfy the critical condition and uses the resulting collision avoidance probability value as a criterion for course assessment. The resulting collision avoidance algorithm is optimized for USV maneuverability and is capable of handling multiple moving obstacles in real-time. Experimental results show that the OCAP algorithm has higher and more robust path-finding efficiency than the other two algorithms when the dynamic obstacle density is higher. MDPI 2023-05-08 /pmc/articles/PMC10181654/ /pubmed/37177771 http://dx.doi.org/10.3390/s23094567 Text en © 2023 by the authors. https://creativecommons.org/licenses/by/4.0/Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). |
spellingShingle | Article Zhu, Hongyang Ding, Yi Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning |
title | Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning |
title_full | Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning |
title_fullStr | Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning |
title_full_unstemmed | Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning |
title_short | Optimized Dynamic Collision Avoidance Algorithm for USV Path Planning |
title_sort | optimized dynamic collision avoidance algorithm for usv path planning |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10181654/ https://www.ncbi.nlm.nih.gov/pubmed/37177771 http://dx.doi.org/10.3390/s23094567 |
work_keys_str_mv | AT zhuhongyang optimizeddynamiccollisionavoidancealgorithmforusvpathplanning AT dingyi optimizeddynamiccollisionavoidancealgorithmforusvpathplanning |