Efficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph
|
|
- Sheena Kelly
- 6 years ago
- Views:
Transcription
1 Efficient robust optimization for robust control with constraints p. 1 Efficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph
2 Efficient robust optimization for robust control with constraints p. 2 Outline Problem definition LTI system with bounded state disturbance Convex constraints on state and input Optimization over affine state feedback policies Optimization problem is non-convex Optimization over affine disturbance feedback policies Equivalent to affine state feedback, but convex Efficient solution by decomposition Optimization using QP for polytopic constraints Highly structured if -norm bounded disturbances Solvable in O(N 3 ) time Mathematical Programming, ONLINE FIRST:
3 Efficient robust optimization for robust control with constraints p. 3 What Do We Want to Do? For the discrete-time LTI system x i+1 = Ax i + Bu i + w i, i = 0, 1,... u i = µ i (x 0,...,x i ), i = 0, 1,... with given initial state x = x 0, find a feedback policy π := {µ 0 ( ), µ 1 ( ),...} which guarantees satisfaction of mixed convex constraints (x i, u i ) Z i = 0, 1,... for all sequences {w 0, w 1,...}, where w i W, W bounded
4 Efficient robust optimization for robust control with constraints p. 4 Why Do We Need A Feedback Policy? Without disturbances, the state trajectory can be computed exactly for a given open-loop policy. constraint constraint Nominal Trajectory constraint constraint time
5 Efficient robust optimization for robust control with constraints p. 4 Why Do We Need A Feedback Policy? With disturbances, an open-loop policy can accumulate large uncertainties over the prediction horizon. Open Loop Policy Envelope constraint constraint Nominal Trajectory constraint constraint time
6 Efficient robust optimization for robust control with constraints p. 4 Why Do We Need A Feedback Policy? A feedback policy can control the growth of uncertainty over the planning horizon. Open Loop Policy Envelope Feedback Policy Envelope constraint constraint Nominal Trajectory constraint constraint time
7 Efficient robust optimization for robust control with constraints p. 5 Optimization Over Feedback Policies Optimizing over arbitrary feedback policies is hard: Optimization is over functions: µ i : R n R n R m Infinite number of decision variables: π = {µ 0 ( ), µ 1 ( ),...} Infinite number of constraints: (x i, u i ) Z, w W := W N Compromise Solution: Finite control horizon, i.e. π = {µ 0 ( ), µ 1 ( ),...,µ N 1 ( )} Parameterize π in terms of affine state feedback laws u i = µ i (x 0,...,x i ) = g i + i L i,j x j j=0 Implement receding horizon control (RHC) law: u(k) = µ 0 (x(k))
8 Efficient robust optimization for robust control with constraints p. 6 A Bit of Notation Write state feedback policies in matrix form: so that u 0.. u N 1 L 0,0 0 0 = L N 1,0 L N 1,N 1 0 u = Lx + g and let A, B and E be matrices such that x 0 x 1.. x N + x = Ax + Bu + Ew = (I BL) 1 (Ax + Bg + Ew), where the initial state x := x 0 is known g 0.. g N 1
9 Efficient robust optimization for robust control with constraints p. 7 Choices of Cost Function for RHC Quadratic cost with u = Lx + g V N (x,l,g,w) := N 1 i=0 ( xi 2 Q + u i 2 ) R + xn 2 P, (Q, R, P) 0 Minimize the expected value: min E[V N (x,l,g,w)] (L,g) admissible Input-to-state stable RHC. Recovers LQR solution far from constraints. Minimize a worst-case cost: min (L,g) admissible max V N(x,L,g,w) w W N 1 i=0 γ 2 w i 2 2 RHC with l 2 gain γ. Recovers H solution far from constraints.
10 Efficient robust optimization for robust control with constraints p. 8 Non-Convexity in State Feedback A problem: The optimization problem is nonlinear in the feedback parameter L. A bigger problem: Example: The set of constraint admissible feedback policies is non-convex. x + = x + u + w u 3, w 1 When g = 0 and L 2,1 = 0, constraints are satisfied iff L 1,1 3 L 2,2 (1 + L 1,1 ) + L 2,2 3
11 Efficient robust optimization for robust control with constraints p. 9 An Alternative Feedback Policy Parameterize control as an affine function of disturbances: u i = v i + i 1 j=0 M i,j w j, i = 0,...,N 1 Full state feedback w i = x i+1 Ax i Bu i. u 0 u 1.. u N = M 1, M N 1,0 M N 1,N 2 0 w 0 w 1.. w N 1 + v 0 v 1.. v N 1 or u = Mw + v *State and disturbance feedback parameterizations are equivalent. **The set of admissible disturbance feedback policies is convex.
12 Efficient robust optimization for robust control with constraints p. 10 Implementing a Receding Horizon Controller Assume polytopic constraints on the states and inputs Z := {(x, u) Cx + Du b} X f := {(x, u) Y x z } Optimize (M, v) over feasible control policies, using the nominal cost function V (x,v) = 1 2 (ˆx T i Qˆx i + vi T Rv i ) ˆxT NP ˆx N N 1 i=0 This is particularly easy to do when the disturbances are -norm bounded W := {w w = Ed, d 1}
13 Efficient robust optimization for robust control with constraints p. 11 Implementing a Receding Horizon Controller The robust RHC law can be implemented by solving a QP at each time instant min M,Λ,v 1 2 ( Bv 2 Q + v 2 R) + (Ax) T Bv subject to Fv + (FMJ + GJ)d c + Tx, d 1 where matrices R, Q, F, J, G, and T and vector c are constructed from the problem data
14 Efficient robust optimization for robust control with constraints p. 11 Implementing a Receding Horizon Controller The robust RHC law can be implemented by solving a QP at each time instant min M,Λ,v 1 2 ( Bv 2 Q + v 2 R) + (Ax) T Bv subject to Fv + abs(fmj + GJ)1 c + Tx where matrices R, Q, F, J, G, and T and vector c are constructed from the problem data
15 Efficient robust optimization for robust control with constraints p. 11 Implementing a Receding Horizon Controller The robust RHC law can be implemented by solving a QP at each time instant min M,Λ,v 1 2 ( Bv 2 Q + v 2 R) + (Ax) T Bv subject to Fv + Λ1 c + Tx Λ (FMJ + GJ) Λ where matrices R, Q, F, J, G, and T and vector c are constructed from the problem data Complexity There are O(N 2 ) variables to choose in M An interior point method will require O(N 6 ) time to solve
16 Efficient robust optimization for robust control with constraints p. 11 Implementing a Receding Horizon Controller The robust RHC law can be implemented by solving a QP at each time instant min M,Λ,v 1 2 ( Bv 2 Q + v 2 R) + (Ax) T Bv subject to Fv + Λ1 c + Tx Λ (FMJ + GJ) Λ This problem can be decomposed into three parts Nominal Problem The first constraint is equivalent to a conventional RHC problem with no disturbances if Λ = 0. Constraint Contraction The term δc := Λ1 represents a modification to the nominal constraints. Perturbation Problems The second constraint represents a set of subproblems, each contributing to the total constraint contraction.
17 Efficient robust optimization for robust control with constraints p. 12 Decomposition: Nominal Problem The nominal states ˆx i are the expected states given no disturbances. Reintroduce these states - the first constraint Fv + δc c + Tx can be rewritten in terms of the nominal controls v i and states ˆx i ˆx 0 = x, ˆx i+1 Aˆx i Bv i = 0, i {0,..., N 1} Cˆx i + Dv i + δc i b, i {0,..., N 1} Y ˆx N + δc N z, Can be written in matrix form with banded coefficients.
18 Efficient robust optimization for robust control with constraints p. 13 Decomposition: Perturbation Problems Each of the t columns of the second constraint represents a subproblem Λ (FMJ + GJ) Λ Define y p as the output of some system in response to a unit disturbance at some time k, or y p = (FMJ + GJ)e p, for each p {1,...,t} As in the nominal problem, reintroduce states into each subproblem (u p i, xp i, yp i ) = 0, i {0,..., k} x p k+1 = E (j), x p i+1 Axp i Bup i y p i Cxp i Dup i = 0, i {k + 1,..., N 1} = 0, i {k + 1,..., N 1} y p N Y xp N = 0, Can also be written in matrix form with banded coefficients.
19 Efficient robust optimization for robust control with constraints p. 14 Decomposition: Complete Problem Decomposition yields a QP with a lot of structure: Constraint contraction term δc is the sum of the absolute values of the outputs y p Each of the subproblems has tightly banded coefficients Nominal problem and perturbation problems are coupled by the constraint contraction terms δc Complexity Still O(N 2 ) variables to choose Problem is now highly structured - can be solved efficiently in O(N 3 ) time using a sparse interior point method Can guarantee O(N 3 ) behavior at each interior point step using an appropriate factorization method
20 Efficient robust optimization for robust control with constraints p. 15 Primal-Dual Interior Point Methods for QP KKT conditions: 1 min θ 2 θ Qθ subject to Aθ = b, Cθ d Qθ + A π + C λ = 0 Aθ b = 0, Cθ + d z = 0 (λ, z) 0 λ z = 0
21 Efficient robust optimization for robust control with constraints p. 15 Primal-Dual Interior Point Methods for QP Relax complementarity condition: 1 min θ 2 θ Qθ subject to Aθ = b, Cθ d Qθ + A π + C λ = 0 Aθ b = 0, Cθ + d z = 0 λ i z i = µ, i Sequence of (θ κ, π κ, λ κ, z κ ) are obtained by solving following as µ κ 0: Q A C θ r Q A π = r A ( ) C Λ 1 Z λ rc Λ 1 r Z (r Q, r A, r C ) are residuals of 1 st three constraints, r Z := (ΛZ1 1 µ), µ (0, µ κ )
22 Sparsity Pattern of LHS Matrix One can order the primal and dual variables of the decomposed problem to get a symmetric, block-bordered, banded diagonal set of equations: A J 1 J2... JlN J1 B1 J2 B2... JlN ba xa x b 1 1 x2 = b bln xln BlN Using a Schur complement technique, one can show that above can be solved in O((m + n)3 N 3 ) operations Factorization of Bp based on a Riccati recursion Efficient robust optimization for robust control with constraints p. 16
23 Efficient robust optimization for robust control with constraints p. 17 Results - Average Solution Times (sec) Original Decomposition Problem Size OOQP PATH OOQP PATH 4 states, 4 stages states, 8 stages states, 12 stages states, 16 stages states, 20 stages states, 4 stages states, 8 stages states, 12 stages states, 16 stages x x 8 states, 20 stages x x 12 states, 4 stages states, 8 stages states, 12 stages x x 12 states, 16 stages x x x 12 states, 20 stages x x x
24 Efficient robust optimization for robust control with constraints p. 18 Results: solution times vs. horizon length Solution time vs. horizon length using decomposition, n = number of states Solution Time (seconds) n = 2 n = 4 n = 8 n = 12 N 3 / Horizon Length N
25 Efficient robust optimization for robust control with constraints p. 19 Results: no. iterations vs. horizon length No. iterations vs. horizon length using decomposition, n = number of states Number of iterations n = 2 n = 4 11 n = 8 n = Horizon Length
26 Efficient robust optimization for robust control with constraints p. 20 Closing Remarks Affine state feedback policies Optimization problem is non-convex Affine disturbance feedback policies Equivalent to affine state feedback Optimal policies can be found using convex optimization Controller Implementation Implemented as an RHC by solving a single QP at each step QP requires O(N 6 ) time for polytopic W Problem Decomposition For -norm bounded disturbances, reduces complexity from O(N 6 ) to O(N 3 ) by introducing additional variables to improve structure Can guarantee O(N 3 ) using the right factorization method, but off-the-shelf IP solvers do just as well Mathematical Programming, ONLINE FIRST:
Efficient Robust Optimization for Robust Control with Constraints
Efficient Robust Optimization for Robust Control with Constraints Paul J. Goulart, Eric C. Kerrigan and Daniel Ralph Department of Engineering, University of Cambridge, Trumpington Street, Cambridge CB2
More informationEfficient Robust Optimization for Robust Control with Constraints
Mathematical Programming manuscript No (will be inserted by the editor) Paul J Goulart Eric C Kerrigan Daniel Ralph Efficient Robust Optimization for Robust Control with Constraints Received: date / Accepted:
More information4F3 - Predictive Control
4F3 Predictive Control - Lecture 3 p 1/21 4F3 - Predictive Control Lecture 3 - Predictive Control with Constraints Jan Maciejowski jmm@engcamacuk 4F3 Predictive Control - Lecture 3 p 2/21 Constraints on
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 informationAffine Feedback Policies for Robust Control with Constraints
Affine Feedback Policies for Robust Control with Constraints Paul James Goulart Churchill College Control Group Department of Engineering University of Cambridge A dissertation submitted for the degree
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 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 informationLecture 5 Linear Quadratic Stochastic Control
EE363 Winter 2008-09 Lecture 5 Linear Quadratic Stochastic Control linear-quadratic stochastic control problem solution via dynamic programming 5 1 Linear stochastic system linear dynamical system, over
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 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 informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
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 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 informationStructured State Space Realizations for SLS Distributed Controllers
Structured State Space Realizations for SLS Distributed Controllers James Anderson and Nikolai Matni Abstract In recent work the system level synthesis (SLS) paradigm has been shown to provide a truly
More informationOptimized Robust Control Invariant Tubes. & Robust Model Predictive Control
Optimized Robust Control Invariant Tubes & Robust Model Predictive Control S. V. Raković (sasa.rakovic@imperial.ac.uk) Imperial College, London Imperial College, 17. November 2004 Imperial College ICM
More informationDenis ARZELIER arzelier
COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.2 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS PERFORMANCE ANALYSIS and SYNTHESIS Denis ARZELIER www.laas.fr/ arzelier arzelier@laas.fr 15
More informationPrediktivno upravljanje primjenom matematičkog programiranja
Prediktivno upravljanje primjenom matematičkog programiranja Doc. dr. sc. Mato Baotić Fakultet elektrotehnike i računarstva Sveučilište u Zagrebu www.fer.hr/mato.baotic Outline Application Examples PredictiveControl
More informationSemidefinite Programming Duality and Linear Time-invariant Systems
Semidefinite Programming Duality and Linear Time-invariant Systems Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 2 July 2004 Workshop on Linear Matrix Inequalities in Control LAAS-CNRS,
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 information8 A First Glimpse on Design with LMIs
8 A First Glimpse on Design with LMIs 8.1 Conceptual Design Problem Given a linear time invariant system design a linear time invariant controller or filter so as to guarantee some closed loop indices
More informationRegional Solution of Constrained LQ Optimal Control
Regional Solution of Constrained LQ Optimal Control José DeDoná September 2004 Outline 1 Recap on the Solution for N = 2 2 Regional Explicit Solution Comparison with the Maximal Output Admissible Set 3
More informationAppendix A Solving Linear Matrix Inequality (LMI) Problems
Appendix A Solving Linear Matrix Inequality (LMI) Problems In this section, we present a brief introduction about linear matrix inequalities which have been used extensively to solve the FDI problems described
More informationProject Discussions: SNL/ADMM, MDP/Randomization, Quadratic Regularization, and Online Linear Programming
Project Discussions: SNL/ADMM, MDP/Randomization, Quadratic Regularization, and Online Linear Programming Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305,
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationFPGA Implementation of a Predictive Controller
FPGA Implementation of a Predictive Controller SIAM Conference on Optimization 2011, Darmstadt, Germany Minisymposium on embedded optimization Juan L. Jerez, George A. Constantinides and Eric C. Kerrigan
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 informationLinear Matrix Inequality (LMI)
Linear Matrix Inequality (LMI) A linear matrix inequality is an expression of the form where F (x) F 0 + x 1 F 1 + + x m F m > 0 (1) x = (x 1,, x m ) R m, F 0,, F m are real symmetric matrices, and the
More informationSemidefinite Programming Basics and Applications
Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent
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 informationLinear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013
Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013 Abstract As in optimal control theory, linear quadratic (LQ) differential games (DG) can be solved, even in high dimension,
More informationRobustly stable feedback min-max model predictive control 1
Robustly stable feedback min-max model predictive control 1 Eric C. Kerrigan 2 and Jan M. Maciejowski Department of Engineering, University of Cambridge Trumpington Street, Cambridge CB2 1PZ, United Kingdom
More informationSolving Dual Problems
Lecture 20 Solving Dual Problems We consider a constrained problem where, in addition to the constraint set X, there are also inequality and linear equality constraints. Specifically the minimization problem
More informationDecentralized and distributed control
Decentralized and distributed control Centralized control for constrained discrete-time systems M. Farina 1 G. Ferrari Trecate 2 1 Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB) Politecnico
More informationNonlinear Programming Models
Nonlinear Programming Models Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Nonlinear Programming Models p. Introduction Nonlinear Programming Models p. NLP problems minf(x) x S R n Standard form:
More informationConvex Optimization. Lecture 12 - Equality Constrained Optimization. Instructor: Yuanzhang Xiao. Fall University of Hawaii at Manoa
Convex Optimization Lecture 12 - Equality Constrained Optimization Instructor: Yuanzhang Xiao University of Hawaii at Manoa Fall 2017 1 / 19 Today s Lecture 1 Basic Concepts 2 for Equality Constrained
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 02: Optimization (Convex and Otherwise) What is Optimization? An Optimization Problem has 3 parts. x F f(x) :
More informationOutline. 1 Linear Quadratic Problem. 2 Constraints. 3 Dynamic Programming Solution. 4 The Infinite Horizon LQ Problem.
Model Predictive Control Short Course Regulation James B. Rawlings Michael J. Risbeck Nishith R. Patel Department of Chemical and Biological Engineering Copyright c 217 by James B. Rawlings Outline 1 Linear
More informationLecture 6: Conic Optimization September 8
IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization
Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012
More informationMomentum-centric whole-body control and kino-dynamic motion generation for floating-base robots
Momentum-centric whole-body control and kino-dynamic motion generation for floating-base robots Alexander Herzog The Movement Generation and Control Group (Ludovic Righetti) Conflicting tasks & constraints
More informationSubject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)
Subject: Optimal Control Assignment- (Related to Lecture notes -). Design a oil mug, shown in fig., to hold as much oil possible. The height and radius of the mug should not be more than 6cm. The mug must
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 informationLecture 10 Linear Quadratic Stochastic Control with Partial State Observation
EE363 Winter 2008-09 Lecture 10 Linear Quadratic Stochastic Control with Partial State Observation partially observed linear-quadratic stochastic control problem estimation-control separation principle
More informationDynamic Model Predictive Control
Dynamic Model Predictive Control Karl Mårtensson, Andreas Wernrud, Department of Automatic Control, Faculty of Engineering, Lund University, Box 118, SE 221 Lund, Sweden. E-mail: {karl, andreas}@control.lth.se
More informationSparse Regularization via Convex Analysis
Sparse Regularization via Convex Analysis Ivan Selesnick Electrical and Computer Engineering Tandon School of Engineering New York University Brooklyn, New York, USA 29 / 66 Convex or non-convex: Which
More informationMulti-Model Adaptive Regulation for a Family of Systems Containing Different Zero Structures
Preprints of the 19th World Congress The International Federation of Automatic Control Multi-Model Adaptive Regulation for a Family of Systems Containing Different Zero Structures Eric Peterson Harry G.
More informationCS711008Z Algorithm Design and Analysis
CS711008Z Algorithm Design and Analysis Lecture 8 Linear programming: interior point method Dongbo Bu Institute of Computing Technology Chinese Academy of Sciences, Beijing, China 1 / 31 Outline Brief
More informationESC794: Special Topics: Model Predictive Control
ESC794: Special Topics: Model Predictive Control Nonlinear MPC Analysis : Part 1 Reference: Nonlinear Model Predictive Control (Ch.3), Grüne and Pannek Hanz Richter, Professor Mechanical Engineering Department
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 informationRobust Adaptive MPC for Systems with Exogeneous Disturbances
Robust Adaptive MPC for Systems with Exogeneous Disturbances V. Adetola M. Guay Department of Chemical Engineering, Queen s University, Kingston, Ontario, Canada (e-mail: martin.guay@chee.queensu.ca) Abstract:
More informationLecture 8. Applications
Lecture 8. Applications Ivan Papusha CDS270 2: Mathematical Methods in Control and System Engineering May 8, 205 / 3 Logistics hw7 due this Wed, May 20 do an easy problem or CYOA hw8 (design problem) will
More informationECE7850 Lecture 8. Nonlinear Model Predictive Control: Theoretical Aspects
ECE7850 Lecture 8 Nonlinear Model Predictive Control: Theoretical Aspects Model Predictive control (MPC) is a powerful control design method for constrained dynamical systems. The basic principles and
More informationAn interior-point gradient method for large-scale totally nonnegative least squares problems
An interior-point gradient method for large-scale totally nonnegative least squares problems Michael Merritt and Yin Zhang Technical Report TR04-08 Department of Computational and Applied Mathematics Rice
More informationA Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem
A Hierarchy of Suboptimal Policies for the Multi-period, Multi-echelon, Robust Inventory Problem Dimitris J. Bertsimas Dan A. Iancu Pablo A. Parrilo Sloan School of Management and Operations Research Center,
More information2nd Symposium on System, Structure and Control, Oaxaca, 2004
263 2nd Symposium on System, Structure and Control, Oaxaca, 2004 A PROJECTIVE ALGORITHM FOR STATIC OUTPUT FEEDBACK STABILIZATION Kaiyang Yang, Robert Orsi and John B. Moore Department of Systems Engineering,
More informationarzelier
COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.1 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS STABILITY ANALYSIS Didier HENRION www.laas.fr/ henrion henrion@laas.fr Denis ARZELIER www.laas.fr/
More information6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC
6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility
More informationConvex Optimization M2
Convex Optimization M2 Lecture 8 A. d Aspremont. Convex Optimization M2. 1/57 Applications A. d Aspremont. Convex Optimization M2. 2/57 Outline Geometrical problems Approximation problems Combinatorial
More informationLecture 9: Discrete-Time Linear Quadratic Regulator Finite-Horizon Case
Lecture 9: Discrete-Time Linear Quadratic Regulator Finite-Horizon Case Dr. Burak Demirel Faculty of Electrical Engineering and Information Technology, University of Paderborn December 15, 2015 2 Previous
More informationPartially Observable Markov Decision Processes (POMDPs) Pieter Abbeel UC Berkeley EECS
Partially Observable Markov Decision Processes (POMDPs) Pieter Abbeel UC Berkeley EECS Many slides adapted from Jur van den Berg Outline POMDPs Separation Principle / Certainty Equivalence Locally Optimal
More informationA SIMPLE TUBE CONTROLLER FOR EFFICIENT ROBUST MODEL PREDICTIVE CONTROL OF CONSTRAINED LINEAR DISCRETE TIME SYSTEMS SUBJECT TO BOUNDED DISTURBANCES
A SIMPLE TUBE CONTROLLER FOR EFFICIENT ROBUST MODEL PREDICTIVE CONTROL OF CONSTRAINED LINEAR DISCRETE TIME SYSTEMS SUBJECT TO BOUNDED DISTURBANCES S. V. Raković,1 D. Q. Mayne Imperial College London, London
More informationThe convergence of stationary iterations with indefinite splitting
The convergence of stationary iterations with indefinite splitting Michael C. Ferris Joint work with: Tom Rutherford and Andy Wathen University of Wisconsin, Madison 6th International Conference on Complementarity
More informationLinear-Quadratic Optimal Control: Full-State Feedback
Chapter 4 Linear-Quadratic Optimal Control: Full-State Feedback 1 Linear quadratic optimization is a basic method for designing controllers for linear (and often nonlinear) dynamical systems and is actually
More information1. Type your solutions. This homework is mainly a programming assignment.
THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS H O M E W O R K S # 6 + 7 Ahmad F. Taha October 22, 2015 READ Homework Instructions: 1. Type your solutions. This homework
More informationLarge Scale Portfolio Optimization with Piecewise Linear Transaction Costs
Large Scale Portfolio Optimization with Piecewise Linear Transaction Costs Marina Potaptchik Levent Tunçel Henry Wolkowicz September 26, 2006 University of Waterloo Department of Combinatorics & Optimization
More informationAnalysis and synthesis: a complexity perspective
Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications
More information14. Duality. ˆ Upper and lower bounds. ˆ General duality. ˆ Constraint qualifications. ˆ Counterexample. ˆ Complementary slackness.
CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 14. Duality ˆ Upper and lower bounds ˆ General duality ˆ Constraint qualifications ˆ Counterexample ˆ Complementary slackness ˆ Examples ˆ Sensitivity
More informationminimize x x2 2 x 1x 2 x 1 subject to x 1 +2x 2 u 1 x 1 4x 2 u 2, 5x 1 +76x 2 1,
4 Duality 4.1 Numerical perturbation analysis example. Consider the quadratic program with variables x 1, x 2, and parameters u 1, u 2. minimize x 2 1 +2x2 2 x 1x 2 x 1 subject to x 1 +2x 2 u 1 x 1 4x
More informationRelaxations and Randomized Methods for Nonconvex QCQPs
Relaxations and Randomized Methods for Nonconvex QCQPs Alexandre d Aspremont, Stephen Boyd EE392o, Stanford University Autumn, 2003 Introduction While some special classes of nonconvex problems can be
More informationFast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
More informationOptimization Problems in Model Predictive Control
Optimization Problems in Model Predictive Control Stephen Wright Jim Rawlings, Matt Tenny, Gabriele Pannocchia University of Wisconsin-Madison FoCM 02 Minneapolis August 6, 2002 1 reminder! Send your new
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 informationLinear Matrix Inequalities in Robust Control. Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University MTNS 2002
Linear Matrix Inequalities in Robust Control Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University MTNS 2002 Objective A brief introduction to LMI techniques for Robust Control Emphasis on
More informationHot-Starting NLP Solvers
Hot-Starting NLP Solvers Andreas Wächter Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu 204 Mixed Integer Programming Workshop Ohio
More informationMin-Max Output Integral Sliding Mode Control for Multiplant Linear Uncertain Systems
Proceedings of the 27 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July -3, 27 FrC.4 Min-Max Output Integral Sliding Mode Control for Multiplant Linear Uncertain
More informationPart II: Model Predictive Control
Part II: Model Predictive Control Manfred Morari Alberto Bemporad Francesco Borrelli Unconstrained Optimal Control Unconstrained infinite time optimal control V (x 0 )= inf U k=0 [ x k Qx k + u k Ru k]
More informationEfficient Numerical Methods for Nonlinear MPC and Moving Horizon Estimation
Efficient Numerical Methods for Nonlinear MPC and Moving Horizon Estimation Moritz Diehl, Hans Joachim Ferreau, and Niels Haverbeke Optimization in Engineering Center (OPTEC) and ESAT-SCD, K.U. Leuven,
More informationSparse Optimization Lecture: Dual Certificate in l 1 Minimization
Sparse Optimization Lecture: Dual Certificate in l 1 Minimization Instructor: Wotao Yin July 2013 Note scriber: Zheng Sun Those who complete this lecture will know what is a dual certificate for l 1 minimization
More informationECE7850 Lecture 7. Discrete Time Optimal Control and Dynamic Programming
ECE7850 Lecture 7 Discrete Time Optimal Control and Dynamic Programming Discrete Time Optimal control Problems Short Introduction to Dynamic Programming Connection to Stabilization Problems 1 DT nonlinear
More information15-780: LinearProgramming
15-780: LinearProgramming J. Zico Kolter February 1-3, 2016 1 Outline Introduction Some linear algebra review Linear programming Simplex algorithm Duality and dual simplex 2 Outline Introduction Some linear
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 informationHPMPC - A new software package with efficient solvers for Model Predictive Control
- A new software package with efficient solvers for Model Predictive Control Technical University of Denmark CITIES Second General Consortium Meeting, DTU, Lyngby Campus, 26-27 May 2015 Introduction Model
More informationState estimation and the Kalman filter
State estimation and the Kalman filter PhD, David Di Ruscio Telemark university college Department of Technology Systems and Control Engineering N-3914 Porsgrunn, Norway Fax: +47 35 57 52 50 Tel: +47 35
More informationIterative Learning Control Analysis and Design I
Iterative Learning Control Analysis and Design I Electronics and Computer Science University of Southampton Southampton, SO17 1BJ, UK etar@ecs.soton.ac.uk http://www.ecs.soton.ac.uk/ Contents Basics Representations
More informationOn Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming
On Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming Altuğ Bitlislioğlu and Colin N. Jones Abstract This technical note discusses convergence
More informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationCourse 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 information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More informationNumerical Methods for PDE-Constrained Optimization
Numerical Methods for PDE-Constrained Optimization Richard H. Byrd 1 Frank E. Curtis 2 Jorge Nocedal 2 1 University of Colorado at Boulder 2 Northwestern University Courant Institute of Mathematical Sciences,
More informationEnlarged terminal sets guaranteeing stability of receding horizon control
Enlarged terminal sets guaranteeing stability of receding horizon control J.A. De Doná a, M.M. Seron a D.Q. Mayne b G.C. Goodwin a a School of Electrical Engineering and Computer Science, The University
More informationThe ϵ-capacity of a gain matrix and tolerable disturbances: Discrete-time perturbed linear systems
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. IV (May - Jun. 2015), PP 52-62 www.iosrjournals.org The ϵ-capacity of a gain matrix and tolerable disturbances:
More informationLinear Quadratic Zero-Sum Two-Person Differential Games
Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard To cite this version: Pierre Bernhard. Linear Quadratic Zero-Sum Two-Person Differential Games. Encyclopaedia of Systems and Control,
More informationAcyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs
Acyclic Semidefinite Approximations of Quadratically Constrained Quadratic Programs Raphael Louca & Eilyan Bitar School of Electrical and Computer Engineering American Control Conference (ACC) Chicago,
More information6.252 NONLINEAR PROGRAMMING LECTURE 10 ALTERNATIVES TO GRADIENT PROJECTION LECTURE OUTLINE. Three Alternatives/Remedies for Gradient Projection
6.252 NONLINEAR PROGRAMMING LECTURE 10 ALTERNATIVES TO GRADIENT PROJECTION LECTURE OUTLINE Three Alternatives/Remedies for Gradient Projection Two-Metric Projection Methods Manifold Suboptimization Methods
More informationReduced-order Interval-observer Design for Dynamic Systems with Time-invariant Uncertainty
Reduced-order Interval-observer Design for Dynamic Systems with Time-invariant Uncertainty Masoud Pourasghar Vicenç Puig Carlos Ocampo-Martinez Qinghua Zhang Automatic Control Department, Universitat Politècnica
More informationTube Model Predictive Control Using Homothety & Invariance
Tube Model Predictive Control Using Homothety & Invariance Saša V. Raković rakovic@control.ee.ethz.ch http://control.ee.ethz.ch/~srakovic Collaboration in parts with Mr. Mirko Fiacchini Automatic Control
More informationClock Synchronization Errors: The robustness problem
Clock Synchronization Errors: The robustness problem Marek Przedwojski 1 Supervisors: Professor Eric Rogers 1, Dr Ivan Markovsky 1 1 University of Southampton, United Kingdom BELS Control Meeting in Exeter,
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 informationSelected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A.
. Selected Examples of CONIC DUALITY AT WORK Robust Linear Optimization Synthesis of Linear Controllers Matrix Cube Theorem A. Nemirovski Arkadi.Nemirovski@isye.gatech.edu Linear Optimization Problem,
More informationDissipativity. Outline. Motivation. Dissipative Systems. M. Sami Fadali EBME Dept., UNR
Dissipativity M. Sami Fadali EBME Dept., UNR 1 Outline Differential storage functions. QSR Dissipativity. Algebraic conditions for dissipativity. Stability of dissipative systems. Feedback Interconnections
More information