用分层潜空间模型实现视觉世界中的长程规划,提升机器人任务成功率。
Hierarchical Planning with Latent World Models

- 在共享潜空间中构建多时序尺度的世界模型,通过潜变量匹配实现分层规划
- 真实机械臂任务中成功率达70%,远超单级规划的0%;模拟任务性能更优且计算量减少3倍
- 无需任务特定奖励或技能学习,直接基于视觉预测进行分层控制,适合复杂长程任务
世界模型为零样本具身控制提供了有前景的路径,但现有方法在长程多阶段任务上表现不佳:预测误差累积,搜索空间随规划步数呈指数增长。层次结构通过将任务分解为更短、可处理的子问题来缓解这一问题。然而,以往的方法要么将控制策略固化为任务特异性策略(层次强化学习),要么依赖低维状态和已知动力学(经典层次模型预测控制)。本文提出潜空间世界模型的分层规划(HWM),一种直接基于仅通过下一潜变量预测训练的视觉世界模型的层次模型预测控制架构与范式。HWM在共享潜空间中学习多时间尺度的世界模型,使长程模型的预测作为短程模型的子目标,通过潜变量匹配实现,无需任务特定奖励、技能学习或层次策略。为保持长程搜索的可行性,HWM学习一个动作编码器,将原始动作片段压缩为潜宏动作。在真实世界Franka机械臂操作中,HWM仅需单个目标图像即可完成拾取放置任务,成功率70%,而单层级规划为0%。在模拟推拉操作和迷宫导航任务中,HWM在长程任务上性能持续提升,同时规划计算量最多降低3倍。
原文摘要 · Abstract (English)
World models are a promising path to zero-shot embodied control through planning. However, existing world model planners struggle on long-horizon, multi-stage tasks: prediction errors compound and naive search is exponential in the planning horizon. Hierarchy mitigates both by decomposing tasks into shorter, tractable subproblems; yet prior hierarchical approaches either amortize control into task-specific policies (hierarchical RL) or assume low-dimensional states and known dynamics (classical hierarchical MPC). We present Hierarchical Planning with Latent World Models (HWM), an architecture and planning paradigm for hierarchical model predictive control (MPC) directly on visual world models trained solely via next-latent prediction. HWM learns world models at multiple temporal scales within a shared latent space, so predictions from the long-horizon model serve as subgoals for the short-horizon model via latent matching, without task-specific rewards, skill learning, or hierarchical policies. To keep long-horizon search tractable, HWM learns an action encoder that compresses primitive action chunks into latent macro-actions. On real-world Franka manipulation, HWM solves pick-and-place from a single goal image at 70% success vs. 0% for single-level planning. Across simulated push manipulation and maze navigation, HWM consistently improves performance on long-horizon tasks while requiring up to 3x less planning compute.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。