机器人
计算机科学
运动规划
卡尔曼滤波器
乙状窦函数
趋同(经济学)
树(集合论)
随机树
采样(信号处理)
数学优化
路径(计算)
功能(生物学)
移动机器人
滤波器(信号处理)
人工智能
国家(计算机科学)
贝尔曼方程
评价函数
工程类
模拟
决策树
点(几何)
收敛速度
扩展卡尔曼滤波器
实时计算
控制理论(社会学)
云计算
仿人机器人
数学
随机游动
弹道
运动(物理)
作者
Qinhu Chen,Wenqiang Wang,Zeming Fan,Meilin Kang,Chuan Yu,Ho Seok Ahn
标识
DOI:10.1109/lra.2025.3635448
摘要
A novel path planning algorithm, RewardRRT, is proposed to address the challenge of Multi-degree-of-freedom robot path planning in narrow environments. In this approach, RewardRRT conceptualizes the sampling tree of Rapidly-exploring Random Trees (RRT) as an agent, assigning a reward value function to each sampled state. Simultaneously, the cumulative reward and reward increment are utilized as the state space, with a linear Kalman Filter applied to predict the state transitions. To enhance convergence speed, a bidirectional expansion strategy is implemented, wherein the tree with the lower cumulative reward prediction is prioritized for iteration. Here, the sampling bias is regulated using a sigmoid function and the prediction value. Finally, simulation tests in 4 distinct point cloud scenarios and a real experiment are conducted using a self-designed 21-degree-of-freedom wheeled humanoid robot. Compared to the best-performing algorithm from the Open Motion Planning Library (OMPL) in the same scenarios, RewardRRT achieves improvements in speed by 38.45%, 8.18%, 9.88%, and 14.98%, respectively. Furthermore, RewardRRT exhibits an average planning success rate of 88.25%, surpassing OMPL's best-performing algorithm by 29.75%. These results underscore the effectiveness of RewardRRT in solving path planning challenges in narrow environments.
科研通智能强力驱动
Strongly Powered by AbleSci AI