Course on Model Predictive Control Part II Linear MPC design
|
|
- Hugo Shields
- 5 years ago
- Views:
Transcription
1 Course on Model Predictive Control Part II Linear MPC design Gabriele Pannocchia Department of Chemical Engineering, University of Pisa, Italy Facoltà di Ingegneria, Pisa. July 16th, 2012, Aula Pacinotti G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 1 / 47
2 Outline 1 Estimator module design for offset-free tracking 2 Steady-state optimization module design 3 Dynamic optimization module design 4 Closed-loop implementation and receding horizon principle 5 Quick overview of numerical optimization G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 2 / 47
3 Estimator module Tuning parameters Dynamic Optimization u(k) ˆx (k + 1) ˆ d (k + 1) Process y(k) ˆx(k), ˆ d(k) z 1 x s (k), u s (k) Steady-state Optimization ˆ d(k) Estimator Tuning parameters MPC G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 3 / 47
4 Estimator preliminaries Basic model, inputs and outputs Basic model: x + = Ax + Bu + w y = C x + v Inputs k: measured output y(k) and predicted state ˆx (k) Outputs k: updated state estimate ˆx(k) State estimator for basic model Choose any L such that (A ALC ) is strictly Hurwitz Filtering: ˆx(k) = ˆx (k) + L(y(k) C ˆx (k)) Key observation The estimator is the only feedback module in an MPC. Any discrepancy between true plant and model should be corrected there G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 4 / 47
5 Augmented system: definition Issue and solution approach An MPC based on the previous estimator does not compensate for plant/model mismatch and persistent disturbances As in [Davison and Smith, 1971, Kwakernaak and Sivan, 1972, Smith and Davison, 1972, Francis and Wonham, 1976], one should model and estimate the disturbance to be rejected For offset-free control, an integrating disturbance is added Augmented system [Muske and Badgwell, 2002, Pannocchia and Rawlings, 2003], with d R n d [ ] + [ x A Bd = d 0 I y = [ C ][ x d C d ] [ x d ] + ] + v [ ] [ ] B w u + 0 w d G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 5 / 47
6 Augmented system: observability Observability of the augmented system Assume that (A,C ) is observable ([ ] A Bd Question: is, [ ] ) C C 0 I d observable? Answer: yes, if and only if (from the Hautus test) [ ] A I Bd rank = n + n C d Observation: the previous can be satisfied if and only if C d n d p G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 6 / 47
7 Augmented system: controllability Controllability of the augmented system Assume that (A,B) is controllable ([ ] [ ]) A Bd B Question: is, controllable? 0 I 0 Answer: No Observation: the disturbance is not going to be controlled. Its effect is taken into account in Steady-State Optimization and Dynamic Optimization modules G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 7 / 47
8 Augmented estimator General design Set n d = p (see [Pannocchia and Rawlings, 2003, Maeder et al., 2009] for issues on choosing n d < p) Choose (B d,c d ) such that the augmented system is observable [ ] Lx Choose L = such that L d ([ A Bd 0 I ] [ A Bd 0 I ][ Lx L d ] [C Cd ] ) is strictly Hurwitz Augmented estimator: [ ] [ ˆx(k) ˆx ] (k) d(k) ˆ = dˆ + (k) [ Lx L d ]( y(k) [ C ] [ ˆx ]) (k) C d dˆ (k) G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 8 / 47
9 The typical industrial design Typical industrial design for stable systems (A strictly Hurwitz) Output disturbance model B d = 0, C d = I, L x = 0, L d = I Any error y(k) C ˆx (k) is assumed to be caused by a step (constant) disturbance acting on the output. In fact, the filtered disturbance estimate is: d(k) ˆ = d ˆ (k) + (y(k) C ˆx (k) d ˆ (k)) = y(k) C ˆx (k) It is a deadbeat Kalman filter Q = 0, Q d = I, R 0 It is simple and does the job [Rawlings et al., 1994] G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 9 / 47
10 Comments on the industrial design Rotation factor for integrating systems (rotated and translated) (rotated) yk (uncorrected) }α ˆxk k 1 k k + 1 k + 2 k + 3 k 1 k + 4 (current time) Limitations of the output disturbance model The overall performance is often sluggish [Lundström et al., 1995, Muske and Badgwell, 2002, Pannocchia and Rawlings, 2003, Pannocchia, 2003] A suitable estimator design can improve the closed-loop performance [Pannocchia, 2003, Pannocchia and Bemporad, 2007, Rajamani et al., 2009] Often, a deadbeat input disturbance model works better B d = B, C d = 0, Q = 0, Q d = I, R 0 G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 10 / 47
11 Steady-state optimization module Tuning parameters Dynamic Optimization u(k) ˆx (k + 1) ˆ d (k + 1) Process y(k) ˆx(k), ˆ d(k) z 1 x s (k), u s (k) Steady-state Optimization ˆ d(k) Estimator Tuning parameters MPC G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 11 / 47
12 Steady-state optimization module: introduction A trivial case Square system (m = p) without constraints and with setpoints on all CVs Solve the linear system x s = Ax s + Bu s + B d ˆ d r s = C x s +C d ˆ d Obtain [ xs u s ] = [ ] 1 [ I A B C 0 ] B d d ˆ r sp C d d ˆ Observation The steady-state target (x s, u s ) may change at each decision time because of the disturbance estimate d ˆ G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 12 / 47
13 Objectives of the steady-state optimization module Boundary conditions In most cases the number of CVs is different from the number of MVs: p m CVs and MVs have constraints to meet y min y(k) y max, u min u(k) u max Only a small subset of CVs have fixed setpoints: H y(k) r sp Objectives Given the current disturbance estimate, ˆ d Compute the equilibrium (x s,u s, y s ): x s = Ax s + Bu s + B d d, ˆ ys = C x s +C d d ˆ such that: constraints on MVs and CVs are satisfied: y min y s y max, u min u s u max the subset of CVs tracks the setpoint: H y s = r s G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 13 / 47
14 Examples of steady-state optimization feasible regions Stable system with 2 MVs and 2 CVs (with bounds) y s = C (I A) 1 Bu s + (C (I A) 1 B d +C d ) d ˆ = Gu s +G d d ˆ y (1) max u (2) max y (2) max u (2) s y (2) min u (2) min y (1) min u (1) min u (1) s u (1) max G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 14 / 47
15 Examples of steady-state optimization feasible regions Stable system with 2 MVs and 2 CVs (one setpoint) y s = C (I A) 1 Bu s + (C (I A) 1 B d +C d ) d ˆ = Gu s +G d d ˆ y (1) max u (2) max u (2) s y (2) min = y (2) max u (2) min y (1) min u (1) min u (1) s u (1) max G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 15 / 47
16 Examples of steady-state optimization feasible regions Stable system with 2 MVs and 2 CVs (two setpoints) y s = C (I A) 1 Bu s + (C (I A) 1 B d +C d ) d ˆ = Gu s +G d d ˆ u (2) max u (2) s u (2) min y (2) min = y (2) max y (1) min = y (1) max u (1) min u (1) s u (1) max G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 16 / 47
17 Examples of steady-state optimization feasible regions Stable system with 2 MVs and 3 CVs (two setpoints) y s = C (I A) 1 Bu s + (C (I A) 1 B d +C d ) d ˆ = Gu s +G d d ˆ y (3) min y (3) max u (2) max u (2) s u (2) min y (2) min = y (2) max y (1) min = y (1) max u (1) min u (1) s u (1) max G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 17 / 47
18 Hard and soft constraints Hard constraints In the two optimization modules, constraints on MVs are regarded as hard, i.e., cannot be violated This choice comes from the possibility of satisfying them exactly Soft constraints In the two optimization modules, constraints on CVs are regarded as soft, i.e., can be violated when necessary The amount of violation is penalized in the objective function This choice comes from the impossibility of satisfying them exactly G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 18 / 47
19 Steady-state optimization module: linear formulation General formulation (LP) min u s,x s,ɛ s,ɛ s q ɛ s + q ɛ s + r u s x s = Ax s + Bu s + B d ˆ d s.t. u min u s u max y min ɛ s C x s +C d ˆ d ymax + ɛ s ɛ s 0 ɛ s 0 Extensions Setpoints on some CVs can be specified with either an equality constraint or by setting identical value for minimum and maximum value Often CVs are grouped by ranks G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 19 / 47
20 LP steady-state optimization module: tuning Cost function r R m is the MV cost vector: a positive (negative) entry in r implies that the corresponding MV should be minimized (maximized) q R p and q R p are the weights of upper and lower bound CV violations. Sometimes they are defined in terms of equal concern error: 1 1 q i =, q =, i = 1,..., p i SSECE U i Constraints SSECE L i Bounds u max, u min, y max, y min can be modified by the operators (within ranges defined by the MPC designer) Sometimes in order to avoid large target changes from time k 1 to time k a rate constraint is added u max u s (k) u s (k 1) u max G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 20 / 47
21 LP steady-state optimization module: numerical solution Standard LP form with z = [ xs u s ɛ s ɛ s ], E = 0 I I 0 0 C 0 I 0 C 0 0 I 0 0 I I min z c z s.t. E z e, F z = f u max u min y, e = max C d d ˆ (y min C d d) ˆ, F = [ I A B 0 0], f = B d d ˆ 0 0 Solution algorithms [Nocedal and Wright, 2006] Solution methods based on simplex or interior point algorithms G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 21 / 47
22 Steady-state optimization module: quadratic formulation QP formulation The LP formulation is quite intuitive but its outcome may be too jumpy Sometimes a QP formulation may be preferred min u s,x s,ɛ s,ɛ s ɛ s 2 Q s + ɛ s 2 Q s + u s u sp 2 R s x s = Ax s + Bu s + B d ˆ d s.t. u min u s u max y min ɛ s C x s +C d ˆ d ymax + ɛ s where u sp is the desired MV setpoint and x 2 Q = x Qx Tuning is slightly more complicated, but the outcome is usually smoother G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 22 / 47
23 Dynamic optimization module Tuning parameters Dynamic Optimization u(k) ˆx (k + 1) ˆ d (k + 1) Process y(k) ˆx(k), ˆ d(k) z 1 x s (k), u s (k) Steady-state Optimization ˆ d(k) Estimator Tuning parameters MPC G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 23 / 47
24 Dynamic optimization module: introduction Agenda Make a finite-horizon prediction of future CVs evolution based on a sequence of MVs Find the optimal MVs sequence, minimizing a cost function that comprises: deviation of CVs (and MVs) from their targets rate of change of MVs respecting constraints on: MVs (always) CVs (possibly) G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 24 / 47
25 Dynamic optimization module: graphical interpretation y Prediction horizon u Control horizon Past Future G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 25 / 47
26 Dynamic optimization module: formulation Cost function: Q, either R or S, Q, Q, P positive definite matrices V N ( ˆx, u,ɛ,ɛ) = N 1 j =0 [ ŷ(j ) y s 2 Q + u(j ) u s 2 R + u(j ) u(j 1) 2 S + ɛ(j ) 2 Q + ɛ(j ) 2 Q x + = Ax + Bu + B d ˆ d ŷ = C x +C d ˆ d ] + x(n ) x s 2 P s.t. x(0) = ˆx ys = C x s +C d ˆ d Control problem minv N ( ˆx, u,ɛ,ɛ) u,ɛ,ɛ s.t. u min u(j ) u max u max u(j ) u(j 1) u max y min ɛ(j ) ŷ(j ) y max + ɛ(j ) G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 26 / 47
27 Dynamic optimization module: formulation Main tuning parameters Q: diagonal matrix of weights for CVs deviation from target: q i i = ( 1 DEC E M i ) 2 R: diagonal matrix of weights for MVs deviation from target S: diagonal matrix of weights for MVs rate of change, often called move suppression factors Q, Q: diagonal matrices of weights for CVs violation of constraints ( ) 2 ( ) 2 1 q i i = DEC E U, q = 1 i i DEC E L i i u max, u min, y max, y min, u max : constraint vectors N : prediction horizon G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 27 / 47
28 Dynamic optimization module: rewriting Deviation variables Use the target (x s,u s ): x(j ) = x(j ) x s, ũ(j ) = u(j ) u s, Recall that: x s = Ax s + Bu s + B d ˆ d, ys = C x s +C d ˆ d Cost function becomes: V N ( ˆx, ũ,ɛ,ɛ) = N 1 j =0 [ x(j ) 2 C QC + ũ(j ) 2 R + ũ(j ) ũ(j 1) 2 S + ɛ(j ) 2 Q + ɛ(j ) 2 Q ] + x(n ) 2 P s.t. x + = A x + Bũ x(0) = ˆx x s G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 28 / 47
29 Dynamic optimization module: constrained LQR Compact problem formulation minv N ( ˆx, ũ,ɛ,ɛ) ũ,ɛ,ɛ s.t. u min u s ũ(j ) u max u s u max ũ(j ) ũ(j 1) u max y min y s ɛ(j ) C x(j ) y max y s + ɛ(j ) Constrained LQR formulation With suitable definitions (shown next), we obtain a constrained LQR formulation: min u a V N (x a, u a ) = N 1 j =0 [ ] x a (j ) 2 Q a + u a (j ) 2 R a + 2x a (j )M a u a (j ) + x a (N ) 2 P a s.t. x + a = A a x a + B a u a, D a u a + E a x a e a G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 29 / 47
30 Dynamic optimization module: constrained LQR (cont. d) Augmented state and input [ ] [ ũ(j ) ] x(j ) x a (j ) = ũ(j 1), u a (j ) = ɛ(j ) ɛ(j ) The state is augmented to write terms u(j ) u(j 1) (in the objective function and/or in the constraints) The input is augmented to write the soft output constraints Matrices and vectors A a = [ ] A B a = [ ] B 0 0 I 0 0 D a = I 0 0 I 0 0 I 0 0 I I I [ ] Q a = C QC 0 0 S E a = I 0 I C 0 C 0 R a = [ R+S Q Q e a = ] u max u s u s u min u max u max y max y s y s y min M a = [ ] S 0 0 G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 30 / 47
31 Dynamic optimization module: QP solution From constrained LQR to a QP problem x a = x a (0) x a (1) x a (2).. x a () Q a = A a = Q a Qa D a = I A a A 2 a.. A N a... Qa D a Da 0 0. B..... a B a =. A a B a B.. a = x a = A a x a (0) + B a u a R a = P a... Da A N 1 a B a A a B a B a R a Ra E a =. M.. a = Ra. E.. a. e a =.. Ea 0 E a 0 M a Ma... Ma 0 0 e a e ạ.. e a G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 31 / 47
32 Dynamic optimization module: QP solution (cont. d) QP problem where 1 min u a 2 u a H au a + u a q a s.t. F a u a e a G a x a (0) H a = B a Q ab a + R a + B a M a + M a B a q a = (B a Q a + M a )A a x a (0) F a = D a + E a B a G a = E a A a Observations Both the linear penalty and constraint RHS vary linearly with the current augmented state x a (0), while all other terms are fixed QP solvers are based on Active-Set Methods or Interior Point Methods G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 32 / 47
33 Feedback controllers synthesis from open-loop controllers: the receding horizon principle A quote from [Lee and Markus, 1967] One technique for obtaining a feedback controller synthesis from knowledge of open-loop controllers is to measure the current control process state and then compute very rapidly for the open-loop control function. The first portion of this function is then used during a short time interval, after which a new measurement of the process state is made and a new open-loop control function is computed for this new measurement. The procedure is then repeated. G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 33 / 47
34 Optimal control sequence and closed-loop implementation The optimal control sequence The optimal control sequence u 0 a is in the form u 0 a = ũ0 (0),ũ 0 (1),...,ũ 0 (N 1),ɛ(0),ɛ(1),...,ɛ(N 1),ɛ(0),ɛ(1),...,ɛ(N 1) }{{}}{{}}{{} ũ 0 ɛ ɛ The variables ɛ and ɛ are present only when soft output constraints are used Closed-loop implementation Only the first element of the optimal control sequence is injected into the plant: u(k) = ũ 0 (0) + u s (k) The successor state is predicted using the estimator model ˆx (k + 1) = A ˆx(k) + Bu(k) + B d ˆ d(k) dˆ (k + 1) = d(k) ˆ G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 34 / 47
35 Linear MPC: summary Overall algorithm 1 Given predicted state and disturbance ( ˆx (k), d ˆ (k)) and output measurement y(k), compute filtered estimate: ˆx(k) = ˆx ( (k) + L x y(k) C ˆx (k) C d d ˆ (k) ), d(k) ˆ = d ( (k) + L d y(k) C ˆx (k) C d d ˆ (k) ) 2 Solve Steady-State Optimization problem and compute targets (x s (k),u s (k)) 3 Define deviation variables: x(0) = ˆx(k) u s (k), ũ( 1) = u(k 1) u s (k), and initial regulator state x a (0) = Solve Dynamic Optimization problem to obtain ũ 0 [ ] x(0) ũ( 1). 4 Inject control action u(k) = ũ 0 (0) + u s (k). Predict successor state ˆx (k + 1) = A ˆx(k) + Bu(k) + B d d(k) ˆ and disturbance dˆ (k + 1) = d(k). ˆ Set k k + 1 and go to 1 G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 35 / 47
36 General formulation of an optimization problem The three ingredients x R n, vector of variables f : R n R, objective function c : R n R m, vector function of constraints that the variables must satisfy. m is the number of restrictions applied The optimization problem min f (x) x R n { ci (x) = 0 i E subject to c i (x) 0 i I E, I : sets of indices of equality and inequality constraints, respectively G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 36 / 47
37 Constrained optimization: example 1 Solve min x 1 + x 2 s. t. x x2 2 2 = 0 Standard notation, feasibility region and solution x2 In standard notation: f (x) = x 1 + x 2, I =, E = {1}, c 1 (x) = x x2 2 2 Feasibility region: circle of radius 2, only the border Solution: x = [ 1, 1] T f (x) x1 Observation f (x ) = [ ] [ ] 1, c 1 1 (x 2 ) = = f (x ) = c 1(x ) G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 37 / 47
38 Constrained optimization: example 2 Solve min x 1 + x 2 s. t. 2 x 2 1 x2 2 0 Standard notation, feasibility region and solution x2 In standard notation: f (x) = x 1 + x 2, I = {1}, E =, c 1 (x) = 2 (x x2 2 ) Feasibility region: circle of radius 2, including the interior Solution: x = [ 1, 1] T f (x) x1 Observation f (x ) = [ ] [ ] 1, c 1 1 (x 2 ) = = f (x ) = c 1(x ) G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 38 / 47
39 Constrained optimality conditions (KKT) Lagrangian function L (x,λ) = f (x) λ i c i (x) i E I Karush-Kuhn-Tucker optimality conditions If x is a local solution to the standard problem, there exists a vector λ R m such that the following conditions hold: x L (x,λ ) = 0 c i (x ) = 0 c i (x ) 0 λ i 0 λ i c i (x ) = 0 for all i E for all i I for all i I for all i E I The components of λ are called Lagrange multipliers Notice that a multiplier is zero when the corresponding constraint is inactive G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 39 / 47
40 Linear programs (LP) problems LP in standard form min x c T x subject to Ax = b, x 0 where: c R n, x R n, A R m n, b R m and rank(a) = m Optimality conditions Lagrangian function: L (x,π, s) = c T x π T (Ax b) s T x If x is solution of the linear program, then: A T π + s = c Ax = b x 0 s 0 x i s i = 0, i = 1,2,...n G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 40 / 47
41 LP: the simplex method The base points A point x R n is a base point if Ax = b and x 0 At most m components of x are nonzero The columns of A corresponding to the nonzero elements are linearly independent Fundamental aspects of the simplex method Base points are vertices of the feasibility region The solution is a base point The simplex method iterates from a base point x k to another one x k+1, and stops when all components of s k are nonnegative When a component of s k is negative, a new base point x k+1 in which the corresponding element of x k is nonzero is selected G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 41 / 47
42 Quadratic Programming (QP) Standard form subject to: 1 min x 2 xt Gx + x T d a T i x = b i, a T i x b i, i E i I where G R n n is symmetric (positive definite), d R n, b R n, and a i R n, for all i E I The active set A (x ) = { i E I : a T i x = b i } G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 42 / 47
43 Quadratic Programming (QP) problems (2/2) Lagrangian function L (x,λ) = 1 2 xt Gx + x T λ i (a T i x b i ) Optimality conditions (KKT) Gx + d λ i a i = 0 i A (x ) i E I a T i x = b i, for all i A (x ) a T i x > b i, for all i I \ A (x ) λ i 0, for all i I A (x ) G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 43 / 47
44 Active set methods for convex QP problems Fundamental steps 1 Given a feasible x k, we evaluate its active set and build the matrix A whose row are {a T i }, i A (x k) 2 Solve the KKT linear system [ ][ G A T pk A 0 λ k ] = [ ] d +Gxk Ax k b 3 If p k ρ, check if λ i 0 for all i A (x k ). If so, stop. 4 If a multiplier λ i < 0 for some i A (x k ), remove the i th constraint from the active set. 5 If p k > ρ, define x k+1 = x k + α k p k, where α k is the largest scalar in (0,1] such that no inequality constraint is violated. When a blocking constraint is found, it is included in the new active set A (x k+1 ) G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 44 / 47
45 Nonlinear programming (NLP) problems via SQP algorithms Nonlinear programming (NLP) problems min x f (x) s.t. c i (x) = 0 c i (x) 0 i E i I Sequential Quadratic Programming (SQP) approach 1 min p k 2 pt k W k p k + f (x k ) T p k s.t. c i (x k ) T p k + c i (x k ) = 0 c i (x k ) T p k + c i (x k ) 0 i E i I G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 45 / 47
46 References I E. J. Davison and H. W. Smith. Pole assignment in linear time-invariant multivariable systems with constant disturbances. Automatica, 7: , B. A. Francis and W. M. Wonham. The internal model principle of control theory. Automatica, 12: , H. Kwakernaak and R. Sivan. Linear Optimal Control Systems. John Wiley & Sons, E. B. Lee and L. Markus. Foundations of Optimal Control Theory. John Wiley & Sons, New York, P. Lundström, J. H. Lee, M. Morari, and S. Skogestad. Limitations of dynamic matrix control. Comp. Chem. Eng., 19: , U. Maeder, F. Borrelli, and M. Morari. Linear offset-free model predictive control. Automatica, 45(10): , K. R. Muske and T. A. Badgwell. Disturbance modeling for offset-free linear model predictive control. J. Proc. Contr., 12: , J. Nocedal and S. J. Wright. Numerical Optimization. Springer, second edition, G. Pannocchia. Robust disturbance modeling for model predictive control with application to multivariable ill-conditioned processes. J. Proc. Cont., 13: , G. Pannocchia and A. Bemporad. Combined design of disturbance model and observer for offset-free model predictive control. IEEE Trans. Auto. Contr., 52(6): , G. Pannocchia and J. B. Rawlings. Disturbance models for offset-free model predictive control. AIChE J., 49: , G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 46 / 47
47 References II M. R. Rajamani, J. B. Rawlings, and S. J. Qin. Achieving state estimation equivalence for misassigned disturbances in offset-free model predictive control. AIChE J., 55(2): , J. B. Rawlings, E. S. Meadows, and K. R. Muske. Nonlinear model predictive control: a tutorial and survey. In ADCHEM Conference, pages , Kyoto, Japan, H. W. Smith and E. J. Davison. Design of industrial regulators. Integral feedback and feedforward control. Proc. IEE, 119(8): , G. Pannocchia Course on Model Predictive Control. Part II Linear MPC theory 47 / 47
Course on Model Predictive Control Part III Stability and robustness
Course on Model Predictive Control Part III Stability and robustness Gabriele Pannocchia Department of Chemical Engineering, University of Pisa, Italy Email: g.pannocchia@diccism.unipi.it Facoltà di Ingegneria,
More informationA FAST, EASILY TUNED, SISO, MODEL PREDICTIVE CONTROLLER. Gabriele Pannocchia,1 Nabil Laachi James B. Rawlings
A FAST, EASILY TUNED, SISO, MODEL PREDICTIVE CONTROLLER Gabriele Pannocchia, Nabil Laachi James B. Rawlings Department of Chemical Engineering Univ. of Pisa Via Diotisalvi 2, 5626 Pisa (Italy) Department
More informationOn the Inherent Robustness of Suboptimal Model Predictive Control
On the Inherent Robustness of Suboptimal Model Predictive Control James B. Rawlings, Gabriele Pannocchia, Stephen J. Wright, and Cuyler N. Bates Department of Chemical & Biological Engineering Computer
More informationOn the Inherent Robustness of Suboptimal Model Predictive Control
On the Inherent Robustness of Suboptimal Model Predictive Control James B. Rawlings, Gabriele Pannocchia, Stephen J. Wright, and Cuyler N. Bates Department of Chemical and Biological Engineering and Computer
More informationA tutorial overview on theory and design of offset-free MPC algorithms
A tutorial overview on theory and design of offset-free MPC algorithms Gabriele Pannocchia Dept. of Civil and Industrial Engineering University of Pisa November 24, 2015 Introduction to offset-free MPC
More informationNonlinear Model Predictive Control Tools (NMPC Tools)
Nonlinear Model Predictive Control Tools (NMPC Tools) Rishi Amrit, James B. Rawlings April 5, 2008 1 Formulation We consider a control system composed of three parts([2]). Estimator Target calculator Regulator
More informationA Candidate to Replace PID Control: SISO-Constrained LQ Control
A Candidate to Replace PID Control: SISO-Constrained LQ Control Gabriele Pannocchia Dept. of Chemical Engineering, University of Pisa, 5626 Pisa, Italy Nabil Laachi and James B. Rawlings Dept. of Chemical
More informationPostface to Model Predictive Control: Theory and Design
Postface to Model Predictive Control: Theory and Design J. B. Rawlings and D. Q. Mayne August 19, 2012 The goal of this postface is to point out and comment upon recent MPC papers and issues pertaining
More informationRobustness of MPC and Disturbance Models for Multivariable Ill-conditioned Processes
2 TWMCC Texas-Wisconsin Modeling and Control Consortium 1 Technical report number 21-2 Robustness of MPC and Disturbance Models for Multivariable Ill-conditioned Processes Gabriele Pannocchia and James
More informationOptimization Problems with Constraints - introduction to theory, numerical Methods and applications
Optimization Problems with Constraints - introduction to theory, numerical Methods and applications Dr. Abebe Geletu Ilmenau University of Technology Department of Simulation and Optimal Processes (SOP)
More informationTheory in Model Predictive Control :" Constraint Satisfaction and Stability!
Theory in Model Predictive Control :" Constraint Satisfaction and Stability Colin Jones, Melanie Zeilinger Automatic Control Laboratory, EPFL Example: Cessna Citation Aircraft Linearized continuous-time
More informationIMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS
IMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS D. Limon, J.M. Gomes da Silva Jr., T. Alamo and E.F. Camacho Dpto. de Ingenieria de Sistemas y Automática. Universidad de Sevilla Camino de los Descubrimientos
More informationOptimizing Control of Hot Blast Stoves in Staggered Parallel Operation
Proceedings of the 17th World Congress The International Federation of Automatic Control Optimizing Control of Hot Blast Stoves in Staggered Parallel Operation Akın Şahin and Manfred Morari Automatic Control
More informationQuis custodiet ipsos custodes?
Quis custodiet ipsos custodes? James B. Rawlings, Megan Zagrobelny, Luo Ji Dept. of Chemical and Biological Engineering, Univ. of Wisconsin-Madison, WI, USA IFAC Conference on Nonlinear Model Predictive
More informationMATH4406 (Control Theory) Unit 6: The Linear Quadratic Regulator (LQR) and Model Predictive Control (MPC) Prepared by Yoni Nazarathy, Artem
MATH4406 (Control Theory) Unit 6: The Linear Quadratic Regulator (LQR) and Model Predictive Control (MPC) Prepared by Yoni Nazarathy, Artem Pulemotov, September 12, 2012 Unit Outline Goal 1: Outline linear
More informationMPC Infeasibility Handling
MPC Handling Thomas Wiese, TU Munich, KU Leuven supervised by H.J. Ferreau, Prof. M. Diehl (both KUL) and Dr. H. Gräb (TUM) October 9, 2008 1 / 42 MPC General MPC Strategies 2 / 42 Linear Discrete-Time
More informationIntroduction to Model Predictive Control. Dipartimento di Elettronica e Informazione
Introduction to Model Predictive Control Riccardo Scattolini Riccardo Scattolini Dipartimento di Elettronica e Informazione Finite horizon optimal control 2 Consider the system At time k we want to compute
More informationOnline monitoring of MPC disturbance models using closed-loop data
Online monitoring of MPC disturbance models using closed-loop data Brian J. Odelson and James B. Rawlings Department of Chemical Engineering University of Wisconsin-Madison Online Optimization Based Identification
More informationAlgorithms for constrained local optimization
Algorithms for constrained local optimization Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Algorithms for constrained local optimization p. Feasible direction methods Algorithms for constrained
More informationSF2822 Applied Nonlinear Optimization. Preparatory question. Lecture 9: Sequential quadratic programming. Anders Forsgren
SF2822 Applied Nonlinear Optimization Lecture 9: Sequential quadratic programming Anders Forsgren SF2822 Applied Nonlinear Optimization, KTH / 24 Lecture 9, 207/208 Preparatory question. Try to solve theory
More information5 Handling Constraints
5 Handling Constraints Engineering design optimization problems are very rarely unconstrained. Moreover, the constraints that appear in these problems are typically nonlinear. This motivates our interest
More informationOptimizing Economic Performance using Model Predictive Control
Optimizing Economic Performance using Model Predictive Control James B. Rawlings Department of Chemical and Biological Engineering Second Workshop on Computational Issues in Nonlinear Control Monterey,
More informationOptimality, Duality, Complementarity for Constrained Optimization
Optimality, Duality, Complementarity for Constrained Optimization Stephen Wright University of Wisconsin-Madison May 2014 Wright (UW-Madison) Optimality, Duality, Complementarity May 2014 1 / 41 Linear
More information5.6 Penalty method and augmented Lagrangian method
5.6 Penalty method and augmented Lagrangian method Consider a generic NLP problem min f (x) s.t. c i (x) 0 i I c i (x) = 0 i E (1) x R n where f and the c i s are of class C 1 or C 2, and I and E are the
More information2.3 Linear Programming
2.3 Linear Programming Linear Programming (LP) is the term used to define a wide range of optimization problems in which the objective function is linear in the unknown variables and the constraints are
More informationGiulio Betti, Marcello Farina and Riccardo Scattolini
1 Dipartimento di Elettronica e Informazione, Politecnico di Milano Rapporto Tecnico 2012.29 An MPC algorithm for offset-free tracking of constant reference signals Giulio Betti, Marcello Farina and Riccardo
More informationDistributed and Real-time Predictive Control
Distributed and Real-time Predictive Control Melanie Zeilinger Christian Conte (ETH) Alexander Domahidi (ETH) Ye Pu (EPFL) Colin Jones (EPFL) Challenges in modern control systems Power system: - Frequency
More informationOverview of Models for Automated Process Control
Overview of Models for Automated Process Control James B. Rawlings Department of Chemical and Biological Engineering April 29, 29 Utilization of Process Modeling and Advanced Process Control in QbD based
More informationISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints
ISM206 Lecture Optimization of Nonlinear Objective with Linear Constraints Instructor: Prof. Kevin Ross Scribe: Nitish John October 18, 2011 1 The Basic Goal The main idea is to transform a given constrained
More informationminimize x subject to (x 2)(x 4) u,
Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for
More informationMPC for tracking periodic reference signals
MPC for tracking periodic reference signals D. Limon T. Alamo D.Muñoz de la Peña M.N. Zeilinger C.N. Jones M. Pereira Departamento de Ingeniería de Sistemas y Automática, Escuela Superior de Ingenieros,
More informationIntroduction to Nonlinear Stochastic Programming
School of Mathematics T H E U N I V E R S I T Y O H F R G E D I N B U Introduction to Nonlinear Stochastic Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio SPS
More informationWritten Examination
Division of Scientific Computing Department of Information Technology Uppsala University Optimization Written Examination 202-2-20 Time: 4:00-9:00 Allowed Tools: Pocket Calculator, one A4 paper with notes
More informationOPTIMAL CONTROL WITH DISTURBANCE ESTIMATION
OPTIMAL CONTROL WITH DISTURBANCE ESTIMATION František Dušek, Daniel Honc, Rahul Sharma K. Department of Process control Faculty of Electrical Engineering and Informatics, University of Pardubice, Czech
More informationSolution Methods. Richard Lusby. Department of Management Engineering Technical University of Denmark
Solution Methods Richard Lusby Department of Management Engineering Technical University of Denmark Lecture Overview (jg Unconstrained Several Variables Quadratic Programming Separable Programming SUMT
More informationAlgorithms for nonlinear programming problems II
Algorithms for nonlinear programming problems II Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics Computational Aspects
More informationLearning Model Predictive Control for Iterative Tasks: A Computationally Efficient Approach for Linear System
Learning Model Predictive Control for Iterative Tasks: A Computationally Efficient Approach for Linear System Ugo Rosolia Francesco Borrelli University of California at Berkeley, Berkeley, CA 94701, USA
More information8 Barrier Methods for Constrained Optimization
IOE 519: NL, Winter 2012 c Marina A. Epelman 55 8 Barrier Methods for Constrained Optimization In this subsection, we will restrict our attention to instances of constrained problem () that have inequality
More informationLinear Offset-Free Model Predictive Control
Linear Offset-Free Model Predictive Control Urban Maeder a,, Francesco Borrelli b, Manfred Morari a a Automatic Control Lab, ETH Zurich, CH-892 Zurich, Switzerland b Department of Mechanical Engineering,
More information1 Computing with constraints
Notes for 2017-04-26 1 Computing with constraints Recall that our basic problem is minimize φ(x) s.t. x Ω where the feasible set Ω is defined by equality and inequality conditions Ω = {x R n : c i (x)
More informationarxiv: v1 [cs.sy] 28 May 2013
From Parametric Model-based Optimization to robust PID Gain Scheduling Minh H.. Nguyen a,, K.K. an a a National University of Singapore, Department of Electrical and Computer Engineering, 3 Engineering
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationAn Introduction to Model-based Predictive Control (MPC) by
ECE 680 Fall 2017 An Introduction to Model-based Predictive Control (MPC) by Stanislaw H Żak 1 Introduction The model-based predictive control (MPC) methodology is also referred to as the moving horizon
More informationConstrained Optimization
1 / 22 Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University March 30, 2015 2 / 22 1. Equality constraints only 1.1 Reduced gradient 1.2 Lagrange
More informationLectures 9 and 10: Constrained optimization problems and their optimality conditions
Lectures 9 and 10: Constrained optimization problems and their optimality conditions Coralia Cartis, Mathematical Institute, University of Oxford C6.2/B2: Continuous Optimization Lectures 9 and 10: Constrained
More informationPenalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques
More informationOffset Free Model Predictive Control
Proceedings of the 46th IEEE Conference on Decision and Control New Orleans, LA, USA, Dec. 12-14, 27 Offset Free Model Predictive Control Francesco Borrelli, Manfred Morari. Abstract This work addresses
More information4F3 - Predictive Control
4F3 Predictive Control - Lecture 2 p 1/23 4F3 - Predictive Control Lecture 2 - Unconstrained Predictive Control Jan Maciejowski jmm@engcamacuk 4F3 Predictive Control - Lecture 2 p 2/23 References Predictive
More informationLecture 18: Optimization Programming
Fall, 2016 Outline Unconstrained Optimization 1 Unconstrained Optimization 2 Equality-constrained Optimization Inequality-constrained Optimization Mixture-constrained Optimization 3 Quadratic Programming
More informationA Trust-region-based Sequential Quadratic Programming Algorithm
Downloaded from orbit.dtu.dk on: Oct 19, 2018 A Trust-region-based Sequential Quadratic Programming Algorithm Henriksen, Lars Christian; Poulsen, Niels Kjølstad Publication date: 2010 Document Version
More informationNumerical Methods for Model Predictive Control. Jing Yang
Numerical Methods for Model Predictive Control Jing Yang Kongens Lyngby February 26, 2008 Technical University of Denmark Informatics and Mathematical Modelling Building 321, DK-2800 Kongens Lyngby, Denmark
More informationModel Predictive Controller of Boost Converter with RLE Load
Model Predictive Controller of Boost Converter with RLE Load N. Murali K.V.Shriram S.Muthukumar Nizwa College of Vellore Institute of Nizwa College of Technology Technology University Technology Ministry
More informationConstrained Linear Quadratic Optimal Control
5 Constrained Linear Quadratic Optimal Control 51 Overview Up to this point we have considered rather general nonlinear receding horizon optimal control problems Whilst we have been able to establish some
More informationFINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES. Danlei Chu, Tongwen Chen, Horacio J. Marquez
FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES Danlei Chu Tongwen Chen Horacio J Marquez Department of Electrical and Computer Engineering University of Alberta Edmonton
More informationImage restoration: numerical optimisation
Image restoration: numerical optimisation Short and partial presentation Jean-François Giovannelli Groupe Signal Image Laboratoire de l Intégration du Matériau au Système Univ. Bordeaux CNRS BINP / 6 Context
More informationLecture 13: Constrained optimization
2010-12-03 Basic ideas A nonlinearly constrained problem must somehow be converted relaxed into a problem which we can solve (a linear/quadratic or unconstrained problem) We solve a sequence of such problems
More informationNonlinear Stochastic Modeling and State Estimation of Weakly Observable Systems: Application to Industrial Polymerization Processes
Nonlinear Stochastic Modeling and State Estimation of Weakly Observable Systems: Application to Industrial Polymerization Processes Fernando V. Lima, James B. Rawlings and Tyler A. Soderstrom Department
More informationAlgorithms for nonlinear programming problems II
Algorithms for nonlinear programming problems II Martin Branda Charles University Faculty of Mathematics and Physics Department of Probability and Mathematical Statistics Computational Aspects of Optimization
More informationPractical Implementations of Advanced Process Control for Linear Systems
Downloaded from orbitdtudk on: Jul 01, 2018 Practical Implementations of Advanced Process Control for Linear Systems Knudsen, Jørgen K H ; Huusom, Jakob Kjøbsted; Jørgensen, John Bagterp Published in:
More informationAn overview of distributed model predictive control (MPC)
An overview of distributed model predictive control (MPC) James B. Rawlings Department of Chemical and Biological Engineering August 28, 2011 IFAC Workshop: Hierarchical and Distributed Model Predictive
More informationPrimal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization
Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization Roger Behling a, Clovis Gonzaga b and Gabriel Haeser c March 21, 2013 a Department
More informationBarrier Method. Javier Peña Convex Optimization /36-725
Barrier Method Javier Peña Convex Optimization 10-725/36-725 1 Last time: Newton s method For root-finding F (x) = 0 x + = x F (x) 1 F (x) For optimization x f(x) x + = x 2 f(x) 1 f(x) Assume f strongly
More informationNumerical Optimization. Review: Unconstrained Optimization
Numerical Optimization Finding the best feasible solution Edward P. Gatzke Department of Chemical Engineering University of South Carolina Ed Gatzke (USC CHE ) Numerical Optimization ECHE 589, Spring 2011
More informationExamination paper for TMA4180 Optimization I
Department of Mathematical Sciences Examination paper for TMA4180 Optimization I Academic contact during examination: Phone: Examination date: 26th May 2016 Examination time (from to): 09:00 13:00 Permitted
More informationLecture 3. Optimization Problems and Iterative Algorithms
Lecture 3 Optimization Problems and Iterative Algorithms January 13, 2016 This material was jointly developed with Angelia Nedić at UIUC for IE 598ns Outline Special Functions: Linear, Quadratic, Convex
More informationWhat s New in Active-Set Methods for Nonlinear Optimization?
What s New in Active-Set Methods for Nonlinear Optimization? Philip E. Gill Advances in Numerical Computation, Manchester University, July 5, 2011 A Workshop in Honor of Sven Hammarling UCSD Center for
More informationMultidisciplinary System Design Optimization (MSDO)
Multidisciplinary System Design Optimization (MSDO) Numerical Optimization II Lecture 8 Karen Willcox 1 Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox Today s Topics Sequential
More informationLinear Model Predictive Control via Multiparametric Programming
3 1 Linear Model Predictive Control via Multiparametric Programming Vassilis Sakizlis, Konstantinos I. Kouramas, and Efstratios N. Pistikopoulos 1.1 Introduction Linear systems with input, output, or state
More informationPart 4: Active-set methods for linearly constrained optimization. Nick Gould (RAL)
Part 4: Active-set methods for linearly constrained optimization Nick Gould RAL fx subject to Ax b Part C course on continuoue optimization LINEARLY CONSTRAINED MINIMIZATION fx subject to Ax { } b where
More informationOptimal control and estimation
Automatic Control 2 Optimal control and estimation Prof. Alberto Bemporad University of Trento Academic year 2010-2011 Prof. Alberto Bemporad (University of Trento) Automatic Control 2 Academic year 2010-2011
More informationMore on Lagrange multipliers
More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function
More informationAM 205: lecture 19. Last time: Conditions for optimality, Newton s method for optimization Today: survey of optimization methods
AM 205: lecture 19 Last time: Conditions for optimality, Newton s method for optimization Today: survey of optimization methods Quasi-Newton Methods General form of quasi-newton methods: x k+1 = x k α
More informationAM 205: lecture 19. Last time: Conditions for optimality Today: Newton s method for optimization, survey of optimization methods
AM 205: lecture 19 Last time: Conditions for optimality Today: Newton s method for optimization, survey of optimization methods Optimality Conditions: Equality Constrained Case As another example of equality
More informationConstrained Nonlinear Optimization Algorithms
Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu Institute for Mathematics and its Applications University of Minnesota August 4, 2016
More informationThe Partial Enumeration Method for Model Predictive Control: Algorithm and Examples
2 TWMCC Texas-Wisconsin Modeling and Control Consortium 1 Technical report number 2006-01 The Partial Enumeration Method for Model Predictive Control: Algorithm and Examples Gabriele Pannocchia Department
More information4TE3/6TE3. Algorithms for. Continuous Optimization
4TE3/6TE3 Algorithms for Continuous Optimization (Algorithms for Constrained Nonlinear Optimization Problems) Tamás TERLAKY Computing and Software McMaster University Hamilton, November 2005 terlaky@mcmaster.ca
More informationPattern Classification, and Quadratic Problems
Pattern Classification, and Quadratic Problems (Robert M. Freund) March 3, 24 c 24 Massachusetts Institute of Technology. 1 1 Overview Pattern Classification, Linear Classifiers, and Quadratic Optimization
More informationCBE495 LECTURE IV MODEL PREDICTIVE CONTROL
What is Model Predictive Control (MPC)? CBE495 LECTURE IV MODEL PREDICTIVE CONTROL Professor Dae Ryook Yang Fall 2013 Dept. of Chemical and Biological Engineering Korea University * Some parts are from
More informationMODEL PREDICTIVE CONTROL FUNDAMENTALS
Nigerian Journal of Technology (NIJOTECH) Vol 31, No 2, July, 2012, pp 139 148 Copyright 2012 Faculty of Engineering, University of Nigeria ISSN 1115-8443 MODEL PREDICTIVE CONTROL FUNDAMENTALS PE Orukpe
More informationSparse quadratic regulator
213 European Control Conference ECC) July 17-19, 213, Zürich, Switzerland. Sparse quadratic regulator Mihailo R. Jovanović and Fu Lin Abstract We consider a control design problem aimed at balancing quadratic
More informationAlgorithms for Constrained Optimization
1 / 42 Algorithms for Constrained Optimization ME598/494 Lecture Max Yi Ren Department of Mechanical Engineering, Arizona State University April 19, 2015 2 / 42 Outline 1. Convergence 2. Sequential quadratic
More informationOn robustness of suboptimal min-max model predictive control *
Manuscript received June 5, 007; revised Sep., 007 On robustness of suboptimal min-max model predictive control * DE-FENG HE, HAI-BO JI, TAO ZHENG Department of Automation University of Science and Technology
More informationStochastic Tube MPC with State Estimation
Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems MTNS 2010 5 9 July, 2010 Budapest, Hungary Stochastic Tube MPC with State Estimation Mark Cannon, Qifeng Cheng,
More informationALADIN An Algorithm for Distributed Non-Convex Optimization and Control
ALADIN An Algorithm for Distributed Non-Convex Optimization and Control Boris Houska, Yuning Jiang, Janick Frasch, Rien Quirynen, Dimitris Kouzoupis, Moritz Diehl ShanghaiTech University, University of
More informationImproved MPC Design based on Saturating Control Laws
Improved MPC Design based on Saturating Control Laws D.Limon 1, J.M.Gomes da Silva Jr. 2, T.Alamo 1 and E.F.Camacho 1 1. Dpto. de Ingenieria de Sistemas y Automática. Universidad de Sevilla, Camino de
More informationIEOR 265 Lecture 14 (Robust) Linear Tube MPC
IEOR 265 Lecture 14 (Robust) Linear Tube MPC 1 LTI System with Uncertainty Suppose we have an LTI system in discrete time with disturbance: x n+1 = Ax n + Bu n + d n, where d n W for a bounded polytope
More informationLecture 7: Convex Optimizations
Lecture 7: Convex Optimizations Radu Balan, David Levermore March 29, 2018 Convex Sets. Convex Functions A set S R n is called a convex set if for any points x, y S the line segment [x, y] := {tx + (1
More informationIMPLEMENTATIONS OF TRACKING MULTIPARAMETRIC PREDICTIVE CONTROLLER. Pregelj Boštjan, Gerkšič Samo. Jozef Stefan Institute, Ljubljana, Slovenia
IMPLEMENTATIONS OF TRACKING MULTIPARAMETRIC PREDICTIVE CONTROLLER Pregelj Boštjan, Gerkšič Samo Jozef Stefan Institute, Ljubljana, Slovenia Abstract: With the recently developed multi-parametric predictive
More informationApplications of Controlled Invariance to the l 1 Optimal Control Problem
Applications of Controlled Invariance to the l 1 Optimal Control Problem Carlos E.T. Dórea and Jean-Claude Hennet LAAS-CNRS 7, Ave. du Colonel Roche, 31077 Toulouse Cédex 4, FRANCE Phone : (+33) 61 33
More informationEE C128 / ME C134 Feedback Control Systems
EE C128 / ME C134 Feedback Control Systems Lecture Additional Material Introduction to Model Predictive Control Maximilian Balandat Department of Electrical Engineering & Computer Science University of
More informationCO 250 Final Exam Guide
Spring 2017 CO 250 Final Exam Guide TABLE OF CONTENTS richardwu.ca CO 250 Final Exam Guide Introduction to Optimization Kanstantsin Pashkovich Spring 2017 University of Waterloo Last Revision: March 4,
More informationComputational Finance
Department of Mathematics at University of California, San Diego Computational Finance Optimization Techniques [Lecture 2] Michael Holst January 9, 2017 Contents 1 Optimization Techniques 3 1.1 Examples
More informationThe Karush-Kuhn-Tucker conditions
Chapter 6 The Karush-Kuhn-Tucker conditions 6.1 Introduction In this chapter we derive the first order necessary condition known as Karush-Kuhn-Tucker (KKT) conditions. To this aim we introduce the alternative
More informationOptimization. Escuela de Ingeniería Informática de Oviedo. (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30
Optimization Escuela de Ingeniería Informática de Oviedo (Dpto. de Matemáticas-UniOvi) Numerical Computation Optimization 1 / 30 Unconstrained optimization Outline 1 Unconstrained optimization 2 Constrained
More informationInterior-Point Methods for Linear Optimization
Interior-Point Methods for Linear Optimization Robert M. Freund and Jorge Vera March, 204 c 204 Robert M. Freund and Jorge Vera. All rights reserved. Linear Optimization with a Logarithmic Barrier Function
More informationClosed-loop Formulation for Nonlinear Dynamic Real-time Optimization
Preprint, 11th IFAC Symposium on Dynamics and Control of Process Systems, including Biosystems Closed-loop Formulation for Nonlinear Dynamic Real-time Optimization Mohammad Zamry Jamaludin Christopher
More informationNonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control
Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control 19/4/2012 Lecture content Problem formulation and sample examples (ch 13.1) Theoretical background Graphical
More informationOptimal and suboptimal event-triggering in linear model predictive control
Preamble. This is a reprint of the article: M. Jost, M. Schulze Darup and M. Mönnigmann. Optimal and suboptimal eventtriggering in linear model predictive control. In Proc. of the 25 European Control Conference,
More informationinputs. The velocity form is used in the digital implementation to avoid wind-up [7]. The unified LQR scheme has been developed due to several reasons
A LQR Scheme for SCR Process in Combined-Cycle Thermal Power Plants Santo Wijaya 1 Keiko Shimizu 1 and Masashi Nakamoto 2 Abstract The paper presents a feedback control of Linear Quadratic Regulator (LQR)
More informationInterior-Point and Augmented Lagrangian Algorithms for Optimization and Control
Interior-Point and Augmented Lagrangian Algorithms for Optimization and Control Stephen Wright University of Wisconsin-Madison May 2014 Wright (UW-Madison) Constrained Optimization May 2014 1 / 46 In This
More information