AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.1 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Ship Design and Performance | Publishing Language: Chinese

Improved RRT*−DWA with greedy pruning for USV path planning in dynamic obstacle environments

Jinghui PENG1( ), Li DONG2, Lintao QU3, Qingfeng LIU1, Yuantao NI1, Shizheng ZHAO1
School of Artificial Intelligence, Anhui Polytechnic University, Wuhu 241000, China
College of Weaponry Engineering, Naval University of Engineering, Wuhan 430033, China
The 92767 Unit of PLA, Qingdao 266102, China
Show Author Information

Abstract

Objective

Unmanned surface vehicles (USVs) face static-dynamic obstacle threats in complex seas. Widely-used RRT*-DWA navigation frameworks suffer severe path-node redundancy, leading to frequent replanning, poor smoothness and deteriorated real-time & energy performance. This paper presents an improved path-planning method to strengthen USV dynamic obstacle-avoidance and navigation economy.

Method

A three-degree-of-freedom USV kinematic model considering ocean-current disturbances is constructed, and intelligent-agent-based dynamic obstacles are introduced to reproduce real-world maritime conditions. On the basis of standard RRT*-DWA, an adaptive greedy-pruning post-processing strategy is developed, with a maximum-connection-distance constraint added to guarantee safety inside narrow channels while eliminating redundant nodes. Comparative simulations are carried out against baseline algorithms including vanilla RRT*-DWA, pure DWA and Informed RRT*-DWA. Computational efficiency, path quality, replanning frequency and obstacle-avoidance performance are adopted as evaluation metrics.

Results

Quantitative simulations show that the improved RRT* yields 82.21 % lower average runtime, 5.66 % shorter average path length, 81.67 % fewer path nodes and 39.76 % reduced average path curvature. Within the integrated navigation system, mission navigation distance drops by 1.78 %. Compared with original RRT*-DWA, the proposed method cuts local replanning frequency by 65 % and per-control-cycle computation time by 24.67 %, while keeping safe clearance from dynamic obstacles. Further comparisons with APF-DWA and Informed RRT*-DWA verify its better trade-off between global optimality and local reactivity.

Conclusion

The adaptive-greedy-pruning-based improved RRT*-DWA effectively addresses real-time and smoothness defects originating from path redundancy. It greatly improves USV obstacle-avoidance, planning efficiency and navigation economy for dynamic marine scenarios. The embedded maximum-connection-distance constraint guarantees operational safety, offering a feasible solution for USV autonomous navigation and laying a foundation for follow-up multi-objective planning and practical sea deployment.

CLC number: U661.33 Document code: A

References

【1】
【1】
 
 
Chinese Journal of Ship Research
Pages 71-80

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
PENG J, DONG L, QU L, et al. Improved RRT*−DWA with greedy pruning for USV path planning in dynamic obstacle environments. Chinese Journal of Ship Research, 2026, 21(5): 71-80. https://doi.org/10.19693/j.issn.1673-3185.04813

4

Views

0

Downloads

0

Crossref

0

Scopus

0

CSCD

Received: 17 January 2025
Revised: 13 February 2026
Published: 14 April 2026
© 2026 Chinese Journal of Ship Research.