DAOCP: a dual active set solver for optimal control problems

Engineering notes

Engineering notes will be added by the Robot Papers editorial team.

Chinese explanation / 中文解读

中文解读待补充：本站会优先为 VLA、具身智能、人形机器人控制、机器人操作等高价值论文补充中文说明。

Original abstract

We present DAOCP, a dual active set solver for linear quadratic optimal control problems with stage-wise equality and inequality constraints. Active set methods are leading Model Predictive Control benchmarks for full-body robotics, but existing solvers operate on dense QPs, while typical problem dimensions favor methods that exploit the optimal control structure. DAOCP combines the warm-starting capabilities of active set algorithms with the better computational scaling of structure exploiting solvers, by relying on a generalization of the relationship between the Riccati recursion and the Cholesky factorization of the condensed Hessian. This result enables dual active set iterations to operate directly on the original optimal control problem through recursive computations, without explicitly forming the condensed quadratic program. On robotics benchmarks, DAOCP is the fastest of four solvers in four of five scenarios, cutting average solve time on a 58-state Atlas model by 9$\times$ relative to state of the art solvers DAQP and HPIPM.

Links and sources

• Official / arXiv page
• PDF from original source

Comments