QUADRATIC PROGRAMMING IN MODEL PREDICTIVE CONTROL FOR LARGE SCALE SYSTEMS
J. Buijs*, J. Ludlage**, W. Van Brempt** and B. De Moor*
* Katholieke Universiteit Leuven Department of Electrical Engineering, ESAT-SISTA Kasteelpark Arenberg 10, 3001 Heverlee (Leuven), Belgium Tel.: 32/16/32 11 60, Fax: 32/16/32 19 70 E-mail: {jeroen.buijs, bart.demoor}@esat.kuleuven.ac.be
** IPCOS Technologielaan 11-0101, 3001 Heverlee (Leuven), Belgium Tel.: 32/16/39 30 83, Fax: 32/16/32 30 80 E-mail: jobert.ludlage@ipcos.nl, wim. vanbrempt@ipcos.be url: www.ipcos.be
Model Predictive Control(MPC) is widely used, especially in the chemical process industry. Model Predictive Controllers calculate the optimal control inputs at each time step, based on past information, a plant model, a quadratic objective and given constraints. Typically this involves solving a large linearly constrained quadratic program(LCQP) at each time step. Standard methods turn out to be too slow to calculate the desired inputs in time, i.e. each sampling instant. By exploiting the structure of the LCQP, specific methods for solving the QPs in MPC were developed recently. We will compare these methods with classical QP solvers and show their necessity when controlling large systems from the example of a high density polyethylene production plant.
Keywords: Model Predictive Control, Convex optimization, Quadratic Programming
Session slot T-Mo-M17: Problem-Specific Algorithms for Optimization Problems in/Area code 2d : Optimal Control

|