计算机科学
随机树
运动规划
数学优化
路径(计算)
路径长度
平滑的
调度(生产过程)
算法
快速通道
可控性
机器人
数学
人工智能
计算机网络
应用数学
计算机视觉
程序设计语言
作者
Yourui Huang,Wenxin Jiang,Shanyong Xu
标识
DOI:10.1038/s41598-025-13915-2
摘要
To address the issues of slow convergence speed and poor path quality of the traditional Rapidly-exploring Random Tree Star (RRT*) algorithm in complex environments, this paper proposes a Multi Strategy Bidirectional RRT* (MS-BI-RRT*) algorithm for efficient mobile robot path planning. In the new node generation phase, an expansion mode scheduling mechanism based on dynamic goal bias probability and expansion feedback is designed to enable adaptive switching among multiple expansion modes, thereby improving expansion efficiency. Meanwhile, a dynamic step size adjustment method based on local obstacle density is introduced to enhance expansion stability. During the parent node rewiring phase, a multi-factor path cost function is constructed to optimize parent node selection, thereby improving path quality. In the post-processing phase, a Bézier curve-based smoothing strategy is employed to improve trajectory continuity and dynamic controllability. Simulation results in five typical environments show that, compared with RRT*, BI-RRT*, APF-RRT*, BI-APF-RRT*, and GB-RRT*, MS-BI-RRT* algorithm reduces the average execution time by 77.50%, decreases the number of nodes by 76.41%, shortens the path length by 4.37%, and achieves a 100% success rate in all environments. These results demonstrate that the proposed method significantly improves convergence speed, path quality, and environmental adaptability, while exhibiting superior robustness.
科研通智能强力驱动
Strongly Powered by AbleSci AI