Regional Solution of Constrained LQ Optimal Control
|
|
- Ruby Dalton
- 5 years ago
- Views:
Transcription
1 Regional Solution of Constrained LQ Optimal Control José DeDoná September 2004
2 Outline 1 Recap on the Solution for N = 2 2 Regional Explicit Solution Comparison with the Maximal Output Admissible Set 3 Example 4 Conclusions
3 Motivation In the previous part, we provided a global characterisation of receding horizon constrained optimal control for horizon N = 2. Later in the course, we will extend the solution to the case of arbitrary horizon. This gives practically valuable insights into the form of the control law. Indeed, for many problems it is feasible to compute, store and retrieve the function u = N (x), thus eliminating the need to solve the associated QP on line. In this part we address a different question: Given that we only ever apply the first move from the optimal control sequence of length N, is it possible that the first element of the control law might not change as the horizon increases beyond some modest size, at least locally in the state space?
4 Recap on the Solution for N = 2 Theorem (RHC Characterisation for N = 2) The RHC law has the form sat (Gx + h) if x Z, 2 (x) = sat (x) if x Z, sat (Gx h) if x Z +, (1) where the gains, G R 1 n and the constant h R are = R 1 B t PA, G = + BA 1 + (B) 2, h = B 1 + (B) 2, and the sets (Z, Z, Z + ) are defined by Z = {x : (A B)x < }, Z = {x : (A B)x }, Z + = {x : (A B)x > }.
5 Recap on the Solution for N = 2 Thus, the solution for N = 2 is given by: sat (Gx + h) if x Z, 2 (x) = sat (x) if x Z, sat (Gx h) if x Z +, We now ask the following question: Under what conditions is the control law u k = sat (x k ) optimal for the receding horizon control problem, and for arbitrary horizon N?
6 Regional Explicit Solution Consider the fixed-horizon optimisation problem for arbitrary horizon N: P N (x) : V opt N (x) = min V N({x k }, {u k }), subject to: x 0 = x, x k+1 = Ax k + Bu k for k = 0, 1,...,N 1, u k U = [, ] for k = 0, 1,...,N 1, with objective function: V N ({x k }, {u k }) = 1 2 xt N Px N N 1 ( ) x t k Qx k + u t k Ru k. k=0
7 Regional Explicit Solution We have already shown, for N = 2, that for all x Z, where u opt k = sat (x k ), k = 0, 1, Z = {x : (A B)x }. We can see that this characterisation is valid locally, i.e., inside a region Z, defined by linear inequalities.
8 Regional Explicit Solution To extend the regional solution u opt = sat k (x k ) to larger horizons, we need to define a number of additional sets in the state space. This is no surprise, since as we increase the horizon we would expect additional sets of inequalities to be required in order for the solution u opt = sat k (x k ) to still be valid. Define the gains i = A i 1 (A B), i = 1, 2,...,N 1. Also, define the sets X i by the linear inequalities: X i = { x : i x i, i x i }, i = 1, 2,...,N 1. (2) where the saturation bounds i are defined as i 2 i 1 + A k B, i = 1, 2,...,N. (3) k=0
9 Regional Explicit Solution Also define the nonlinear mapping φ nl (x) = Ax Bsat (x), and the sets: Y i = i 1 j=1 X j, i = 2, 3,...,N, (4) Z = { x : φ k nl (x) Y N k, k = 0, 1,...,N 2 }, for N 2. (5)
10 Regional Explicit Solution Theorem Consider the fixed horizon optimal control problem P N (x). Then for all x Z the optimal control sequence {u opt 0,...,uopt N 1 } is u opt k = sat (x k ), for k = 0, 1,...,N 1, where x k = φ k nl (x). The proof follows the same arguments as in the proof of the case N = 2 and uses induction. (More involved.)
11 Regional Explicit Solution We now consider the receding horizon control (RHC) implementation of the previous (fixed horizon) control law. That is, given the control sequence {u opt 0,...,uopt } that achieves the N 1 minimum in P N (x), the control applied to the plant is N (x) = u opt 0. We need to introduce the concept of an invariant set for the closed loop system x k+1 = φ nl (x k ) = Ax k Bsat (x k ). To this end, define the set Z = { x : φ k nl (x) Y N, k = 0, 1, 2,... }, N 2. The set Z is the maximal positively invariant set contained in Z and Y N for the closed loop system x k+1 = φ nl (x k ) = Ax k Bsat (x k ).
12 Regional Explicit Solution We then have the following result: Theorem For all x Z the RHC law N is given by N (x) = sat (x). The proof follows from the fact that Z Z and that Z is positively invariant under the control N (x) = sat (x).
13 Comparison with the Maximal Output Admissible Set Consider the maximal output admissible set O, defined as the set where constraints are always satisfied with the linear controller u = x: O { x : (A B) i x for i = 0, 1,... }. (6) It can be shown that the set Z, where the control law N (x) = sat (x) is optimal, is bigger than the maximal output admissible set O, as we will prove next. In fact, Z can be considerably bigger than O, as we will illustrate with an example.
14 Comparison with the Maximal Output Admissible Set Proposition Proof. O Z. Since Z is the maximal positively invariant set in Y N, it suffices to show that O Y N N 1 i=1 X i (see (4)). Assume, therefore, that x O, so that (see (6)) A j x, j = 0, 1,..., (7) where A = A B.
15 Comparison with the Maximal Output Admissible Set Proof (Ctd.) For any i {1, 2,...,N 1}, A i = (A B)A i 1 = A(A B)A i 2 = A 2 (A B)A i 3 = A 3 A i 3 = AA i 1 A 2 BA i 3 BA i 1 BA i 1 ABA i 2 = A 2 A i 2 ABA i 2. i 2 = A i 1 A A j BA i 1 j, j=0 BA i 1 ABA i 2 BA i 1 BA i 1
16 Comparison with the Maximal Output Admissible Set Proof (Ctd.) From the previous expression, we obtain i 2 A i 1 A x = A i x + j=0 From (7) and (8), we obtain the inequality i 2 A i 1 A x A i x + j=0 A j BA i 1 j x. (8) A j B A i 1 j x (9) i A j B = i (see (3)). (10) j=0 This implies x X i for all i {1, 2,...,N 1} (see (2)), yielding the desired result.
17 Example Consider the system x k+1 = Ax k + Bu k with [ ] [ ] A =, B =, =1, N = 10, Q = I and R = Y N = N 1 i=1 X i x 2 k O Y N E O = maximal output admissible set E = positively invariant ellipsoid O E Z Y N. x 1 k
18 Example Simulation with initial condition x 0 = [ ] t. Notice that the control remains saturated during the initial three steps x 2 k 0 uk x 1 k Shown in the figures are the sequences obtained with numerical (QP) RHC and with the control law u k = sat (x k ). (Both sequences coincide.) k
19 Example Simulation with initial condition x 0 = [ ] t. Notice that the control remains saturated during the initial five steps x 2 k 0 uk x 1 k Shown in the figures are the sequences obtained with numerical (QP) RHC and with the control law u k = sat (x k ). (Both sequences coincide.) k
20 Conclusions State Space MPC = - sat(x) Unconstrained Locally, the tactical MPC design has a closed-form solution N (x) = sat (x). The control law N (x) = sat (x) can be thought of as a particular case of an Anti-windup design. Simple implementation of optimisation based strategies can lead to new ideas in robustness, stability, etc.
4F3 - 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 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 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 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 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 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 informationA Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1
A Globally Stabilizing Receding Horizon Controller for Neutrally Stable Linear Systems with Input Constraints 1 Ali Jadbabaie, Claudio De Persis, and Tae-Woong Yoon 2 Department of Electrical Engineering
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 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 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 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 informationMATH 4211/6211 Optimization Constrained Optimization
MATH 4211/6211 Optimization Constrained Optimization Xiaojing Ye Department of Mathematics & Statistics Georgia State University Xiaojing Ye, Math & Stat, Georgia State University 0 Constrained optimization
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 informationELE539A: Optimization of Communication Systems Lecture 6: Quadratic Programming, Geometric Programming, and Applications
ELE539A: Optimization of Communication Systems Lecture 6: Quadratic Programming, Geometric Programming, and Applications Professor M. Chiang Electrical Engineering Department, Princeton University February
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 informationRobust Model Predictive Control
Robust Model Predictive Control Motivation: An industrial C3/C4 splitter: MPC assuming ideal model: MPC considering model uncertainty Robust Model Predictive Control Nominal model of the plant: 1 = G ()
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 informationEfficient robust optimization for robust control with constraints Paul Goulart, Eric Kerrigan and Danny Ralph
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 Efficient robust optimization
More informationPrashant Mhaskar, Nael H. El-Farra & Panagiotis D. Christofides. Department of Chemical Engineering University of California, Los Angeles
HYBRID PREDICTIVE OUTPUT FEEDBACK STABILIZATION OF CONSTRAINED LINEAR SYSTEMS Prashant Mhaskar, Nael H. El-Farra & Panagiotis D. Christofides Department of Chemical Engineering University of California,
More informationSuppose that we have a specific single stage dynamic system governed by the following equation:
Dynamic Optimisation Discrete Dynamic Systems A single stage example Suppose that we have a specific single stage dynamic system governed by the following equation: x 1 = ax 0 + bu 0, x 0 = x i (1) where
More informationStatic and Dynamic Optimization (42111)
Static and Dynamic Optimization (421) Niels Kjølstad Poulsen Build. 0b, room 01 Section for Dynamical Systems Dept. of Applied Mathematics and Computer Science The Technical University of Denmark Email:
More informationOptimal Control. Lecture 18. Hamilton-Jacobi-Bellman Equation, Cont. John T. Wen. March 29, Ref: Bryson & Ho Chapter 4.
Optimal Control Lecture 18 Hamilton-Jacobi-Bellman Equation, Cont. John T. Wen Ref: Bryson & Ho Chapter 4. March 29, 2004 Outline Hamilton-Jacobi-Bellman (HJB) Equation Iterative solution of HJB Equation
More informationProve proposition 68. It states: Let R be a ring. We have the following
Theorem HW7.1. properties: Prove proposition 68. It states: Let R be a ring. We have the following 1. The ring R only has one additive identity. That is, if 0 R with 0 +b = b+0 = b for every b R, then
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 TIME VARYING TERMINAL LAWS IN MPQP
LINEAR TIME VARYING TERMINAL LAWS IN MPQP JA Rossiter Dept of Aut Control & Systems Eng University of Sheffield, Mappin Street Sheffield, S1 3JD, UK email: JARossiter@sheffieldacuk B Kouvaritakis M Cannon
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 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 information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set Löwner-John ellipsoid
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 informationUCLA Chemical Engineering. Process & Control Systems Engineering Laboratory
Constrained Innite-time Optimal Control Donald J. Chmielewski Chemical Engineering Department University of California Los Angeles February 23, 2000 Stochastic Formulation - Min Max Formulation - UCLA
More informationCross Directional Control
Cross Directional Control Graham C. Goodwin Day 4: Lecture 4 16th September 2004 International Summer School Grenoble, France 1. Introduction In this lecture we describe a practical application of receding
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 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 informationOn the Stabilization of Neutrally Stable Linear Discrete Time Systems
TWCCC Texas Wisconsin California Control Consortium Technical report number 2017 01 On the Stabilization of Neutrally Stable Linear Discrete Time Systems Travis J. Arnold and James B. Rawlings Department
More informationAdaptive Nonlinear Model Predictive Control with Suboptimality and Stability Guarantees
Adaptive Nonlinear Model Predictive Control with Suboptimality and Stability Guarantees Pontus Giselsson Department of Automatic Control LTH Lund University Box 118, SE-221 00 Lund, Sweden pontusg@control.lth.se
More informationChapter 2 Optimal Control Problem
Chapter 2 Optimal Control Problem Optimal control of any process can be achieved either in open or closed loop. In the following two chapters we concentrate mainly on the first class. The first chapter
More informationDuality. Geoff Gordon & Ryan Tibshirani Optimization /
Duality Geoff Gordon & Ryan Tibshirani Optimization 10-725 / 36-725 1 Duality in linear programs Suppose we want to find lower bound on the optimal value in our convex problem, B min x C f(x) E.g., consider
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 informationNonlinear Model Predictive Control for Periodic Systems using LMIs
Marcus Reble Christoph Böhm Fran Allgöwer Nonlinear Model Predictive Control for Periodic Systems using LMIs Stuttgart, June 29 Institute for Systems Theory and Automatic Control (IST), University of Stuttgart,
More informationMath /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined
Math 400-001/Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined using limits. As a particular case, the derivative of 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 information1 Strict local optimality in unconstrained optimization
ORF 53 Lecture 14 Spring 016, Princeton University Instructor: A.A. Ahmadi Scribe: G. Hall Thursday, April 14, 016 When in doubt on the accuracy of these notes, please cross check with the instructor s
More informationA Tour of Reinforcement Learning The View from Continuous Control. Benjamin Recht University of California, Berkeley
A Tour of Reinforcement Learning The View from Continuous Control Benjamin Recht University of California, Berkeley trustable, scalable, predictable Control Theory! Reinforcement Learning is the study
More information4. Convex optimization problems (part 1: general)
EE/AA 578, Univ of Washington, Fall 2016 4. Convex optimization problems (part 1: general) optimization problem in standard form convex optimization problems quasiconvex optimization 4 1 Optimization problem
More informationOn-off Control: Audio Applications
On-off Control: Audio Applications Graham C. Goodwin Day 4: Lecture 3 16th September 2004 International Summer School Grenoble, France 1 Background In this lecture we address the issue of control when
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 information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More information4. Convex optimization problems
Convex Optimization Boyd & Vandenberghe 4. Convex optimization problems optimization problem in standard form convex optimization problems quasiconvex optimization linear optimization quadratic optimization
More informationStructure of the Hessian
Structure of the Hessian Graham C. Goodwin September 2004 1. Introduction We saw in earlier lectures that a core ingredient in quadratic constrained optimisation problems is the Hessian matrix H. So far
More informationSystems of Equations and Inequalities. College Algebra
Systems of Equations and Inequalities College Algebra System of Linear Equations There are three types of systems of linear equations in two variables, and three types of solutions. 1. An independent system
More informationBaltic Way 2003 Riga, November 2, 2003
altic Way 2003 Riga, November 2, 2003 Problems and solutions. Let Q + be the set of positive rational numbers. Find all functions f : Q + Q + which for all x Q + fulfil () f ( x ) = f (x) (2) ( + x ) f
More informationModel predictive control of industrial processes. Vitali Vansovitš
Model predictive control of industrial processes Vitali Vansovitš Contents Industrial process (Iru Power Plant) Neural networ identification Process identification linear model Model predictive controller
More informationCourse on Model Predictive Control Part II Linear MPC design
Course on Model Predictive Control Part II Linear MPC design Gabriele Pannocchia Department of Chemical Engineering, University of Pisa, Italy Email: g.pannocchia@diccism.unipi.it Facoltà di Ingegneria,
More informationA Stable Block Model Predictive Control with Variable Implementation Horizon
American Control Conference June 8-,. Portland, OR, USA WeB9. A Stable Block Model Predictive Control with Variable Implementation Horizon Jing Sun, Shuhao Chen, Ilya Kolmanovsky Abstract In this paper,
More informationGoodwin, Graebe, Salgado, Prentice Hall Chapter 11. Chapter 11. Dealing with Constraints
Chapter 11 Dealing with Constraints Topics to be covered An ubiquitous problem in control is that all real actuators have limited authority. This implies that they are constrained in amplitude and/or rate
More informationFunction: exactly Functions as equations:
Function: - a connection between sets in which each element of the first set corresponds with exactly one element of the second set o the reverse is not necessarily true, but if it is, the function is
More informationGeneralized Hypothesis Testing and Maximizing the Success Probability in Financial Markets
Generalized Hypothesis Testing and Maximizing the Success Probability in Financial Markets Tim Leung 1, Qingshuo Song 2, and Jie Yang 3 1 Columbia University, New York, USA; leung@ieor.columbia.edu 2 City
More informationEE363 homework 7 solutions
EE363 Prof. S. Boyd EE363 homework 7 solutions 1. Gain margin for a linear quadratic regulator. Let K be the optimal state feedback gain for the LQR problem with system ẋ = Ax + Bu, state cost matrix Q,
More informationInterior Point Methods for Mathematical Programming
Interior Point Methods for Mathematical Programming Clóvis C. Gonzaga Federal University of Santa Catarina, Florianópolis, Brazil EURO - 2013 Roma Our heroes Cauchy Newton Lagrange Early results Unconstrained
More informationNonlinear Reference Tracking with Model Predictive Control: An Intuitive Approach
onlinear Reference Tracking with Model Predictive Control: An Intuitive Approach Johannes Köhler, Matthias Müller, Frank Allgöwer Abstract In this paper, we study the system theoretic properties of a reference
More informationConvex optimization problems. Optimization problem in standard form
Convex optimization problems optimization problem in standard form convex optimization problems linear optimization quadratic optimization geometric programming quasiconvex optimization generalized inequality
More informationPermutations and Polynomials Sarah Kitchen February 7, 2006
Permutations and Polynomials Sarah Kitchen February 7, 2006 Suppose you are given the equations x + y + z = a and 1 x + 1 y + 1 z = 1 a, and are asked to prove that one of x,y, and z is equal to a. We
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 informationLecture: Convex Optimization Problems
1/36 Lecture: Convex Optimization Problems http://bicmr.pku.edu.cn/~wenzw/opt-2015-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/36 optimization
More informationECE7850 Lecture 9. Model Predictive Control: Computational Aspects
ECE785 ECE785 Lecture 9 Model Predictive Control: Computational Aspects Model Predictive Control for Constrained Linear Systems Online Solution to Linear MPC Multiparametric Programming Explicit Linear
More informationMathematical Economics: Lecture 16
Mathematical Economics: Lecture 16 Yu Ren WISE, Xiamen University November 26, 2012 Outline 1 Chapter 21: Concave and Quasiconcave Functions New Section Chapter 21: Concave and Quasiconcave Functions Concave
More information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
More informationLecture 3: Basics of set-constrained and unconstrained optimization
Lecture 3: Basics of set-constrained and unconstrained optimization (Chap 6 from textbook) Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 9, 2018 Optimization basics Outline Optimization
More information7.1 Linear Systems Stability Consider the Continuous-Time (CT) Linear Time-Invariant (LTI) system
7 Stability 7.1 Linear Systems Stability Consider the Continuous-Time (CT) Linear Time-Invariant (LTI) system ẋ(t) = A x(t), x(0) = x 0, A R n n, x 0 R n. (14) The origin x = 0 is a globally asymptotically
More informationRobust Explicit MPC Based on Approximate Multi-parametric Convex Programming
43rd IEEE Conference on Decision and Control December 4-7, 24 Atlantis, Paradise Island, Bahamas WeC6.3 Robust Explicit MPC Based on Approximate Multi-parametric Convex Programming D. Muñoz de la Peña
More informationHandout 1: Introduction to Dynamic Programming. 1 Dynamic Programming: Introduction and Examples
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 1: Introduction to Dynamic Programming Instructor: Shiqian Ma January 6, 2014 Suggested Reading: Sections 1.1 1.5 of Chapter
More informationSolution of Additional Exercises for Chapter 4
1 1. (1) Try V (x) = 1 (x 1 + x ). Solution of Additional Exercises for Chapter 4 V (x) = x 1 ( x 1 + x ) x = x 1 x + x 1 x In the neighborhood of the origin, the term (x 1 + x ) dominates. Hence, the
More informationEE363 homework 2 solutions
EE363 Prof. S. Boyd EE363 homework 2 solutions. Derivative of matrix inverse. Suppose that X : R R n n, and that X(t is invertible. Show that ( d d dt X(t = X(t dt X(t X(t. Hint: differentiate X(tX(t =
More informationSecond Order Optimality Conditions for Constrained Nonlinear Programming
Second Order Optimality Conditions for Constrained Nonlinear Programming Lecture 10, Continuous Optimisation Oxford University Computing Laboratory, HT 2006 Notes by Dr Raphael Hauser (hauser@comlab.ox.ac.uk)
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 informationSteady State Kalman Filter
Steady State Kalman Filter Infinite Horizon LQ Control: ẋ = Ax + Bu R positive definite, Q = Q T 2Q 1 2. (A, B) stabilizable, (A, Q 1 2) detectable. Solve for the positive (semi-) definite P in the ARE:
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 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 information9. Geometric problems
9. Geometric problems EE/AA 578, Univ of Washington, Fall 2016 projection on a set extremal volume ellipsoids centering classification 9 1 Projection on convex set projection of point x on set C defined
More informationPolynomial expression
1 Polynomial expression Polynomial expression A expression S(x) in one variable x is an algebraic expression in x term as Where an,an-1,,a,a0 are constant and real numbers and an is not equal to zero Some
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 informationStability analysis of constrained MPC with CLF applied to discrete-time nonlinear system
. RESEARCH PAPER. SCIENCE CHINA Information Sciences November 214, Vol. 57 11221:1 11221:9 doi: 1.17/s11432-14-5111-y Stability analysis of constrained MPC with CLF applied to discrete-time nonlinear system
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 informationA new low-and-high gain feedback design using MPC for global stabilization of linear systems subject to input saturation
A new low-and-high gain feedbac design using MPC for global stabilization of linear systems subject to input saturation Xu Wang 1 Håvard Fjær Grip 1; Ali Saberi 1 Tor Arne Johansen Abstract In this paper,
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationESC794: Special Topics: Model Predictive Control
ESC794: Special Topics: Model Predictive Control Discrete-Time Systems Hanz Richter, Professor Mechanical Engineering Department Cleveland State University Discrete-Time vs. Sampled-Data Systems A continuous-time
More informationMerging Optimization and Control
Merging Optimization and Control Bjarne Foss and Tor Aksel N. Heirung September 4, 2013 Contents 1 Introduction 2 2 Optimization 3 2.1 Classes of optimization problems.................. 3 2.2 Solution
More informationHomework Solution # 3
ECSE 644 Optimal Control Feb, 4 Due: Feb 17, 4 (Tuesday) Homework Solution # 3 1 (5%) Consider the discrete nonlinear control system in Homework # For the optimal control and trajectory that you have found
More informationCLASSICAL FORMS OF LINEAR PROGRAMS, CONVERSION TECHNIQUES, AND SOME NOTATION
(Revised) October 12, 2004 CLASSICAL FORMS OF LINEAR PROGRAMS, CONVERSION TECHNIQUES, AND SOME NOTATION Linear programming is the minimization (maximization) of a linear objective, say c1x 1 + c2x 2 +
More informationA Brief Review on Convex Optimization
A Brief Review on Convex Optimization 1 Convex set S R n is convex if x,y S, λ,µ 0, λ+µ = 1 λx+µy S geometrically: x,y S line segment through x,y S examples (one convex, two nonconvex sets): A Brief Review
More information1 The linear algebra of linear programs (March 15 and 22, 2015)
1 The linear algebra of linear programs (March 15 and 22, 2015) Many optimization problems can be formulated as linear programs. The main features of a linear program are the following: Variables are real
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 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 informationLecture 1. Stochastic Optimization: Introduction. January 8, 2018
Lecture 1 Stochastic Optimization: Introduction January 8, 2018 Optimization Concerned with mininmization/maximization of mathematical functions Often subject to constraints Euler (1707-1783): Nothing
More informationOptimal Control. Quadratic Functions. Single variable quadratic function: Multi-variable quadratic function:
Optimal Control Control design based on pole-placement has non unique solutions Best locations for eigenvalues are sometimes difficult to determine Linear Quadratic LQ) Optimal control minimizes a quadratic
More informationInput: System of inequalities or equalities over the reals R. Output: Value for variables that minimizes cost function
Linear programming Input: System of inequalities or equalities over the reals R A linear cost function Output: Value for variables that minimizes cost function Example: Minimize 6x+4y Subject to 3x + 2y
More informationGuaranteed stability regions of linear systems with actuator saturation using the low-and-high gain technique
Guaranteed stability regions of linear systems with actuator saturation using the low-and-high gain technique M.C. Turner I. Postlethwaite Dept. of Engineering, University of Leicester, Leicester, LE 7RH,
More informationarxiv: v2 [math.gr] 4 Jul 2018
CENTRALIZERS OF NORMAL SUBSYSTEMS REVISITED E. HENKE arxiv:1801.05256v2 [math.gr] 4 Jul 2018 Abstract. In this paper we revisit two concepts which were originally introduced by Aschbacher and are crucial
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 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 information