让机器人控制像优化一样自适应,简单动作快,复杂动作精。
Generative Control as Optimization: Time Unconditional Flow Matching for Adaptive and Robust Robotic Control
- 将动作生成转为迭代优化,不再依赖固定时间步
- 简单状态早收敛,复杂任务持续优化,效率提升明显
- 无需训练即可检测异常,适合安全部署的机器人系统
扩散模型与流匹配已成为机器人模仿学习的核心方法,但存在结构缺陷:推理通常依赖固定的积分时序,与状态复杂度无关。这导致政策在简单动作和复杂任务上消耗相同计算资源。本文提出生成式控制即优化(GeCO),一种时间无条件框架,将动作合成从轨迹积分转变为迭代优化。GeCO 在动作序列空间中学习一个静态速度场,专家行为形成稳定吸引子。因此,测试时推理变为自适应过程,根据收敛情况分配计算量——简单状态早退出,复杂状态持续优化。此外,该静态几何结构产生内在、无需训练的安全信号:优化后动作的场范数在分布内状态保持低位,异常时显著升高。我们在标准仿真基准上验证了GeCO,并展示其可无缝扩展至pi0系列视觉-语言-动作(VLA)模型。作为标准流匹配头的即插即用替代方案,GeCO以优化原生机制提升成功率与效率,支持安全部署。视频与代码见https://hrh6666.github.io/GeCO/
原文摘要 · Abstract (English)
Diffusion models and flow matching have become a cornerstone of robotic imitation learning, yet they suffer from a structural inefficiency where inference is often bound to a fixed integration schedule that is agnostic to state complexity. This paradigm forces the policy to expend the same computational budget on trivial motions as it does on complex tasks. We introduce Generative Control as Optimization (GeCO), a time-unconditional framework that transforms action synthesis from trajectory integration into iterative optimization. GeCO learns a stationary velocity field in the action-sequence space where expert behaviors form stable attractors. Consequently, test-time inference becomes an adaptive process that allocates computation based on convergence--exiting early for simple states while refining longer for difficult ones. Furthermore, this stationary geometry yields an intrinsic, training-free safety signal, as the field norm at the optimized action serves as a robust out-of-distribution (OOD) detector, remaining low for in-distribution states while significantly increasing for anomalies. We validate GeCO on standard simulation benchmarks and demonstrate seamless scaling to pi0-series Vision-Language-Action (VLA) models. As a plug-and-play replacement for standard flow-matching heads, GeCO improves success rates and efficiency with an optimization-native mechanism for safe deployment. Video and code can be found at https://hrh6666.github.io/GeCO/
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。