Pith. sign in

REVIEW 4 cited by

Task and Motion Planning in Hierarchical 3D Scene Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.08094 v2 pith:7KYAYT3Q submitted 2024-03-12 cs.RO

classification cs.RO
keywords planningscenegraphsapproachhierarchicalrealbuildingcomputation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent work in the construction of 3D scene graphs has enabled mobile robots to build large-scale metric-semantic hierarchical representations of the world. These detailed models contain information that is useful for planning, however an open question is how to derive a planning domain from a 3D scene graph that enables efficient computation of executable plans. In this work, we present a novel approach for defining and solving Task and Motion Planning problems in large-scale environments using hierarchical 3D scene graphs. We describe a method for building sparse problem instances which enables scaling planning to large scenes, and we propose a technique for incrementally adding objects to that domain during planning time that minimizes computation on irrelevant elements of the scene graph. We evaluate our approach in two real scene graphs built from perception, including one constructed from the KITTI dataset. Furthermore, we demonstrate our approach in the real world, building our representation, planning in it, and executing those plans on a real robotic mobile manipulator. A video supplement is available at \url{https://youtu.be/v8fkwLjBn58}.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Prior-SG: Task and Prior Driven Region Segmentation for Scene Graphs in Arbitrarily-Structured Environments

    cs.RO 2026-08 conditional novelty 6.0 of 10

    Prior-SG uses an LLM-generated probabilistic prior graph and graph-cut inference to segment robot maps into task-relevant functional regions.

  2. Interleaved LLM and Motion Planning for Generalized Multi-Object Collection in Large Scene Graphs

    cs.RO 2025-07 conditional novelty 6.0 of 10

    Inter-LLM interleaves LLM task selection with motion-planning cost feedback through a multimodal similarity estimator, reporting 30% lower mission cost than SayPlan and MoMa-LLM in a simulated household setting.

  3. Towards Terrain-Aware Task-Driven 3D Scene Graph Generation in Outdoor Environments

    cs.RO 2025-06 conditional novelty 5.0 of 10

    An outdoor 3D scene graph pipeline using LiDAR-camera fusion, CLIP embeddings, and per-terrain Voronoi graphs is demonstrated on a campus dataset with qualitative results.

  4. SPADE: Towards Scalable Path Planning Architecture on Actionable Multi-Domain 3D Scene Graphs

    cs.RO 2025-05 conditional novelty 4.0 of 10

    SPADE plans paths over 3D scene graphs by combining a high-level global route, local geometric replanning, and domain-aware edge subsampling to handle dynamic scenes.

Pith tools