A high-performance Riccati based solver for tree-structured quadratic programs*. Issue 1 (July 2017)

• Record Type: Journal Article
• Authors: Frison, Gianluca; Kouzoupis, Dimitris; Diehl, Moritz; Jørgensen, John Bagterp
• Is Part Of: IFAC-PapersOnLine. Volume 50:Issue 1(2017)
• Page Start: 14399
• Page End: 14405
• Publication Date: 2017-07
• Subjects: Predictive control -- Quadratic programming -- Tree structures -- Numerical methods; Automatic control -- Periodicals; 629.805
• DOI: 10.1016/j.ifacol.2017.08.2027
• Languages: English
• ISSNs: 2405-8963

Abstract

Abstract: Robust multi-stage Model Predictive Control (MPC) is an increasingly popular approach to handle model uncertainties due to the simplicity of its problem formulation and other attractive properties. However, the exponential growth of the problem dimensions with respect to the robust horizon renders the online solution of such problems challenging and the development of tailored solvers crucial. In this paper, an interior point method is presented that can solve Quadratic Programs (QPs) arising in multi-stage MPC efficiently by means of a tree-structured Riccati recursion and a high-performance linear algebra library. A performance comparison with code-generated and general purpose sparse QP solvers shows that the computation times can be significantly reduced for all problem sizes that are practically relevant in embedded MPC applications. The presented implementation is freely available as part of the open-source software HPMPC.