Collision Avoidance Path Planning Method Combining Improved DWA and A* Algorithms in Complex Sea Environments

This paper proposes a collision avoidance path planning method that combines the improved DWA algorithm with the A* algorithm to address navigation challenges in complex sea environments. First, a simplified grid map is constructed based on electronic chart data and the start and end points of the path planning, while the physical information of the ship is determined. The improved DWA algorithm is then used for collision avoidance path planning. When the ship reaches a safe distance from an obstacle, the improved A* algorithm is triggered to plan a path, and redundant points in the returned path are extracted to obtain key waypoints. These waypoints are used as temporary target points for the DWA algorithm, and the improved DWA algorithm is further applied for collision avoidance path planning. The improvements in the DWA algorithm mainly focus on the trajectory evaluation function, while the enhancements in the A* algorithm focus on the heuristic function. Finally, by combining the proposed algorithm with rich multi-source marine environment data and target fusion data, the ship's intelligent collision avoidance decision-making system is able to generate the optimal collision avoidance path in complex water environments. Simulation results demonstrate that the proposed method can effectively plan a safe and efficient collision avoidance path.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865555
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

Collision Avoidance Path Planning Method Combining Improved DWA and A* Algorithms in Complex Sea Environments

Enjiao Zhao, Zhenxing Zhang, Liqiang Liu, Min Sun
Robotic Path Planning Algorithms
article

Collision Avoidance Path Planning Method Combining Improved DWA and A* Algorithms in Complex Sea Environments

Enjiao Zhao, Zhenxing Zhang, Liqiang Liu, Min Sun
article en

Abstract

This paper proposes a collision avoidance path planning method that combines the improved DWA algorithm with the A* algorithm to address navigation challenges in complex sea environments. First, a simplified grid map is constructed based on electronic chart data and the start and end points of the path planning, while the physical information of the ship is determined. The improved DWA algorithm is then used for collision avoidance path planning. When the ship reaches a safe distance from an obstacle, the improved A* algorithm is triggered to plan a path, and redundant points in the returned path are extracted to obtain key waypoints. These waypoints are used as temporary target points for the DWA algorithm, and the improved DWA algorithm is further applied for collision avoidance path planning. The improvements in the DWA algorithm mainly focus on the trajectory evaluation function, while the enhancements in the A* algorithm focus on the heuristic function. Finally, by combining the proposed algorithm with rich multi-source marine environment data and target fusion data, the ship's intelligent collision avoidance decision-making system is able to generate the optimal collision avoidance path in complex water environments. Simulation results demonstrate that the proposed method can effectively plan a safe and efficient collision avoidance path.

Harbin Engineering University (CN), Zhejiang University of Science and Technology (CN)
Life below water
Openalex Percentile: Top 73%
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.