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*, integrating risk-density-aware adaptive corridor sampling, improvement-bound rejection, and search-state-regulated goal bias. The corridor mechanism combines reference-path deviation, obstacle clearance, and local obstacle density; the rejection mechanism filters low-contribution nodes using an optimistic improvement bound; and the goal-bias strategy adapts target-oriented sampling to the search state. Comparative simulations were conducted in sparse, dense, narrow-passage, and W-shaped environments using 50 randomized trials per algorithm with small perturbations of the start/goal positions and obstacle locations. Relative to Informed-RRT*, RC-Informed-RRT* reduced mean planning time by 45.88–74.76% and final node count by 35.92–60.13%, while reducing final path length by 0.75–4.88% and maintaining 98–100% success rates. Sequential ablation and goal-bias sensitivity experiments further support the complementary roles of the three mechanisms and the fairness of the baseline parameter setting.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2026-08-27
DOI
https://doi.org/10.3390/electronics15173858
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
article

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

Hangkun Shi, Wei Zheng, Dawei Gong, Jiang Yi
Electronics
Robotic Path Planning Algorithms
article

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

Hangkun Shi, Wei Zheng, Dawei Gong, Jiang Yi
article en

Abstract

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*, integrating risk-density-aware adaptive corridor sampling, improvement-bound rejection, and search-state-regulated goal bias. The corridor mechanism combines reference-path deviation, obstacle clearance, and local obstacle density; the rejection mechanism filters low-contribution nodes using an optimistic improvement bound; and the goal-bias strategy adapts target-oriented sampling to the search state. Comparative simulations were conducted in sparse, dense, narrow-passage, and W-shaped environments using 50 randomized trials per algorithm with small perturbations of the start/goal positions and obstacle locations. Relative to Informed-RRT*, RC-Informed-RRT* reduced mean planning time by 45.88–74.76% and final node count by 35.92–60.13%, while reducing final path length by 0.75–4.88% and maintaining 98–100% success rates. Sequential ablation and goal-bias sensitivity experiments further support the complementary roles of the three mechanisms and the fairness of the baseline parameter setting.

ElectronicsVol. 15(17)
University of Electronic Science and Technology of China (CN), Chengdu University (CN), Wuhan Ship Development & Design Institute (CN)
Openalex Percentile: Top 12%
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.