arXiv:2607.24959cs.ROcs.DC2026-07

用隐函数定理加速接触密集型轨迹优化,提升机器人控制效率。

Amortising Trajectory Optimisation for Residual MPC via Implicit Contact Differentiation

论文配图:Amortising Trajectory Optimisation for Residual MPC via Implicit Contact Differentiation
图 1 · 摘自论文原文
  • 基于隐函数定理的自动微分方法,避免求解器展开与手动推导。
  • 内存增长低于4%,接触数达256时比传统方法省20倍内存。
  • 通过策略蒸馏将长时程优化转化为短时程引导,成功率提升28%-98%。

可微仿真可通过暴露任务结果对控制的局部敏感性,加速接触密集型轨迹优化。现有方法或使用有限差分(成本高且对步长敏感),或通过反向传播展开迭代接触求解器(需存储不断增长的计算轨迹),或依赖复杂且求解器特定的KKT灵敏度推导。本文提出一种基于隐函数定理(IFT)的自动微分辅助隐式导数,应用于Mujoco MJX中的正则化平滑接触。该方法对收敛解处的驻留残差进行微分,无需求解器展开,也无需手工构建KKT系统。IFT保持编译临时内存几乎恒定,从1到10次迭代间变化小于4%,而展开AD增长达10.6倍。在活跃接触数和模型维度增加时,内存增长更慢:256个接触下节省20倍内存,16个接触与96自由度下节省6倍。此外,本文引入优化器蒸馏用于残差MPC,将批量全时域iLQR的计算成果压缩为一个策略,指导短时域残差iLQR。在Finger、Franka和Unitree上,六步成功率相比标准iLQR提升28-98个百分点。

原文摘要 · Abstract (English)

Differentiable simulation can accelerate contact-rich trajectory optimisation by exposing local sensitivities of task outcomes to controls. Existing approaches either use finite differences, which are expensive and step-size sensitive; differentiate iterative contact solvers by unrolling automatic differentiation (AD), which stores a growing computation trace; or require intricate, solver-specific KKT sensitivity derivations. We introduce an AD-assisted implicit derivative for regularised smooth contacts and apply it to Mujoco MJX, based on the Implicit Function Theorem (IFT). The method differentiates the stationarity residual at the tolerance-converged solution, avoiding both solver unrolling and hand-assembled KKT systems. IFT keeps compiled temporary memory nearly constant with solver effort, changing by less than 4$\%$ from one to ten iterations versus 10.6$\times$ growth for unrolled AD. IFT memory grows slower with active contacts and model dimension, using 20$\times$ less memory at 256 contacts and 6$\times$ less at 16 contacts and 96 DoF. We further introduce optimiser distillation for residual MPC, amortising batched full-horizon iLQR into a policy that guides short-horizon residual iLQR. Across Finger, Franka, and Unitree, this raises six-step success by 28-98 percentage points over standard iLQR.

机器人控制轨迹优化隐函数定理MPC

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