The reviewed record of science sign in
Pith

arxiv: 2503.05153 · v2 · pith:IPZCKIAJ · submitted 2025-03-07 · cs.RO · cs.AI· cs.LG

Generative Trajectory Stitching through Diffusion Composition

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IPZCKIAJrecord.jsonopen to challenge →

classification cs.RO cs.AIcs.LG
keywords trajectorytasksdiffusionchunkscompdiffuserdatagenerativelearning
0
0 comments X
read the original abstract

Effective trajectory stitching for long-horizon planning is a significant challenge in robotic decision-making. While diffusion models have shown promise in planning, they are limited to solving tasks similar to those seen in their training data. We propose CompDiffuser, a novel generative approach that can solve new tasks by learning to compositionally stitch together shorter trajectory chunks from previously seen tasks. Our key insight is modeling the trajectory distribution by subdividing it into overlapping chunks and learning their conditional relationships through a single bidirectional diffusion model. This allows information to propagate between segments during generation, ensuring physically consistent connections. We conduct experiments on benchmark tasks of various difficulties, covering different environment sizes, agent state dimension, trajectory types, training data quality, and show that CompDiffuser significantly outperforms existing methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

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

  1. Energy-based Compositional Diffusion Planning

    cs.RO 2026-06 unverdicted novelty 7.0

    ECD reformulates compositional diffusion planning as energy minimization over local bridge potentials, adding a boundary reaction term and a Markov score approximation that runs in linear time.

  2. Bridging Domain Gaps with Target-Aligned Generation for Offline Reinforcement Learning

    cs.LG 2026-05 unverdicted novelty 7.0

    TCE bridges domain gaps in offline RL by selectively using source data or generating target-aligned transitions via a dual score-based model, outperforming baselines in experiments.

  3. Muninn: Your Trajectory Diffusion Model But Faster

    cs.RO 2026-05 unverdicted novelty 7.0

    Muninn accelerates diffusion trajectory planners up to 4.6x by spending an uncertainty budget to decide when to cache denoiser outputs, preserving performance and certifying bounded deviation from full computation.

  4. Hybrid Diffusion for Simultaneous Symbolic and Continuous Planning

    cs.RO 2025-09 unverdicted novelty 7.0

    Hybrid diffusion jointly generates symbolic plans and continuous trajectories for robotic planning, outperforming standard diffusion models on long-horizon tasks.

  5. Self-Predictive Representations for Combinatorial Generalization in Behavioral Cloning

    cs.LG 2025-06 unverdicted novelty 5.0

    BYOL-γ uses self-predictive representations to approximate successor representations, improving zero-shot combinatorial generalization in goal-conditioned behavioral cloning.

  6. Human2Any: Human-to-Robot Transfer via Constraint-Aware Compositional Planning

    cs.RO 2026-06 unverdicted novelty 4.0

    Human2Any transfers human video demonstrations to robots by representing tasks as object-object interactions and composing learned priors with robot-side planning.