A Hexagonal Grid Cell-inspired Collision Avoidance Motion Planning Algorithm for USVs in a Velocity Domain-based Marine Environment

Optimal motion planning is a challenging problem for unmanned surface vehicle (USV) systems, especially in complex ocean environments, with inevitable dynamic obstacles induced by currents or wind flows. In this work, we propose a new motion planning algorithm for USVs considering flowing obstacles, path distance and time consumption optimization, inspired by neuron structure of entorhinal grid cells in mammals' brains, and how these grid cells learn and build cognitive maps. The proposed collision avoidance motion planning algorithm comprises three key components. First, a hexagonal grid cell-based neural network is designed to provide references of paths with optimal distance for vehicles, where one of the six neurons surrounding the vehicle's current position will be selected due to their residual lengths to the target. Second, a velocity domain that collects the kinematics of environmental flows, dynamic obstacles and the vehicle is constructed. The optimal reciprocal collision avoidance (ORCA) method is then applied to obtain the most efficient collision avoidance velocity vector for the USV, and an adjustment velocity component can be generated to eliminate both flow effects and collisions. The effectiveness of the proposed approach is demonstrated through extensive simulations in 2D conditions.

Authors

Institutions

Publication Details

Published
2024-09-23
DOI
https://doi.org/10.1109/oceans55160.2024.10754502
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Hexagonal Grid Cell-inspired Collision Avoidance Motion Planning Algorithm for USVs in a Velocity Domain-based Marine Environment

Wenwen Pei, Tianye Wang, Danjie Zhu, Ya-Jun Pan et al.
Robotic Path Planning Algorithms
article

A Hexagonal Grid Cell-inspired Collision Avoidance Motion Planning Algorithm for USVs in a Velocity Domain-based Marine Environment

Wenwen Pei, Tianye Wang, Danjie Zhu, Ya-Jun Pan, Shiwei Liu
article en

Abstract

Optimal motion planning is a challenging problem for unmanned surface vehicle (USV) systems, especially in complex ocean environments, with inevitable dynamic obstacles induced by currents or wind flows. In this work, we propose a new motion planning algorithm for USVs considering flowing obstacles, path distance and time consumption optimization, inspired by neuron structure of entorhinal grid cells in mammals' brains, and how these grid cells learn and build cognitive maps. The proposed collision avoidance motion planning algorithm comprises three key components. First, a hexagonal grid cell-based neural network is designed to provide references of paths with optimal distance for vehicles, where one of the six neurons surrounding the vehicle's current position will be selected due to their residual lengths to the target. Second, a velocity domain that collects the kinematics of environmental flows, dynamic obstacles and the vehicle is constructed. The optimal reciprocal collision avoidance (ORCA) method is then applied to obtain the most efficient collision avoidance velocity vector for the USV, and an adjustment velocity component can be generated to eliminate both flow effects and collisions. The effectiveness of the proposed approach is demonstrated through extensive simulations in 2D conditions.

Dalhousie University (CA)
Life below water
Openalex Percentile: Top 79%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.