Explicit model predictive control for linear parameter-varying systems

Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic programming. A relaxation technique is employed to reformulate constraints which are polynomial in the scheduling parameters to parameter-independent constraints. The algorithm allows the computation of explicit control laws for linear parameter-varying systems and enables the controller to exploit information about the scheduling parameter. This improves the control performance compared to a standard robust approach where no uncertainty knowledge is used, while keeping the benefits of fast online computations. The off-line computational burden is similar to what is required for computing explicit control laws for uncertain or nominal LTI systems. The proposed control strategy is applied to an example to compare the complexity of the resulting explicit control law to the robust controller.

• Type: Conference
• Year: 2008
• Where: CDC
• Authors: Thomas Besselmann, Johan Löfberg, Manfred Morari
• Keywords: CDC 2008, Control Systems, Explicit Control Law, Minimax Mpc Algorithm, Scheduling Parameter