任务图:在大型3D场景图上评估机器人任务规划

Christopher Agia, Krishna Murthy Jatavallabhula, M. Khodeir, O. Mikšík, Vibhav Vineet, Mustafa Mukadam, L. Paull, F. Shkurti
{"title":"任务图:在大型3D场景图上评估机器人任务规划","authors":"Christopher Agia, Krishna Murthy Jatavallabhula, M. Khodeir, O. Mikšík, Vibhav Vineet, Mustafa Mukadam, L. Paull, F. Shkurti","doi":"10.48550/arXiv.2207.05006","DOIUrl":null,"url":null,"abstract":": 3D scene graphs (3DSGs) are an emerging description; unifying symbolic, topological, and metric scene representations. However, typical 3DSGs contain hundreds of objects and symbols even for small environments; rendering task planning on the full graph impractical. We construct T ASKOGRAPHY , the first large-scale robotic task planning benchmark over 3DSGs. While most benchmarking efforts in this area focus on vision-based planning , we systemati-cally study symbolic planning, to decouple planning performance from visual rep-resentation learning. We observe that, among existing methods, neither classical nor learning-based planners are capable of real-time planning over full 3DSGs. Enabling real-time planning demands progress on both (a) sparsifying 3DSGs for tractable planning and (b) designing planners that better exploit 3DSG hierarchies. Towards the former goal, we propose SCRUB , a task-conditioned 3DSG sparsification method; enabling classical planners to match and in some cases sur-pass state-of-the-art learning-based planners. Towards the latter goal, we propose SEEK , a procedure enabling learning-based planners to exploit 3DSG structure, reducing the number of replanning queries required by current best approaches by an order of magnitude. We will open-source all code and baselines to spur further research along the intersections of robot task planning, learning and 3DSGs.","PeriodicalId":273870,"journal":{"name":"Conference on Robot Learning","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Taskography: Evaluating robot task planning over large 3D scene graphs\",\"authors\":\"Christopher Agia, Krishna Murthy Jatavallabhula, M. Khodeir, O. Mikšík, Vibhav Vineet, Mustafa Mukadam, L. Paull, F. Shkurti\",\"doi\":\"10.48550/arXiv.2207.05006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": 3D scene graphs (3DSGs) are an emerging description; unifying symbolic, topological, and metric scene representations. However, typical 3DSGs contain hundreds of objects and symbols even for small environments; rendering task planning on the full graph impractical. We construct T ASKOGRAPHY , the first large-scale robotic task planning benchmark over 3DSGs. While most benchmarking efforts in this area focus on vision-based planning , we systemati-cally study symbolic planning, to decouple planning performance from visual rep-resentation learning. We observe that, among existing methods, neither classical nor learning-based planners are capable of real-time planning over full 3DSGs. Enabling real-time planning demands progress on both (a) sparsifying 3DSGs for tractable planning and (b) designing planners that better exploit 3DSG hierarchies. Towards the former goal, we propose SCRUB , a task-conditioned 3DSG sparsification method; enabling classical planners to match and in some cases sur-pass state-of-the-art learning-based planners. Towards the latter goal, we propose SEEK , a procedure enabling learning-based planners to exploit 3DSG structure, reducing the number of replanning queries required by current best approaches by an order of magnitude. We will open-source all code and baselines to spur further research along the intersections of robot task planning, learning and 3DSGs.\",\"PeriodicalId\":273870,\"journal\":{\"name\":\"Conference on Robot Learning\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Robot Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2207.05006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Robot Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2207.05006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

摘要

: 3D场景图(3dsg)是一种新兴的描述;统一符号、拓扑和度量场景表示。然而,典型的3dsg包含数百个对象和符号,即使是小型环境;在全图上绘制任务规划不切实际。我们构建了T ASKOGRAPHY,这是第一个基于3dsg的大规模机器人任务规划基准。虽然该领域的大多数基准工作都集中在基于视觉的规划上,但我们系统地研究了符号规划,将规划绩效与视觉表征学习分离开来。我们观察到,在现有的方法中,无论是经典的还是基于学习的规划器都不能对整个3dsg进行实时规划。实现实时规划需要在以下两个方面取得进展:(a)简化3DSG以进行易于处理的规划;(b)设计更好地利用3DSG层次结构的规划器。针对前一个目标,我们提出了任务条件3DSG稀疏化方法SCRUB;使传统的规划者能够匹配并在某些情况下超越最先进的学习型规划者。为了实现后一个目标,我们提出了SEEK,这是一个使基于学习的规划器能够利用3DSG结构的过程,将当前最佳方法所需的重新规划查询数量减少了一个数量级。我们将开放所有代码和基线,以促进机器人任务规划、学习和3dsg交叉领域的进一步研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Taskography: Evaluating robot task planning over large 3D scene graphs
: 3D scene graphs (3DSGs) are an emerging description; unifying symbolic, topological, and metric scene representations. However, typical 3DSGs contain hundreds of objects and symbols even for small environments; rendering task planning on the full graph impractical. We construct T ASKOGRAPHY , the first large-scale robotic task planning benchmark over 3DSGs. While most benchmarking efforts in this area focus on vision-based planning , we systemati-cally study symbolic planning, to decouple planning performance from visual rep-resentation learning. We observe that, among existing methods, neither classical nor learning-based planners are capable of real-time planning over full 3DSGs. Enabling real-time planning demands progress on both (a) sparsifying 3DSGs for tractable planning and (b) designing planners that better exploit 3DSG hierarchies. Towards the former goal, we propose SCRUB , a task-conditioned 3DSG sparsification method; enabling classical planners to match and in some cases sur-pass state-of-the-art learning-based planners. Towards the latter goal, we propose SEEK , a procedure enabling learning-based planners to exploit 3DSG structure, reducing the number of replanning queries required by current best approaches by an order of magnitude. We will open-source all code and baselines to spur further research along the intersections of robot task planning, learning and 3DSGs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信