Skip to content
Open access

RCF-RRT*: A risk-clearance cost-field-guided RRT*-based planner for global USV path planning in static risk-constrained maritime environments

Aug 2026 · Journal of King Saud University: Computer and Information Sciences · Vol 38 · 0 citations · 34 references

Abstract

Path planning for unmanned surface vehicles (USVs) in risk-constrained maritime environments requires the simultaneous consideration of obstacle avoidance, environmental risk, safety clearance, and trajectory executability. Existing sampling-based planners can efficiently explore feasible regions; however, their expansion process is often dominated by geometric metrics and therefore does not fully capture the coupled influence of environmental risk and obstacle clearance. In addition, unconstrained post-smoothing may reduce clearance, violate risk constraints, or increase local heading variation. To address these issues, this paper proposes RCF-RRT*, a risk-clearance cost-field-guided RRT*-based planning framework with feasibility-certified spline refinement. First, a traversal cost field is constructed by integrating an obstacle-distance field with an environmental risk field, and the corresponding cost-to-go information is used to guide tree expansion. Second, an adaptive step-size strategy and hard-constrained point/edge feasibility checks are introduced to reject unsafe candidate nodes and connections under collision, risk, and clearance constraints. Third, a Pareto-dominance parent-selection strategy is designed to improve the tree structure by jointly considering path length, length-normalized risk exposure, normalized turning cost, and clearance margin. Finally, a feasibility-certified and quality-gated spline-refinement mechanism is developed to prevent unsafe or degraded smoothing results from being accepted. Simulation results show that the proposed Pareto parent-selection strategy reduces the average path length by approximately 5.43% and the normalized turning cost by approximately 68.69% while maintaining a success rate of 1.00. In the complex risk-constrained scenario, RCF-RRT* reduces the average final path length by approximately 3.18% and the normalized turning cost by approximately 32.51% compared with Bi-APF-RRT*, while preserving zero sampled feasibility violations under the adopted collision, risk, and clearance criteria. These results indicate that the proposed framework improves path compactness, turning smoothness, and feasibility preservation, providing an effective global planning method for static risk-constrained USV navigation.

Read PDF

Similar papers

Open access Aug 2026

PL-RiskPlanner: Safety-Constrained Risk-Aware Path Planning for UAV Inspection in Simulated Power-Line Corridors

PL-RiskPlanner is proposed, a constraint-consistent framework that applies asset- and obstacle-specific checks before admitting grid edges, ranks the admitted edges using a power-line risk field, predicts moving-object positions at estimated UAV arrival times, and applies the same sampled verifier during smoothing.

Cong Li, Yonggang Li, Lei Tan et al. · 1 citation
Open access Aug 2026

An Improved Informed-RRT* Algorithm Based on Risk-Density-Aware Corridor Sampling and Improvement-Bound Rejection for Path Planning

Sampling-based path planning is widely used in autonomous navigation, but Informed-RRT* still relies mainly on geometric ellipsoidal sampling and does not explicitly evaluate local obstacle risk, which can lead to invalid expansion, redundant nodes, and slow convergence. This paper proposes RC-Informed-RRT*, integratin...

Hangkun Shi, Yi Jiang, Da-Wei Gong et al. · 0 citations
Open access Sep 2026

A 3D path planning method for safe UAV escape in mountainous environments based on a Q-learning parameter-adaptive RRT* algorithm

In response to the challenges of high-risk close-proximity flight and 3D path planning for unmanned aerial vehicles in mountainous power line inspection scenarios characterized by complex terrain and densely distributed power lines and trees, this paper proposes a risk-aware rapidly-exploring random tree (RRT)* algorit...

Jian Cao, Shun-Jie Han, Xing-Guang Cheng et al. · 0 citations
Open access Aug 2026

Risk-Aware Local Path Planning with Kinematic Constraints for Small Vessel Navigation in Coastal Waters Using an Integral Image-Based Obstacle Density Field

Safe navigation in coastal waters remains a persistent challenge for conventional grid-based path planning methods, which prioritize shortest-distance optimization while neglecting spatial risk distribution and kinematic trackability. This study proposes a local path planning framework that integrates an integral image...

Chan-sub Lee, Joo-sung Kim · 0 citations
Open access Sep 2026

DHM-RRT*: Dynamic Hybrid Multi-Strategy RRT* for 3D UAV Path Planning

A Dynamic Hybrid Multi-strategy RRT (DHM-RRT*) algorithm, which provides clear advantages in convergence speed, path length, smoothness and environmental robustness under complex obstacle constraints.

Kun-Jie Li, Sheng-Qun Geng, Hui-Bo Song · 0 citations
Sep 2026

Adaptive bidirectional RRT* with potential field guidance for manipulator path planning in complex environments

This paper proposes IBPAS-RRT*, an adaptive bidirectional RRT* algorithm with joint-space potential field guidance that incorporates obstacle and goal information into joint-space tree expansion, thereby avoiding repeated inverse kinematics calls during planning.

Chun-Long Qian, Hui-Fang Xiao, Liang Yu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.