Skip to content
Conference

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

Aug 2026 · International Conference on Advanced Computational Intelligence · pp. 238-245 · 0 citations · 24 references

Abstract

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 with different structural complexities. To address this issue, this paper proposes TDA-RRT*, a spatial-temporal-performance adaptive variant of RRT*. The proposed method dynamically adjusts the weights of uniform sampling, normal-distribution sampling, and goal-biased sampling from the spatial, temporal, and performance perspectives. Specifically, the spatial dimension extracts environmental features to initialize sampling weights, the temporal dimension guides the transition from global exploration to local exploitation, and the performance dimension provides online feedback based on the actual effectiveness of each sampler. Comparative experiments in narrow passage, maze, and forest scenarios show that TDA-RRT* reduces the average number of convergence iterations by 65%, 48%, and 20% compared with RRT*, Informed-RRT*, and Hybrid-RRT*, respectively, while maintaining comparable path quality. The results verify the effectiveness of the proposed adaptive hybrid sampling strategy.

View source

Similar papers

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
Conference Aug 2026

Comparative Analysis of A* and RRT Variants for Mobile Robot Path Planning in Multi-Scale Grid Environments

To address the trade-off between planning efficiency, path optimality, and trajectory tracking accuracy of mobile robot path planners under different spatial environments, this paper constructs square $(\mathbf{5 0 0} \times \mathbf{5 0 0})$ and elongated $(\mathbf{1 0 2 4} \times \mathbf{3 5 0})$ grid simulation maps...

Tian-Quan Feng · 0 citations
Conference Oct 2026

Performance comparison of RRT-series algorithms for mobile robot path planning

This paper presents a comparative performance evaluation of three sampling-based path planning algorithms—RRT, RRT-Connect, and RRT*—for mobile robot navigation in complex environments. Experiments are conducted on three obstacle-avoidance maps with two distinct path-length scenarios, using path length, planning time,...

Jia-Jun Liu · 0 citations
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
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.