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

基于模型预测路径积分控制的不确定性规避推送

Uncertainty Averse Pushing with Model Predictive Path Integral Control

University of Birmingham(伯明翰大学);University of Edinburgh(爱丁堡大学)

Ermano Arruda, Michael J Mathew, Marek Kopicki, Michael Mistry, Morteza Azad, Jeremy L Wyatt

摘要:

规划强大的机器人操作需要良好的前向模型,使强大的计划被发现。这项工作显示了如何实现这一目标,使用前向模型从机器人数据学习计划推操作。我们探索了学习方法(高斯过程回归和混合密度网络),这些方法可以估计预测中的不确定性。模型预测路径积分(MPPI)控制器利用这些学习的模型来规划如何将盒子推到目标位置。该规划器避免了在正演模型中具有高预测不确定性的区域。这既包括动态中固有的不确定性,也包括由于数据有限而产生的Meta不确定性。因此,推进任务相对于前向模型中的估计不确定性以鲁棒的方式完成,并且不需要可微分的成本函数。我们在一个真实的机器人上演示了该方法,并表明学习可以胜过物理模拟。使用模拟,我们还显示了规划不确定性规避路径的能力。

英文摘要:

Planning robust robot manipulation requires good forward models that enable robust plans to be found. This work shows how to achieve this using a forward model learned from robot data to plan push manipulations. We explore learning methods (Gaussian Process Regression, and an Ensemble of Mixture Density Networks) that give estimates of the uncertainty in their predictions. These learned models are utilised by a model predictive path integral (MPPI) controller to plan how to push the box to a goal location. The planner avoids regions of high predictive uncertainty in the forward model. This includes both inherent uncertainty in dynamics, and meta uncertainty due to limited data. Thus, pushing tasks are completed in a robust fashion with respect to estimated uncertainty in the forward model and without the need of differentiable cost functions. We demonstrate the method on a real robot, and show that learning can outperform physics simulation. Using simulation, we also show the ability to plan uncertainty averse paths.

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

↑