arXiv:2602.00475cs.LGcs.RO2026-02被引 7

用可微世界模型实现高效并行规划,解决长时序视觉控制难题

Parallel Stochastic Gradient-Based Planning for World Models

  • 将状态设为可优化变量,结合软动力学约束,支持并行计算
  • 引入随机性探索避免局部最优,在长周期任务中成功率显著提升
  • 仅需动作输入梯度,有效缓解高维视觉模型的敏感梯度问题

世界模型从视频等原始感知输入中模拟环境动态。然而,由于搜索空间巨大且无结构,使用它们进行规划颇具挑战。本文提出一种鲁棒且高度并行的规划器——GRASP(Gradient RelAxed Stochastic Planner),利用学习到的世界模型的可微性,实现高效优化,从视觉输入解决长时序控制任务。方法将状态视为优化变量(“虚拟状态”),施加软动力学约束,支持并行计算与更易优化。为促进探索并避免局部最优,引入状态随机性。为缓解高维视觉世界模型中的敏感梯度问题,修改梯度结构,仅需动作输入梯度即可朝有效计划方向下降。实验表明,该规划器在基于视频的世界模型上优于交叉熵法(CEM)和传统梯度优化(GD),在成功率达90%以上且收敛速度更快。

原文摘要 · Abstract (English)

World models simulate environment dynamics from raw sensory inputs like video. However, using them for planning can be challenging due to the vast and unstructured search space. We propose a robust and highly parallelizable planner that leverages the differentiability of the learned world model for efficient optimization, solving long-horizon control tasks from visual input. Our method treats states as optimization variables ("virtual states") with soft dynamics constraints, enabling parallel computation and easier optimization. To facilitate exploration and avoid local optima, we introduce stochasticity into the states. To mitigate sensitive gradients through high-dimensional vision-based world models, we modify the gradient structure to descend towards valid plans while only requiring action-input gradients. Our planner, which we call GRASP (Gradient RelAxed Stochastic Planner), can be viewed as a stochastic version of a non-condensed or collocation-based optimal controller. We provide theoretical justification and experiments on video-based world models, where our resulting planner outperforms existing planning algorithms like the cross-entropy method (CEM) and vanilla gradient-based optimization (GD) on long-horizon experiments, both in success rate and time to convergence.

世界模型规划算法可微优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。