← 首页|学术|Reinforced Planning with Latent World Models
Machine Learning (cs.LG) · 2608.18669 · 2026/08/19

Reinforced Planning with Latent World Models

Sommer, Armin, Schilling, Jannik
TL;DR:RP1:搜索规则可以被学习——critic 评估想象结果、优化器完全离线从世界模型 roll-out 学如何改进多步计划,比手工搜索快 67×。

🎯 问题

人类靠内部世界模型在心中模拟来改进计划,但候选计划的改进本身还没被学习:现有规划器要么手工设计、要么从手工优化器蒸馏、要么只学来指导摊销策略而不直接修订计划。

🔬 方法

Reinforced Planning:把好的搜索规则强化成神经规划器。RP1 同时学 critic(评估想象结果)与完全离线训练的优化器(从想象世界模型 roll-out 学改计划),可独立训练并挂接到任意预训练潜变量世界模型。
章节结构(全文标题提取):
1 Introduction
2 Background
3 Preliminaries
4 Reinforced Planning
5 Implementation
6 Theoretical Results
7 Experiments
8 Discussion
9 Acknowledgements

📊 结果

视觉导航/手臂到达/机器人操作上显著超越手工搜索,多设置近满成功率,世界模型 roll-out 少 1000×,并发规划器推理下最快 67×。

💡 与研究方向关联

「搜索策略本身可学」把规划压进推理时路径,与 duplex 推理层的实时规划诉求直接相关。

📝 原文摘要

▶ 原文摘要 Abstract
Humans solve complex problems by constructing plans and mentally simulating their outcomes with an internal model of the world. Machine learning has produced world models that similarly predict the outcomes of action sequences, but the improvement of candidate plans still isn't fully learned. Current planners are either hand-designed, distilled from a hand-designed optimizer, or learned only to inform an amortized policy rather than to revise the plan itself. We introduce the Reinforced Planning, a method based on the idea that search can be learned by reinforcing good search rules into a neural planner. Our implementation RP1 learns both how to evaluate imagined outcomes through a critic, as well as how to improve multi-step plans through an optimizer trained fully offline from imagined world-model roll-outs. To our knowledge, RP1 is the first method to fully learn how to improve multi-step plans. Furthermore, it can be trained independently of and attached to any pretrained latent world model. Across visual navigation, arm reaching, and robotic manipulation on two world-model backbones, RP1 substantially outperforms hand-designed search algorithms, reaching near-perfect success in several settings while using $1,000 \times$ less world-model rollouts and being up to $67 \times$ faster than the strongest alternative under concurrent planner inference.
Deep Read · 2026-08-21高松灯 / Agent 日报
World ModelsPlanningLearned SearchReinforced Planning