Closed-Loop Long-Horizon Robotic Planning via Equilibrium Sequence Modeling

Jinghan Li, Zhicheng Sun, Fei Li, Cao Sheng, Jiazhong Yu +1 more
2/12/2026

No official code found. Best implementation: Singularity0104/equilibrium-planner (13 stars, last commit 2025-05-05).

Abstract

In the endeavor to make autonomous robots take actions, task planning is a major challenge that requires translating high-level task descriptions to long-horizon action sequences. Despite recent advances in language model agents, they remain prone to planning errors and limited in their ability to plan ahead. To address these limitations in robotic planning, we advocate a self-refining scheme that iteratively refines a draft plan until an equilibrium is reached. Remarkably, this process can be optimized end-to-end from an analytical perspective without the need to curate additional verifiers or reward models, allowing us to train self-refining planners in a simple supervised learning fashion. Meanwhile, a nested equilibrium sequence modeling procedure is devised for efficient closed-loop planning that incorporates useful feedback from the environment (or an internal world model). Our method is evaluated on the VirtualHome-Env benchmark, showing advanced performance with improved scaling w.r.t. inference-time computation. Code is available at https://github.com/Singularity0104/equilibrium-planner.

View on arXivView PDF

Code Implementations(1)

[ICML 2025] Closed-Loop Long-Horizon Robotic Planning via Equilibrium Sequence Modeling

130PythonOct 2, 20241 years ago
deqtask-planningvirtualhome

Similar Papers

Cite this paper

@article{li2026closedloop,
  title  = {Closed-Loop Long-Horizon Robotic Planning via Equilibrium Sequence Modeling},
  author = {Jinghan Li and Zhicheng Sun and Fei Li and Cao Sheng and Jiazhong Yu and Yadong Mu},
  year   = {2026},
  eprint = {2410.01440},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2410.01440},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.01440.svg)](https://codeofpaper.com/paper/2410.01440)

Discussion