首页> 外文会议>IEEE International Conference on Robotics and Automation >Beyond lowest-warping cost action selection in trajectory transfer
【24h】

Beyond lowest-warping cost action selection in trajectory transfer

机译:轨迹转移中超越最低翘曲成本动作的选择

获取原文

摘要

We consider the problem of learning from demonstrations to manipulate deformable objects. Recent work [1], [2], [3] has shown promising results that enable robotic manipulation of deformable objects through learning from demonstrations. Their approach is able to generalize from a single demonstration to new test situations, and suggests a nearest neighbor approach to select a demonstration to adapt to a given test situation. Such a nearest neighbor approach, however, ignores important aspects of the problem: brittleness (versus robustness) of demonstrations when generalized through this process, and the extent to which a demonstration makes progress towards a goal. In this paper, we frame the problem of selecting which demonstration to transfer as an options Markov decision process (MDP). We present max-margin Q-function estimation: an approach to learn a Q-function from expert demonstrations. Our learned policies account for variability in robustness of demonstrations and the sequential nature of our tasks. We developed two knot-tying benchmarks to experimentally validate the effectiveness of our proposed approach. The selection strategy described in [2] achieves success rates of 70% and 54%, respectively. Our approach performs significantly better, with success rates of 88% and 76%, respectively.
机译:我们考虑了从示威中学习操纵可变形物体的问题。最近的工作[1],[2],[3]已显示出令人鼓舞的结果,该结果使机器人能够通过从演示中学习来对可变形物体进行操纵。他们的方法能够从单一的演示推广到新的测试情况,并建议采用最近邻方法来选择演示以适应给定的测试情况。但是,这种最接近的邻居方法忽略了问题的重要方面:通过该过程进行概括时,演示的脆性(相对于鲁棒性)以及演示在实现目标方面的进展程度。在本文中,我们将选择转移哪些演示作为选项的马尔可夫决策过程(MDP)构成了问题。我们提出最大幅度Q函数估计:一种从专家演示中学习Q函数的方法。我们学到的政策说明了示威活动的健壮性和任务顺序性的可变性。我们开发了两个打结基准,以通过实验验证我们提出的方法的有效性。文献[2]中描述的选择策略分别获得了70%和54%的成功率。我们的方法效果明显更好,成功率分别为88%和76%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号