More than 15 years after Model Predictive Control (MPC) appeared in industry as an effective means to deal with multivariable constrained control problems, a theoretical basis for this technique has started to emerge. The issues of feasibility of the on-line optimization, stability and performance are largely understood for systems described by linear models. Much progress has been made on these issues for nonlinear systems but for practical applications many questions remain, including the reliability and efficiency of the on-line computation scheme. To deal with model uncertainty "rigorously" an involved dynamic programming problem must be solved. The approximation techniques proposed for this purpose are largely at a conceptual stage. Among the broader research needs the following areas are identified: multivariable system identification, performance monitoring and diagnostics, nonlinear state estimation, and batch system control. Many practical problems like control objective prior...

The primary disadvantage of current design techniques for model predictive control (MPC) is their inability to deal explicitly with plant model uncertainty. In this paper, we present a new approach for robust MPC synthesis which allows explicit incorporation of the description of plant uncertainty in the problem formulation. The uncertainty is expressed both in the time domain and the frequency domain. The goal is to design, at each time step, a statefeedback control law which minimizes a "worst-case" infinite horizon objective function, subject to constraints on the control input and plant output. Using standard techniques, the problem of minimizing an upper bound on the "worst-case" objective function, subject to input and output constraints, is reduced to a convex optimization involving linear matrix inequalities (LMIs). It is shown that the feasible receding horizon state-feedback control design robustly stabilizes the set of uncertain plants under consideration. Several extensions...

Abstract not found

A framework for robustness analysis of input constrained finite receding horizon control is presented. Under the assumption of quadratic upper bounds on the finite horizon costs, we derive sufficient conditions for robust stability of the standard discrete-time linear-quadratic receding horizon control formulation. This is achieved by recasting conditions for nominal and robust stability as an implication between quadratic forms, lending itself to S-procedure tools which are used to convert robustness questions to tractable convex conditions. Robustness with respect to plant/model mismatch as well as for state measurement error is shown to reduce to the feasibility of linear matrix inequalities. Simple examples demonstrate the approach. Keywords: predictive control, optimal control, linear systems, robustness, S-procedure, LMI. 1 Introduction Receding horizon, moving horizon and model predictive control are names for a state feedback control technique where the control action is dete...