Skip to content
Open access

A multi-strategy integrated RRT* algorithm for efficient and optimal mobile robotic path planning

Aug 2026 · Engineering Research Express · Vol 8 · 0 citations · 59 references
Physics

TL;DR

A novel multi-strategy integrated RRT* (M-RRT*) path planning framework that enables coordinated optimization across all modules is proposed, exhibiting more pronounced comprehensive advantages in complex maze and narrow passage scenarios.

Abstract

Sampling-based motion planning algorithms have been extensively adopted for the global path planning of mobile robots and industrial manipulators in complex static environments, owing to their probabilistic completeness and computational scalability in high-dimensional configuration space. However, most existing variants predominantly rely on single optimization strategy and multi-strategy fusion approaches often suffer from insufficient collaborative design among modules. These limitations hinder the ability to simultaneously balance exploration, convergence speed, and path quality, particularly in cluttered scenes with narrow passages. To address these challenges, this study proposes a novel multi-strategy integrated RRT* (M-RRT*) path planning framework that enables coordinated optimization across all modules. First, a three-layer hybrid sampling strategy is designed, combining goal-biased sampling, obstacle Gaussian sampling, and uniform global sampling to adaptively balance global exploration and local convergence efficiency. Second, an adaptive bidirectional tree expansion mechanism can dynamically adjust the two trees expansion state. Third, a three-point local shortcut optimization serves as the post-processing module to further refine the path quality. Extensive comparative experiments are conducted across three typical 2D environments: cluttered obstacles, maze, and narrow passages environments. The results demonstrate that, compared to RRT*, the M-RRT* reduces average path length by 24.1%, sampling nodes by 84.2%, average planning time by 83.0%, and maintains a 100% success rate across all test environments—notably enhancing planning reliability in complex constrained environments. When benchmarked against Informed-RRT* and B-RRT*, M-RRT* achieves a superior equilibrium between efficiency, success rate, and path quality, exhibiting more pronounced comprehensive advantages in complex maze and narrow passage scenarios. These quantitative results validate that the M-RRT* surpasses existing baselines in overall performance and holds application potential for automated guided vehicles, inspection robots, and industrial logistics equipment.

Read PDF

Similar papers

Open access Sep 2026

Hybrid path planning for mobile robots in complex environments: Fusing improved BI-RRT and enhanced DWA

A hybrid path planning algorithm that integrates an improved Bidirectional Rapidly-exploring Random Tree (BI-RRT) for global guidance with an enhanced Dynamic Window Approach (DWA) for local execution that improves search efficiency and maintains 100% success rate across tested environments.

Guogang Wang, Hong-Wei Sun, Zi-Chao Feng · 0 citations
Conference Aug 2026

Research on Robot Path Planning Based on Multi-Strategy Improved RRT* Algorithm

To tackle challenges like route redundancy, prolonged computation duration, and convoluted paths within the RRT* algorithm for robot path planning, this research proposes a multi-strategy enhanced APF-RRT* algorithm termed MSAP-RRT*. In order to decrease the number of sampling points and increase the effectiveness of p...

Yu-Cong Yang, Qian-Long Jin, Meng-Fei Ge et al. · 0 citations
Aug 2026

Path planning for robotic arms using an improved Q-RRT* algorithm in a digital twin system

An improved algorithm with dual-tree collaborative characteristics—KQ-RRT*-Connect is proposed, which reduces the initial path calculation time of O-RRT* by 90%, the number of iterations required by 85%, and the path cost by more than 4.5%.

Hang Zhang, Zhao-Hui Wang, Zheng Zheng et al. · 0 citations
Conference Aug 2026

A Spatial-Temporal-Performance Adaptive Hybrid Sampling Strategy for Mobile Robot Path Planning

RRT* is a representative sampling-based path planning algorithm, but its convergence efficiency is limited by global uniform sampling. Existing hybrid sampling methods combine multiple samplers to balance exploration and exploitation, yet their fixed sampling proportions make them difficult to adapt to environments wit...

Zhi-Yuan Zhu, Chang-Chao Liu, Bao-Jie Zhang · 0 citations
Sep 2026

OS-RRT: a path planning algorithm for mobile robots based on optimized sampling

Compared with ACO algorithm, RRT* algorithm, RRT* algorithm and Bias-RRT algorithm, the OS-RRT algorithm can plan a better path quality in a shorter time and requires fewer sampling points, which verifies the excellent path planning performance of the OS-RRT algorithm.

Jian-Min Xu, Dong-Dong Deng, Han Meng et al. · 0 citations
Open access Sep 2026

A hybrid-enhanced walrus optimizer for mobile robot path planning

Path planning is essential to autonomous navigation in mobile robots, and its performance directly affects task execution efficiency and operational safety. To address the limited convergence accuracy, susceptibility to local optima, and limited late-stage exploitation capability of the walrus optimizer (WO) in path pl...

Min Wu, Bing-Xing Liu, Kun-Ting Zhao et al. · 0 citations

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