Hierarchical Dynamic Obstacle-Avoidance Strategy Combining Hybrid A* and DWA with Adaptive Path Re-Entry for Unmanned Surface Vessels

Obstacle-avoidance risk threshold control and global discrete keypoint re-entry are critical factors influencing the smooth dynamic obstacle avoidance of unmanned vessels. For underactuated USVs, which operate in planar motion with three degrees of freedom (surge, sway, and yaw) but only two independent control inputs (surge velocity and yaw rate), this paper designs a layered obstacle-avoidance strategy featuring adaptive global path re-entry points, combined with short- and long-term obstacle trajectory prediction and risk perception. This method employs an Interactive Multiple Model (IMM) integrating Constant Velocity (CV), Constant Acceleration (CA), and Constant Turn Rate and Acceleration (CTRA) models to perform long-term spatiotemporal trajectory prediction for dynamic obstacles, constructing a spatiotemporal risk cost map. Long-term dynamic obstacle-avoidance trajectory planning is achieved through optimized adaptive global trajectory re-entry points and an improved A* algorithm. This long-term avoidance trajectory replaces the global path from the avoidance start to the re-entry point, providing a smooth, continuous long-term avoidance prediction. To ensure real-time collision avoidance effectiveness, an improved Dynamic Window Approach (DWA) algorithm uses the long-term avoidance trajectory as a foundation. It integrates the IMM’s short-term spatiotemporal obstacle trajectory prediction, sampling in the velocity and steering angle space to generate short-term avoidance control commands. Finally, the long-term and short-term obstacle-avoidance planning are executed in a receding-horizon manner, where the local DWA planner updates control inputs over a short rolling window without solving a full constrained optimization problem. This establishes a hierarchical avoidance strategy: long-term prediction enables smooth avoidance, while short-term prediction enables real-time avoidance, ensuring the continuity and timeliness of dynamic obstacle avoidance. Simulation results demonstrate that compared with traditional A* planning, the proposed risk-aware A* reduces cumulative collision risk by 62% and increases the minimum obstacle clearance distance by over 32.1%, while maintaining acceptable path length growth. This approach effectively reduces collision risks during navigation, enhances path smoothness, and improves navigation safety.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-03-11
DOI
https://doi.org/10.3390/app16062692
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

Hierarchical Dynamic Obstacle-Avoidance Strategy Combining Hybrid A* and DWA with Adaptive Path Re-Entry for Unmanned Surface Vessels

Leilei Cheng, Q. Wang, Gang Zhang, Kexin Wang
Applied Sciences
Robotic Path Planning Algorithms
article

Hierarchical Dynamic Obstacle-Avoidance Strategy Combining Hybrid A* and DWA with Adaptive Path Re-Entry for Unmanned Surface Vessels

Leilei Cheng, Q. Wang, Gang Zhang, Kexin Wang
article en

Abstract

Obstacle-avoidance risk threshold control and global discrete keypoint re-entry are critical factors influencing the smooth dynamic obstacle avoidance of unmanned vessels. For underactuated USVs, which operate in planar motion with three degrees of freedom (surge, sway, and yaw) but only two independent control inputs (surge velocity and yaw rate), this paper designs a layered obstacle-avoidance strategy featuring adaptive global path re-entry points, combined with short- and long-term obstacle trajectory prediction and risk perception. This method employs an Interactive Multiple Model (IMM) integrating Constant Velocity (CV), Constant Acceleration (CA), and Constant Turn Rate and Acceleration (CTRA) models to perform long-term spatiotemporal trajectory prediction for dynamic obstacles, constructing a spatiotemporal risk cost map. Long-term dynamic obstacle-avoidance trajectory planning is achieved through optimized adaptive global trajectory re-entry points and an improved A* algorithm. This long-term avoidance trajectory replaces the global path from the avoidance start to the re-entry point, providing a smooth, continuous long-term avoidance prediction. To ensure real-time collision avoidance effectiveness, an improved Dynamic Window Approach (DWA) algorithm uses the long-term avoidance trajectory as a foundation. It integrates the IMM’s short-term spatiotemporal obstacle trajectory prediction, sampling in the velocity and steering angle space to generate short-term avoidance control commands. Finally, the long-term and short-term obstacle-avoidance planning are executed in a receding-horizon manner, where the local DWA planner updates control inputs over a short rolling window without solving a full constrained optimization problem. This establishes a hierarchical avoidance strategy: long-term prediction enables smooth avoidance, while short-term prediction enables real-time avoidance, ensuring the continuity and timeliness of dynamic obstacle avoidance. Simulation results demonstrate that compared with traditional A* planning, the proposed risk-aware A* reduces cumulative collision risk by 62% and increases the minimum obstacle clearance distance by over 32.1%, while maintaining acceptable path length growth. This approach effectively reduces collision risks during navigation, enhances path smoothness, and improves navigation safety.

Applied SciencesVol. 16(6)
Ningbo University (CN)
Openalex Percentile: Top 25%
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.