A Dynamic Hybrid Sampling Improved RRT* Path Planning Method of the Manipulator for Diverse Map Environments

To address the core limitations of the original rapidly-exploring random tree (RRT) algorithm in adapting to diverse map environments, including slow convergence, poor path quality, and weak environmental adaptability, a dynamic hybrid sampling improved RRT* (DHSIRRT*) algorithm is proposed. It quantifies environmental complexity through dual metrics of obstacle density and relative channel width, and achieves continuous, smooth adjustment of the weights for uniform sampling, Gaussian sampling, and Cauchy sampling to enable adaptive adjustment of sampling weights across open, normal, dense, and maze typical maps. A two-factor dynamic step size model integrating obstacle distance and path curvature is built to maximize expansion efficiency while guaranteeing collision-free motion, and a two-step strategy of pruning and node fine-tuning improves path smoothness and reduce path length. Statistical experiments with 100 independent runs are conducted in 2D, 3D, and manipulator workstation scenarios. The results show that, compared with the original RRT, RRT*, and goal-biased RRT* algorithms, the proposed method achieves notable reductions in average iterations, planning time, and path length in dense and maze environments, while maintaining a planning success rate above 99%, which verifies the robustness and superiority of the algorithm across diverse map environments.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-20
DOI
https://doi.org/10.21203/rs.3.rs-11465275/v1
Primary Topic
Robotic Path Planning Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Dynamic Hybrid Sampling Improved RRT* Path Planning Method of the Manipulator for Diverse Map Environments

Chunyu Yu, Yuanlin Guan, Yibo Cheng, Xixin Yang et al.
3 links
Research Square
Robotic Path Planning Algorithms
preprint

A Dynamic Hybrid Sampling Improved RRT* Path Planning Method of the Manipulator for Diverse Map Environments

Chunyu Yu, Yuanlin Guan, Yibo Cheng, Xixin Yang, Qiulin Chen, Qi Cheng
preprint en

Abstract

To address the core limitations of the original rapidly-exploring random tree (RRT) algorithm in adapting to diverse map environments, including slow convergence, poor path quality, and weak environmental adaptability, a dynamic hybrid sampling improved RRT* (DHSIRRT*) algorithm is proposed. It quantifies environmental complexity through dual metrics of obstacle density and relative channel width, and achieves continuous, smooth adjustment of the weights for uniform sampling, Gaussian sampling, and Cauchy sampling to enable adaptive adjustment of sampling weights across open, normal, dense, and maze typical maps. A two-factor dynamic step size model integrating obstacle distance and path curvature is built to maximize expansion efficiency while guaranteeing collision-free motion, and a two-step strategy of pruning and node fine-tuning improves path smoothness and reduce path length. Statistical experiments with 100 independent runs are conducted in 2D, 3D, and manipulator workstation scenarios. The results show that, compared with the original RRT, RRT*, and goal-biased RRT* algorithms, the proposed method achieves notable reductions in average iterations, planning time, and path length in dense and maze environments, while maintaining a planning success rate above 99%, which verifies the robustness and superiority of the algorithm across diverse map environments.

Research Square
Qingdao University (CN), Qingdao University of Technology (CN)
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.

Laika access coming soon