A Generalization of the Riccati Recursion for Equality-Constrained Linear Quadratic Optimal Control
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:KBB73XL2record.jsonopen to challenge →
read the original abstract
This paper introduces a generalization of the well-known Riccati recursion for solving the discrete-time equality-constrained linear quadratic optimal control problem. The recursion can be used to compute the solutions as well as optimal feedback control policies. Unlike other tailored approaches for this problem class, the proposed method does not require restrictive regularity conditions on the problem. This allows its use in nonlinear optimal control problem solvers that use exact Lagrangian Hessian information. We demonstrate that our approach can be implemented in a highly efficient algorithm that scales linearly with the horizon length. Numerical tests show a significant speed-up of up to two orders of magnitude with respect to state-of-the-art general-purpose sparse linear solvers. Based on the proposed approach, faster nonlinear optimal control problem solvers can be developed that are suitable for more complex applications or for implementations on low-cost or low-power computational platforms. The implementation of the proposed algorithm is made available as open-source software.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.