mlsanityData to 14 Oct 2026

Structural Concept Learning via Graph Attention for Multi-Level Rearrangement Planning

arXiv 2309.02547 ↗First posted 5 Sep 2023cs.RO cs.AI cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Robotic manipulation tasks, such as object rearrangement, play a crucial role in enabling robots to interact with complex and arbitrary environments. Existing work focuses primarily on single-level rearrangement planning and, even if multiple levels exist, dependency relations among substructures are geometrically simpler, like tower stacking. We propose Structural Concept Learning (SCL), a deep learning approach that leverages graph attention networks to perform multi-level object rearrangement planning for scenes with structural dependency hierarchies. It is trained on a self-generated simulation data set with intuitive structures, works for unseen scenes with an arbitrary number of objects and higher complexity of structures, infers independent substructures to allow for task parallelization over multiple manipulators, and generalizes to the real world. We compare our method with a range of classical and model-based baselines to show that our method leverages its scene understanding to achieve better performance, flexibility, and efficiency. The dataset, supplementary details, videos, and code implementation are available at: https://manavkulshrestha.github.io/scl

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 31 of its 40 references that are in the map. First posted on arXiv 5 Sep 2023.

Builds on

31 of 40 references.

References · 31

  1. 2017Graph Attention Networkscited by 8,923
  2. 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,401
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  4. 2021How Attentive are Graph Attention Networks?cited by 835
  5. 2020Transporter Networks: Rearranging the Visual World for Robotic Manipulationcited by 344
  6. 2020Integrated Task and Motion Planningcited by 290
  7. 2020TEASER: Fast and Certifiable Point Cloud Registrationcited by 274
  8. 2020Rearrangement: A Challenge for Embodied AIcited by 155
  9. 2018PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planningcited by 150
  10. 2022iSDF: Real-Time Neural Signed Distance Fields for Robot Perceptioncited by 109
  11. 2022DALL-E-Bot: Introducing Web-Scale Diffusion Models to Roboticscited by 106
  12. 2021Visual Room Rearrangementcited by 102
19 more
  1. 2020Hierarchical Planning for Long-Horizon Manipulation with Geometric and Symbolic Scene Graphscited by 83
  2. 2023LEGO-Net: Learning Regular Rearrangements of Objects in Roomscited by 76
  3. 2021StructFormer: Learning Spatial Structure for Language-Guided Semantic Rearrangement of Novel Objectscited by 59
  4. 2020Object Rearrangement Using Learned Implicit Collision Functionscited by 43
  5. 2022IFOR: Iterative Flow Minimization for Robotic Object Rearrangementcited by 42
  6. 2021NeRP: Neural Rearrangement Planning for Unknown Objectscited by 34
  7. 2019Monte-Carlo Tree Search for Efficient Visually Guided Rearrangement Planningcited by 24
  8. 2021Long-Horizon Multi-Robot Rearrangement Planning for Construction Assemblycited by 24
  9. 2022Blocks Assemble! Learning to Assemble with Large-Scale Structured Reinforcement Learningcited by 22
  10. 2021Semantically Grounded Object Matching for Robust Robotic Scene Rearrangementcited by 21
  11. 2023CabiNet: Scaling Neural Collision Detection for Object Rearrangement with Procedural Scene Generationcited by 18
  12. 2020Where to relocate?: Object rearrangement inside cluttered and confined environments for robotic manipulationcited by 16
  13. 2021RoboAssembly: Learning Generalizable Furniture Assembly Policy in a Novel Multi-robot Contact-rich Simulation Environmentcited by 14
  14. 2019Multi-Object Rearrangement with Monte Carlo Tree Search:A Case Study on Planar Nonprehensile Sortingcited by 13
  15. 2022TarGF: Learning Target Gradient Field to Rearrange Objects without Explicit Goal Specificationcited by 13
  16. 2022Planning for Multi-Object Manipulation with Graph Neural Network Relational Classifierscited by 12
  17. 2021Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Searchcited by 9
  18. 2021Fast High-Quality Tabletop Rearrangement in Bounded Workspacecited by 9
  19. 2022Transporters with Visual Foresight for Solving Unseen Rearrangement Taskscited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 3; 2025: 1; 2026: 2.

8 papers.