An Information-Space Perspective to Scene Graph Sufficiency for Robotic Task Planning

• URL: http://arxiv.org/abs/2609.15587v1
• Date: Mon, 14 Sep 2026 13:55:41 GMT
• Title: An Information-Space Perspective to Scene Graph Sufficiency for Robotic Task Planning
• Abstract summary: Planning in complex environments requires task specifications grounded in representations that capture objects, relations, and affordances.<n>Scene graphs meet this need, but their size in large environments hinders efficient planning.<n>This paper provides a task-centric formalization of what constitutes a sufficient scene graph for planning.
• Score: 0.45119235878273006
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Planning in complex environments requires task specifications grounded in representations that capture objects, relations, and affordances; scene graphs meet this need, but their size in large environments hinders efficient planning. While task-aware pruning and hierarchical abstractions have been explored, a general, task-centric formalization of what constitutes a sufficient scene graph for planning remains open. This paper provides such a formalization by modeling planning over scene graphs within an information-spaces framework through the definition of scene graph transition systems and relevant action semantics for navigation and manipulation. We then introduce derived scene graphs via information mappings that merge and prune nodes and induce quotient transition systems augmented with motion primitives to capture higher-level actions over merged graph nodes. Sufficiency is characterized by two conditions: (i) the information mapping yields a deterministic quotient, and (ii) the task is well-posed over derived traces, ensuring plans found on the derived model are feasible on the maximal system. We illustrate the framework using a task over an example environment, showing both sufficient and insufficient reduced scene graphs.

Related papers

• GraphReAct: Reasoning and Acting for Multi-step Graph Inference [49.26607058250454]
  GraphReAct is a graph reasoning-acting framework that enables step-by-step inference over graph-structured data.<n>By interleaving reasoning with both retrieval and refinement actions, our framework enables a progressive transition from context expansion to compression.
  arXiv  Detail & Related papers  (2026-05-08T07:09:42Z)
• Contextual Graph Representations for Task-Driven 3D Perception and Planning [1.7421265706896534]
  Recent advances in computer vision facilitate fully automatic extraction of object-centric relational representations from visual-inertial data.<n>These state representations, dubbed 3D scene graphs, are a hierarchical decomposition of real-world scenes with a dense multiplex graph structure.<n>This thesis tests the suitability of existing embodied AI environments for research at the intersection of robot task planning and 3D scene graphs.
  arXiv  Detail & Related papers  (2026-03-12T00:45:12Z)
• MomaGraph: State-Aware Unified Scene Graphs with Vision-Language Model for Embodied Task Planning [44.61781303455069]
  Mobile manipulators in households must both navigate and manipulate.<n>This requires a compact, semantically rich scene representation that captures where objects are, how they function, and which parts are actionable.<n>We introduce MomaGraph, a unified scene representation for embodied agents that integrates spatial-functional relationships and part-level interactive elements.
  arXiv  Detail & Related papers  (2025-12-18T18:59:03Z)
• Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees [50.78679002846741]
  We propose a novel approach to cross-task generalization in graphs via task-trees.<n>We show that pretraining a graph neural network (GNN) on diverse task-trees with a reconstruction objective induces transferable knowledge.<n>This enables efficient adaptation to downstream tasks with minimal fine-tuning.
  arXiv  Detail & Related papers  (2024-12-21T02:07:43Z)
• Open-Vocabulary Octree-Graph for 3D Scene Understanding [54.11828083068082]
  Octree-Graph is a novel scene representation for open-vocabulary 3D scene understanding. An adaptive-octree structure is developed that stores semantics and depicts the occupancy of an object adjustably according to its shape.
  arXiv  Detail & Related papers  (2024-11-25T10:14:10Z)
• Task-Driven Graph Attention for Hierarchical Relational Object Navigation [25.571175038938527]
  Embodied AI agents in large scenes often need to navigate to find objects. We study a naturally emerging variant of the object navigation task, hierarchical object navigation (HRON) We propose a solution that uses scene graphs as part of its input and integrates graph neural networks as its backbone.
  arXiv  Detail & Related papers  (2023-06-23T19:50:48Z)
• Location-Free Scene Graph Generation [45.366540803729386]
  Scene Graph Generation (SGG) is a visual understanding task, aiming to describe a scene as a graph of entities and their relationships with each other.<n>Existing works rely on location labels in form of bounding boxes or segmentation masks, increasing annotation costs and limiting dataset expansion.<n>We break this dependency and introduce location-free scene graph generation (LF-SGG)<n>This new task aims at predicting instances of entities, as well as their relationships, without the explicit calculation of their spatial localization.
  arXiv  Detail & Related papers  (2023-03-20T08:57:45Z)
• Scene Graph Modification as Incremental Structure Expanding [61.84291817776118]
  We focus on scene graph modification (SGM), where the system is required to learn how to update an existing scene graph based on a natural language query. We frame SGM as a graph expansion task by introducing the incremental structure expanding (ISE) We construct a challenging dataset that contains more complicated queries and larger scene graphs than existing datasets.
  arXiv  Detail & Related papers  (2022-09-15T16:26:14Z)
• Sequential Manipulation Planning on Scene Graph [90.28117916077073]
  We devise a 3D scene graph representation, contact graph+ (cg+), for efficient sequential task planning. Goal configurations, naturally specified on contact graphs, can be produced by a genetic algorithm with an optimization method. A task plan is then succinct by computing the Graph Editing Distance (GED) between the initial contact graphs and the goal configurations, which generates graph edit operations corresponding to possible robot actions.
  arXiv  Detail & Related papers  (2022-07-10T02:01:33Z)
• Unconditional Scene Graph Generation [72.53624470737712]
  We develop a deep auto-regressive model called SceneGraphGen which can learn the probability distribution over labelled and directed graphs. We show that the scene graphs generated by SceneGraphGen are diverse and follow the semantic patterns of real-world scenes.
  arXiv  Detail & Related papers  (2021-08-12T17:57:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.