TASKOGRAPHY: Evaluating robot task planning over large 3D scene graphs

Christopher Agia, Krishna Murthy Jatavallabhula, Mohamed Khodeir, Ondrej Miksik, Vibhav Vineet +3 more
7/11/2022
cs.ROcs.AIcs.LG

No official code found. Best implementation: taskography/taskography (19 stars, last commit 2022-07-08).

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 TASKOGRAPHY, the first large-scale robotic task planning benchmark over 3DSGs. While most benchmarking efforts in this area focus on vision-based planning, we systematically study symbolic planning, to decouple planning performance from visual representation 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 surpass 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.

View on arXivView PDF

Code Implementations(1)

Task planning over 3D scene graphs

191Apr 13, 20214 years ago

Similar Papers

Cite this paper

@article{agia2022taskography,
  title  = {TASKOGRAPHY: Evaluating robot task planning over large 3D scene graphs},
  author = {Christopher Agia and Krishna Murthy Jatavallabhula and Mohamed Khodeir and Ondrej Miksik and Vibhav Vineet and Mustafa Mukadam and Liam Paull and Florian Shkurti},
  year   = {2022},
  eprint = {2207.05006},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.05006v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.05006.svg)](https://codeofpaper.com/paper/2207.05006)

Discussion