Diffusion Subgoal Planning for Long-Horizon Offline Goal-Conditioned Reinforcement Learning

arXiv:2609.34575 · cs.AI · Submitted 2026-09-28 · Read on arXiv

cs.AI

Submitted: 2026-09-28

Updated: 2026-10-20

Comments: 31 pages, 9 figures

Code: https://github.com/Henry0132/DSP

Project page: https://henry0132.github.io/DSP

License: http://creativecommons.org/licenses/by/4.0/

The gist: Offline goal-conditioned reinforcement learning (GCRL) learns goal-directed policies from reward-free data, but in long-horizon tasks, goal-conditioned value functions often provide unstable guidance

Terminology

Abstract

Offline goal-conditioned reinforcement learning (GCRL) learns goal-directed policies from reward-free data, but in long-horizon tasks, goal-conditioned value functions often provide unstable guidance due to sparse rewards and discounting. Hierarchical methods partially mitigate this issue via subgoal decomposition; however, high-level decision-making still relies on noise-sensitive value estimates, leading to unstable behavior in complex environments. We address this limitation by proposing Diffusion Subgoal Planning (DSP), a diffusion-based framework for high-level subgoal generation. DSP casts high-level planning as guided generative inference over goal-conditioned subgoals and learns both conditional and unconditional flows, enabling classifier-free guidance to introduce a goal-directed bias at inference time. By removing explicit value-based guidance from high-level planning, DSP generates reachable and goal-directed subgoals through a generative model while retaining hierarchical execution. Experiments on offline GCRL benchmarks demonstrate that DSP outperforms prior methods on a range of navigation and manipulation tasks, with particularly strong performance in maze environments that require multi-step subgoal planning.

Sources

Related papers