BGSE-RRT*: A Goal-Guided and Multi-Sector Sampling-Expansion Path Planning Algorithm for Complex Environments
Year: 2026
Type: article
Abstract: In complex ground environments, conventional RRT* often suffers from low planning efficiency and poor path quality for robot path planning. This paper proposes BGSE-RRT* (Bi-tree Cooperative, Goal-guided, low-discrepancy Sampling, multi-sector Expansion). First, BGSE-RRT* constructs a nonlinear switching probability via bi-tree cooperative adaptive switching, together with KD-Tree nearest-neighbor acceleration and multi-condition triggering, to adaptively balance global exploration and local convergence. Meanwhile, a goal-guided expansion with dynamic target binding and adaptive step size, under a multi-constraint feasibility check, accelerates the convergence of the two trees. When the goal-guided expansion becomes blocked, BGSE-RRT* generates candidate points in local multi-sector regions using a 2D Halton low-discrepancy sequence and selects the best candidate for expansion; if the multi-sector expansion still fails, a sampling-point-guided expansion is activated to continue advancing and search for a feasible path. Second, B-spline smoothing is applied to improve trajectory continuity. Finally, in five simulation environments and ROS/real-robot joint validation, compared with GB-RRT*, BI-RRT*, BI-APF-RRT*, and BAI-RRT*, BGSE-RRT* reduces planning time by up to 84.71%, shortens path length by 2.94-6.88%, and improves safety distance by 20.68-48.33%. In ROS/real-robot validation, the trajectory-tracking success rate reaches 100%.
Source: Sensors
DOI: 10.3390/s26061837
Authors: Wenhao Yue, Xiang Li, Ziyue Liu, Xiaojiang Jiang, Lanlan Pan
Institution: Dalian Ocean University
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $3,137
OpenAlex ID: W7136436748