Professional Documents
Culture Documents
Mark Cannon
mark.cannon@eng.ox.ac.uk
1-1
Overview of MPC
The strategy: 1. Prediction 2. Online optimization 3. Receding horizon implementation
1-2
Overview of MPC
2. Optimization Predicted cost: Solve numerically: optimal input sequence
1-3
Overview of MPC
prediction horizon
past
predicted
time
1-4
Overview of MPC
prediction horizon at time prediction horizon at time
time
time
1-5
Overview of MPC
Optimization repeated online at sampling instants
1-6
Overview of MPC
Control strategy reinvented several times optimal control industrial process control constrained/nonlinear control
Development of commercial MPC algorithms: [from Qin & Badgwell 2003]
Computational optimal control Lee & Markus, 1963 Bitmead, Gevers & Wertz 1990
1-7
Books
J.M. Maciejowski Predictive Control with Constraints Prentice Hall, 2002 Chapters 1, 2, 3, 6, 8, 10
J.B. Rawlings and D.Q. Mayne Model Predictive Control: Theory and Design Nob Hill Publishing, 2009
1-8
Example
Linear plant model
Quadratic cost
1-9
Example
sample
1 - 10
Example
sample
1 - 11
Example
sample
1 - 12
Motivation
Advantages: Flexible plant model e.g. multivariable linear or nonlinear deterministic, stochastic or fuzzy Input and state constraints accommodated e.g. actuator limitations safety, environmental and economic constraints Approximately optimal closed-loop performance (dependent on horizon, cost and d.o.f.) Disadvantages: Requires online optimization nonlinear/uncertain plants computationally expensive
1 - 13
1 - 14
1 - 15
1 - 16
1 - 17
1 - 18
Econometric Model
predicted outputs
Simplified Model
predicted outputs
Optimizer MPC
1 - 19
Prediction model
Linear plant model predictions depend linearly on
online optimization:
1 - 20
Prediction model
Nonlinear plant model nonlinear dependence of predictions on
nonconvex in general
1 - 21
Prediction model
Discrete-time prediction model Predictions optimized periodically at typically integer multiple of model sample interval
predicted at predicted at
if then
for
integer is possible
( allows for guaranteed stability)
1 - 22
Prediction model
Continuous-time prediction model 1st-order hold ( piecewise linear in ):
predicted at
Continuous-time prediction model can be integrated online (e.g. using Runge-Kutta) useful if no discrete-time model available This course: discrete-time model with
1 - 23
Constraints
Constraints are present in every control problem Input constraints: (absolute) (rate) typically active during transients e.g. valve saturation, d.c. motor saturation State constraints: (linear) can be active during transients e.g. aircraft stall speed or active in steady state e.g. process industry economic constraints
1 - 24
Constraints
Classify constraints as either hard or soft: Hard constraints must be satisfied at all times otherwise the problem is infeasible
Soft constraints can be violated to avoid infeasibility strategies for handling soft constraints: remove least critical constraint until optimization is feasible impose hard constraints on the probability of violating each soft constraint This course: only hard constraints considered
1 - 25
Constraint handling
Suboptimal methods for handling input constraints: Saturate unconstrained control law (constraints usually ignored in controller design) De-tune unconstrained control law increase penalty on in optimal control performance objective
Anti-windup strategies limit state of dynamic controller e.g. integral term of PI or PID
1 - 26
Constraint handling
Effects of input saturation unconstrained control law: saturated control law: Example: as before :
input saturation
1 - 27
Constraint handling
De-tuning of optimal control law: optimal f/b gain for LQ cost Increase until satisfies constraints throughout operating region
Example:
as before
1 - 28
Constraint handling
Anti-windup: avoids instability in controller when constraints are active
or so
changes sign
1 - 29
Constraint handling
Anti-windup is based on past behaviour of plant alone Need to anticipate future constraint violation MPC optimizes future performance
as before
stability guaranteed
1 - 30
Summary
Predict performance using plant model linear or nonlinear, discrete or continuous time Optimize future inputs computationally easier than optimizing closed-loop Implement first sample, then repeat optimization provides feedback to reduce effect of uncertainty Handling system constraints: Saturation, anti-windup, de-tuning MPC