arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.13143cs.ROcs.SYeess.SY
收藏

RRT引导的模型预测路径积分方法

RRT Guided Model Predictive Path Integral Method

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Mercer University(默瑟大学)

Chuyuan Tao, Hunmin Kim, Naira Hovakimyan

摘要:

本文提出了一种基于最优采样的方法来解决静态和动态环境下的实时运动规划问题,利用快速探索随机树(RRT)算法和模型预测路径积分(MPPI)算法。RRT算法在MPPI算法中提供随机控制分布的标称平均值,从而在静态和动态环境中获得令人满意的控制性能,而无需进行精细的参数调整。我们还讨论了选择正确的平均值的MPPI算法,平衡探索和最优性差距,给定一个固定的样本量的重要性。特别地,需要足够大的均值来充分探索状态空间,并且需要足够小的均值来保证样本重构最优控制。所提出的方法自动化的过程中,选择正确的意思,将RRT算法。仿真结果表明,该算法可以实时解决静态或动态环境下的运动规划问题。

英文摘要:

This work presents an optimal sampling-based method to solve the real-time motion planning problem in static and dynamic environments, exploiting the Rapid-exploring Random Trees (RRT) algorithm and the Model Predictive Path Integral (MPPI) algorithm. The RRT algorithm provides a nominal mean value of the random control distribution in the MPPI algorithm, resulting in satisfactory control performance in static and dynamic environments without a need for fine parameter tuning. We also discuss the importance of choosing the right mean of the MPPI algorithm, which balances exploration and optimality gap, given a fixed sample size. In particular, a sufficiently large mean is required to explore the state space enough, and a sufficiently small mean is required to guarantee that the samples reconstruct the optimal controls. The proposed methodology automates the procedure of choosing the right mean by incorporating the RRT algorithm. The simulations demonstrate that the proposed algorithm can solve the motion planning problem in real-time for static or dynamic environments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑