Refining Compositional Diffusion for Reliable Long-Horizon Planning
cs.RO, cs.AI, cs.LG
Submitted: 2026-05-04
Updated: 2026-10-10
Comments: Accepted to NeurIPS 2026
Code: https://github.com/devinluo27/comp_diffuser_release
Project page: https://refining-compositional-diffusion.github.io
License: http://creativecommons.org/licenses/by/4.0/
The gist: Compositional diffusion planning generates long-horizon trajectories by stitching together overlapping short-horizon segments through score composition.
Terminology
Abstract
Compositional diffusion planning generates long-horizon trajectories by stitching together overlapping short-horizon segments through score composition. However, when local plan distributions are multimodal, existing compositional methods suffer from mode-averaging, where averaging incompatible local modes leads to plans that are neither locally feasible nor globally coherent. We propose Refining Compositional Diffusion (RCD), a training-free guidance method that steers compositional sampling toward high-density, globally coherent plans. RCD leverages the self-reconstruction error of a pretrained diffusion model as a proxy for the log-density of composed plans, combined with an overlap consistency term that enforces consistency at segment boundaries. We show that the combined guidance concentrates sampling on high-density plans that mitigate mode-averaging. Experiments on challenging long-horizon tasks from OGBench, including locomotion, object manipulation, and pixel-based observations, demonstrate that RCD consistently outperforms existing methods.
Sources
- FloodDiffusion: Tailored Diffusion Forcing for Streaming Motion Generation
- BATS: Best Action Trajectory Stitching
- Simple Hierarchical Planning with Diffusion
- What Do You Need for Compositional Generalization in Diffusion Planning?
- Proximal Action Replacement for Behavior Cloning Actor-Critic in Offline Reinforcement Learning
- Diffusion Guidance Is a Controllable Policy Improvement Operator
- Learning to Reach Goals via Iterated Supervised Learning
- Model-based Trajectory Stitching for Improved Offline Reinforcement Learning
- Policy-Guided Diffusion
- GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning
- Improving Diffusion Planners by Self-Supervised Action Gating with Energies
- Test-Time Graph Search for Goal-Conditioned Reinforcement Learning
- Diffusion Policies as an Expressive Policy Class for Offline Reinforcement Learning
- Fast Monte Carlo Tree Diffusion: 100x Speedup via Parallel Sparse Planning
- MADiff: Offline Multi-agent Learning with Diffusion Models
Related papers
- FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
- MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
- RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
- ARC: A Reasoning Recipe for Robot Foundation Models
- HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
- APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies