円錐・相補性制約付き軌道最適化のための微分可能ソルバCALIPSO
CALIPSO: A Differentiable Solver for Trajectory Optimization with Conic and Complementarity Constraints
接触や摩擦を含む非凸軌道最適化を安定して解き、解の微分も可能なロボティクス向けソルバを提案。
著者: Taylor A. Howell, Simon Le Cleac'h, Kevin Tracy, Zachary Manchester
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
We present a new solver for non-convex trajectory optimization problems that is specialized for robotics applications. CALIPSO, or the Conic Augmented Lagrangian Interior-Point SOlver, combines several strategies for constrained numerical optimization to natively handle second-order cones and complementarity constraints. It reliably solves challenging motion-planning problems that include contact-implicit formulations of impacts and Coulomb friction and state-triggered constraints where general-purpose non-convex solvers like SNOPT and Ipopt fail to converge. Additionally, CALIPSO supports efficient differentiation of solutions with respect to problem data, enabling bi-level optimization applications like auto-tuning of feedback policies. Reliable convergence of the solver is demonstrated on a range of problems from manipulation, locomotion, and aerospace domains. An open-source implementation of this solver is available.
