利用条件流匹配从点云学习机器人操纵策略

Eugenio Chisari, Nick Heppert, Max Argus, Tim Welschehold, Thomas Brox, Abhinav Valada
{"title":"利用条件流匹配从点云学习机器人操纵策略","authors":"Eugenio Chisari, Nick Heppert, Max Argus, Tim Welschehold, Thomas Brox, Abhinav Valada","doi":"arxiv-2409.07343","DOIUrl":null,"url":null,"abstract":"Learning from expert demonstrations is a promising approach for training\nrobotic manipulation policies from limited data. However, imitation learning\nalgorithms require a number of design choices ranging from the input modality,\ntraining objective, and 6-DoF end-effector pose representation. Diffusion-based\nmethods have gained popularity as they enable predicting long-horizon\ntrajectories and handle multimodal action distributions. Recently, Conditional\nFlow Matching (CFM) (or Rectified Flow) has been proposed as a more flexible\ngeneralization of diffusion models. In this paper, we investigate the\napplication of CFM in the context of robotic policy learning and specifically\nstudy the interplay with the other design choices required to build an\nimitation learning algorithm. We show that CFM gives the best performance when\ncombined with point cloud input observations. Additionally, we study the\nfeasibility of a CFM formulation on the SO(3) manifold and evaluate its\nsuitability with a simplified example. We perform extensive experiments on\nRLBench which demonstrate that our proposed PointFlowMatch approach achieves a\nstate-of-the-art average success rate of 67.8% over eight tasks, double the\nperformance of the next best method.","PeriodicalId":501031,"journal":{"name":"arXiv - CS - Robotics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learning Robotic Manipulation Policies from Point Clouds with Conditional Flow Matching\",\"authors\":\"Eugenio Chisari, Nick Heppert, Max Argus, Tim Welschehold, Thomas Brox, Abhinav Valada\",\"doi\":\"arxiv-2409.07343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Learning from expert demonstrations is a promising approach for training\\nrobotic manipulation policies from limited data. However, imitation learning\\nalgorithms require a number of design choices ranging from the input modality,\\ntraining objective, and 6-DoF end-effector pose representation. Diffusion-based\\nmethods have gained popularity as they enable predicting long-horizon\\ntrajectories and handle multimodal action distributions. Recently, Conditional\\nFlow Matching (CFM) (or Rectified Flow) has been proposed as a more flexible\\ngeneralization of diffusion models. In this paper, we investigate the\\napplication of CFM in the context of robotic policy learning and specifically\\nstudy the interplay with the other design choices required to build an\\nimitation learning algorithm. We show that CFM gives the best performance when\\ncombined with point cloud input observations. Additionally, we study the\\nfeasibility of a CFM formulation on the SO(3) manifold and evaluate its\\nsuitability with a simplified example. We perform extensive experiments on\\nRLBench which demonstrate that our proposed PointFlowMatch approach achieves a\\nstate-of-the-art average success rate of 67.8% over eight tasks, double the\\nperformance of the next best method.\",\"PeriodicalId\":501031,\"journal\":{\"name\":\"arXiv - CS - Robotics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Robotics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.07343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Robotics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

从专家示范中学习是一种从有限数据中训练机器人操纵策略的有前途的方法。然而,模仿学习算法需要一系列设计选择,包括输入模式、训练目标和 6-DoF 末端执行器姿势表示。基于扩散的方法能够预测长视角轨迹并处理多模态动作分布,因此广受欢迎。最近,有人提出了条件流匹配(ConditionalFlow Matching,CFM)(或整流)方法,作为扩散模型更灵活的概括。在本文中,我们研究了 CFM 在机器人策略学习中的应用,并特别研究了它与构建动画学习算法所需的其他设计选择之间的相互作用。我们的研究表明,CFM 与点云输入观测结果相结合时性能最佳。此外,我们还研究了 SO(3) 流形上 CFM 表述的可行性,并通过一个简化示例对其适用性进行了评估。我们在 RLBench 上进行了大量实验,结果表明我们提出的点流匹配方法在八项任务中取得了 67.8% 的最新平均成功率,是次佳方法的两倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learning Robotic Manipulation Policies from Point Clouds with Conditional Flow Matching
Learning from expert demonstrations is a promising approach for training robotic manipulation policies from limited data. However, imitation learning algorithms require a number of design choices ranging from the input modality, training objective, and 6-DoF end-effector pose representation. Diffusion-based methods have gained popularity as they enable predicting long-horizon trajectories and handle multimodal action distributions. Recently, Conditional Flow Matching (CFM) (or Rectified Flow) has been proposed as a more flexible generalization of diffusion models. In this paper, we investigate the application of CFM in the context of robotic policy learning and specifically study the interplay with the other design choices required to build an imitation learning algorithm. We show that CFM gives the best performance when combined with point cloud input observations. Additionally, we study the feasibility of a CFM formulation on the SO(3) manifold and evaluate its suitability with a simplified example. We perform extensive experiments on RLBench which demonstrate that our proposed PointFlowMatch approach achieves a state-of-the-art average success rate of 67.8% over eight tasks, double the performance of the next best method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信