← Latest papers
💻 computer science

Refining Compositional Diffusion for Reliable Long-Horizon Planning

This paper introduces Refining Compositional Diffusion (RCD), a training-free guidance method that mitigates mode-averaging in long-horizon planning by leveraging self-reconstruction error and overlap consistency to steer compositional diffusion toward high-density, globally coherent trajectories.

Original authors: Kyowoon Lee, Yunhao Luo, Anh Tong, Jaesik Choi

Published 2026-05-06
📖 4 min read☕ Coffee break read

Original authors: Kyowoon Lee, Yunhao Luo, Anh Tong, Jaesik Choi

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to guide a robot through a massive, complex maze to reach a specific goal. The robot has a "brain" (a diffusion model) that is very good at planning short trips, like moving from one corner of a room to the next. However, this brain has never seen the entire maze in one go; it only knows how to navigate short segments.

The Problem: The "Compromise" Trap

To make the robot cross the whole maze, previous methods tried to stitch these short segments together. They would take the plan for the first segment and the plan for the second segment and simply average them where they overlap.

Here is the problem with averaging: Imagine two friends giving you directions to a party.

  • Friend A says: "Go left, then turn right."
  • Friend B says: "Go right, then turn left."

If you average their advice, you end up telling the robot to "go slightly left and slightly right at the same time." The robot ends up spinning in circles or walking into a wall. In the paper's terms, this is called mode-averaging. The robot creates a path that doesn't actually exist in either friend's memory, leading to a plan that is physically impossible (like walking through a wall).

The Solution: RCD (Refining Compositional Diffusion)

The authors propose a new method called RCD. Instead of just blindly averaging the plans, RCD acts like a smart editor that checks the draft before the robot starts moving. It uses two clever tricks to fix the "averaging" mistake without needing to retrain the robot's brain or ask for more data.

Trick 1: The "Self-Check" (Self-Reconstruction Error)

Think of the robot's brain as a skilled artist who can draw a picture from a blurry sketch.

  1. RCD takes a proposed plan (a sketch).
  2. It deliberately "blurs" the sketch a little bit (adds noise).
  3. It asks the robot's brain to "clean it up" and redraw the original plan.
  4. The Test: If the brain redraws the plan perfectly, it means the plan is a "real" path the robot knows well (high density). If the brain struggles to redraw it and produces a messy, different picture, it means the plan is weird and likely impossible (low density).

RCD uses this "struggle" (reconstruction error) as a signal. If the plan is weird, RCD pushes the robot to try a different, more familiar path.

Trick 2: The "Handshake" (Overlap Consistency)

When stitching two segments together, the end of the first segment must match the start of the second segment perfectly.

  • The Problem: Sometimes, Segment A thinks the overlap should be "High," and Segment B thinks it should be "Low." Averaging them gives "Medium," which is wrong for both.
  • The Fix: RCD checks the "handshake" between the segments. If they are disagreeing on what the overlap should look like, RCD penalizes that plan. It forces the segments to agree on a single, consistent reality before the robot moves.

Why This Matters

The paper shows that by using these two checks, RCD can guide the robot to find paths that are:

  1. Physically possible: The robot doesn't walk through walls.
  2. Globally coherent: The whole journey makes sense from start to finish.
  3. Fast: Unlike other methods that try thousands of random paths and delete the bad ones (which is slow), RCD fixes the path as it's being drawn, making it much quicker.

The Results

The authors tested this on a benchmark called OGBench, which includes:

  • Locomotion: Robots (like ants or humanoids) navigating huge mazes.
  • Object Manipulation: Robotic arms stacking or moving multiple cubes.
  • Pixel-based Vision: Robots navigating mazes just by looking at 64x64 pixel images.

In all these tests, RCD consistently produced more successful plans than previous methods, especially on the hardest, longest tasks where the "averaging" problem usually causes failure. It achieved this without needing any new training data or changing the robot's underlying brain, making it a "plug-and-play" upgrade for existing systems.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →