Semi-explicit MPC based on subspace clustering

• Autores: Gregor Goebel, Frank Allgöwer
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 83, 2017, págs. 309-316
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Abstract This paper presents a new strategy of simplifying the online computations in linear model predictive control (MPC). Employing a specific type of state dependent parameterization for the optimization variable in MPC, advantages of explicit MPC are combined with those of online optimization based MPC into an efficient MPC scheme. The parameterization is computed offline applying a tailored subspace clustering algorithm to training data consisting of states and corresponding solutions to the MPC optimization problem. It is then refined to guarantee feasibility of the parameterized optimization. During the offline design phase, complexity of the parameterization can be adjusted and control performance can be traded off against online computational effort and storage requirements. Numerical examples evaluate the presented methods and illustrate their benefits.