ECE 680 Linear Matrix Inequalities
|
|
- Jacob Curtis
- 6 years ago
- Views:
Transcription
1 ECE 680 Linear Matrix Inequalities Stan Żak School of Electrical and Computer Engineering Purdue University October 11, 2017 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
2 Outline Motivation Definitions of convex set and convex function Linear matrix inequality (LMI) Canonical LMI Example of LMIs LMI solvers Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
3 The Lyapunov theorem Lyapunov s thm: A constant square matrix A R n n has its eigenvalues in the open left half-complex plane if and only if for any real, symmetric, positive definite Q R n n, the solution P = P to the Lyapunov matrix equation is positive definite A P + PA = Q Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
4 The Lyapunov thm re-stated Lyapunov s thm: The real parts of the eigenvalues of A are all negative if and only if there exists a real symmetric positive definite matrix P such that A P + PA < 0 Equivalently, A P PA > 0 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
5 A P + PA < 0 re-stated Let Define P 1 = P = x 1 x 2 x n x 2 x n+1 x 2n 1.. x n x 2n 1 x q, P 2 = Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
6 Defining P i s P q = Note that each P i has only non-zero elements corresponding to x i in P Let F i = A P i P i A, i = 1, 2,..., q Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
7 Manipulate ) A P + PA = x 1 (A P 1 + P 1 A ) +x 2 (A P 2 + P 2 A ) + + x q (A P q + P q A = x 1 F 1 x 2 F 2 x q F q < 0 Let F (x) = x 1 F 1 + x 2 F x q F q Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
8 Lyapunov s Inequality restated P = P > 0 and A P + PA < 0 if and only if F (x) > 0 Equivalently, [ P O O A P PA ] > 0 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
9 Linear Matrix Inequality Consider n + 1 real symmetric matrices F i = F i R m m, i = 0, 1,..., n and a vector x = [ x 1 x 2 ] x n Construct an affine function F (x) = F 0 + x 1 F x n F n n = F 0 + x i F i i=1 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
10 Linear Matrix Inequality Definition F (x) = F 0 + x 1 F x n F n 0 Find a set of vectors x such that z F (x)z 0 for all z R m, that is, F (x) is positive definite Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
11 Convex Set Definition A set Ω R n is convex if for any x and y in Ω, the line segment between x and y lies in Ω, that is, αx + (1 α)y Ω for any α (0, 1) Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
12 Convex Function Definition A real-valued function f : Ω R defined on a convex set Ω R n is convex if for all x, y Ω and all α (0, 1), f (αx + (1 α)y) αf (x) + (1 α)f (y) Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
13 Convex Optimization Problem Definition A convex optimization problem is the one where the objective function to be minimized is convex and the constraint set, over which we optimize the objective function, is a convex set. Warning: If f is a convex function, then max f (x) subject to x Ω is NOT a convex optimization problem! Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
14 Another LMI Example A system of LMIs, F 1 (x) 0, F 2 (x) 0,..., F k (x) 0 can be represented as one single LMI F 1 (x) F 2 (x) F (x) =... F k(x) 0 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
15 Yet Another LMI Example A linear matrix inequality, involving an m-by-n constant matrix A, of the form, Ax b can be represented as m LMIs b i a i x 0, i = 1, 2,..., m, where a i is the i-th row of the matrix A Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
16 Example # 2 Contd View each scalar inequality as an LMI Represent m LMIs as one LMI, b 1 a 1 x b 2 a 2 x F (x) =... b m a m x 0 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
17 Notation > versus Most of the optimization solvers do not handle strict inequalities Therefore, the operator > is the same as, and so > implements the non-strict inequality Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
18 Solving LMIs F (x) = F 0 + x 1 F x n F n 0 is called the canonical representation of an LMI The LMIs in the canonical form are very inefficient from a storage view-point as well as from the efficiency of the LMI solvers view-point The LMI solvers use a structured representation of LMIs Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
19 LMI Solvers Three types of LMI solvers To test whether or not there exists a solution x to F (x) > 0 is called a feasibility problem Minimization of a linear objective under LMI constraints Generalized eigenvalue minimization problem Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
20 Solving the feasibility problem Can solve LMIs of the form N L(X 1,..., X k )N < M R(X 1,..., X k )M X 1,..., X k matrix variables N left outer factor, M right outer factor L(X 1,..., X k ) left inner factor, R(X 1,..., X k ) right inner factor Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
21 Left-hand side vs. the right-hand side The term left-hand side refers to what is on the smaller side of the inequality 0 < X In X > 0, the matrix X is on the right-hand side it is on the larger side of the inequality Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
22 A general structure for finding a feasible soln setlmis([]) lmivar lmiterm... lmiterm getlmis feasp dec2mat Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
23 X=lmivar(type,structure) The input type specifies the structure of the variable X Three structures of matrix variables type=1 symmetric block diagonal matrix variable type=2 full rectangular matrix variable type=3 other cases Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
24 Second input of X=lmivar(type,structure) Additional info on the structure of the matrix variable X Example D 1 O O O D 2 O X =..... O O D r Each D i is a square symmetric matrix type=1 r blocks structure is r 2 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
25 The input structure The first component of each row of the input structure corresponding block size The second element of each row the block type X=lmivar(1,[3 1]) full symmetric 3 3 matrix variable X=lmivar(2,[2 3]) rectangular 2 3 matrix variable Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
26 Scalar block S = s s s 2 s s 3 s 4, S=lmivar(1,[2 0;2 1]) describes a scalar block matrix, D 1 = s 1 I 2 The second block is a 2 2 symmetric full block Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
27 lmiterm(termid,a,b,flag) termid row with four elements specify the terms of each LMI of the LMI system termid(1)=n to specify the left-hand side of the n-th LMI termid(1)=-n to specify the right-hand side of the n-th LMI termid(2,3)=[i j] specifies the term of the (i, j) block of the LMI specified by the first component Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
28 More on lmiterm(termid,a,b,flag) termid(4)=0 for the constant term termid(4)=x for the variable term in the form AX B termid(4)=-x for the variable term in the form AX B Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
29 Second and third inputs in lmiterm(termid,a,b,flag) A and B give the value of the constant outer factors in the variable terms, AX B or in AX B the flag input to lmiterm serves as a compact way to specify the expression AX B + (AX B) Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
30 Using flag in lmiterm(termid,a,b,flag) flag= s use for symmetrized expression PA + A P < 0 lmiterm([1 1 1 P],1,A) lmiterm([ P],A,1) Note that PA + A P = PA + (PA) lmiterm([1 1 1 P],1,A, s ) Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
31 [tmin,xfeas]=feasp(lmis) Feasibility problem find such that x L(x) < R(x) feasp solves the auxiliary convex minimize t subject to L(x) < R(x) + ti. Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
32 P=dec2mat(lmis,xfeas,P) The system of LMIs is feasible if the minimal t < 0 P=dec2mat(lmis,xfeas,P) converts the output of the LMI solver into matrix variables Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
33 Minimizer of a Linear Objective Subject to LMI Constraints Invoked using the function mincx minimize subject to c x A(x) < B(x). A(x) < B(x) is a shorthand notation for general structured LMI systems Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
34 Observer Design Plant model: ẋ = Ax + Bu y = Cx Linear observer: ˆx = Aˆx + Bu + L(y C ˆx) Goal: Design L to ensure asymptotic stability of the error dynamics Matrix inequality for observer design: (A LC) P + P(A LC) 0, P = P 0 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
35 Observer Design Contd. A P + PA C L P PLC 0, P 0 To-do: Find L, P Problem: Bi-linear matrix inequality in L and P Technique #1: Choose Y = PL LMIs: A } P {{ + PA } C } Y {{ YC } 0, P 0 linear in P linear in Y For robustness of solution, rewrite as with fixed α > 0 A P + PA C Y YC + 2αP 0, P 0 Get back L = P 1 Y (P 0, hence invertible) Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
36 General Structure of CVX Code in MATLAB as summarized by Dr. Ankush Chakrabarty cvx_begin sdp quiet % sdp: semi-definite programming mode % quiet: no display during computing include CVX [variables] % very intuitive variable initialization % for example: variable P(3,3) symmetric minimize([cost]) % convex function subject to [affine constraints] % preferably non-strict inequalities cvx_end disp(cvx_status) % solution status Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
37 Snippet in CVX by Dr. Ankush Chakrabarty cvx_begin sdp % Variable definition variable P(n, n) symmetric variable Y(n, p) % LMIs P*sys.A + sys.a *P - Y*sys.C - sys.c *Y + P <= 0 P >= eps*eye(n) % eps is a very small number in MATLAB cvx_end sys.l = P\Y; % compute L matrix Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
38 State/Output Feedback Control LTI System with output feedback control: ẋ = Ax + Bu y = Cx u = Ky Goal: Design K to ensure asymptotic stability of (A BKC) Matrix inequality for output-feedback controller design: (A BKC) P + P(A BKC) 0, P 0 Simpler case: state-feedback (C = I ) (A BK) P + P(A BK) 0, P 0 Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
39 Simpler Case: State-Feedback Control To-do: Find K, P (A BK) P + P(A BK) 0, P 0 Problem: Bi-linear matrix inequality in K and P Technique #2: Congruence transformation with S P 1 and Z KS New inequalities LMIs: Get back P = S 1, K = ZP SA + AS SK B BKS 0 } SA {{ + AS } Z } B {{ BZ } 0, P 0 linear in S linear in Z Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
40 Snippet in CVX by Dr. Ankush Chakrabarty cvx_begin sdp % Variable definition variable S(n, n) symmetric variable Z(m, n) % LMIs sys.a*s + S*sys.A - sys.b*z - Z *sys.b <= -eps*eye(n) S >= eps*eye(n) cvx_end sys.k = Z/S; % compute K matrix Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
41 Output-Feedback Control A P + PA C K B P PBKC 0, P 0 To-do: Find K, P Problem: Bi-linear matrix inequality in K and P Technique #3: Choose M such that BM = PB and N MK New inequalities: A P + PA C K MB BMKC 0 Linear matrix (in)equalities: A } P {{ + PA } } C N B {{ BNC } 0, BM = PB, P 0 linear in P linear in N Get back K = M 1 N (M is invertible if B has full column rank) Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
42 Snippet in CVX by Dr. Ankush Chakrabarty Cool fact: CVX/YALMIP can handle equality constraints! cvx_begin sdp quiet % Variable definition variable P(n, n) symmetric variable N(m, p) variable M(m, m) % LMIs P*sys.A + sys.a *P - sys.b*n*sys.c... - sys.c *N *sys.b <= -eps*eye(n) sys.b*m == P*sys.B P >= eps*eye(n); cvx_end sys.k = M\N % compute K matrix Stan Żak (Purdue University) ECE 680 Linear Matrix Inequalities October 11, / 42
Introduction to Linear Matrix Inequalities (LMIs)
ECE 680 Fall 2017 Introduction to Linear Matrix Inequalities (LMIs) by Stanislaw H. Żak and Guisheng Zhai October 18, 2017 Henry Ford offered customers the Model T Ford in any color the customer wants,
More informationLinear Matrix Inequality Approach
1 MEM800-007 Chapter 4a Linear Matrix Inequality Approach Reference: Linear matrix inequalities in system and control theory, Stephen Boyd et al. SIAM 1994. Linear Matrix Inequality (LMI) approach have
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 informationLecture 10: Linear Matrix Inequalities Dr.-Ing. Sudchai Boonto
Dr-Ing Sudchai Boonto Department of Control System and Instrumentation Engineering King Mongkuts Unniversity of Technology Thonburi Thailand Linear Matrix Inequalities A linear matrix inequality (LMI)
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 informationModern Optimal Control
Modern Optimal Control Matthew M. Peet Arizona State University Lecture 19: Stabilization via LMIs Optimization Optimization can be posed in functional form: min x F objective function : inequality constraints
More informationFrom Convex Optimization to Linear Matrix Inequalities
Dep. of Information Engineering University of Pisa (Italy) From Convex Optimization to Linear Matrix Inequalities eng. Sergio Grammatico grammatico.sergio@gmail.com Class of Identification of Uncertain
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 informationEE363 homework 8 solutions
EE363 Prof. S. Boyd EE363 homework 8 solutions 1. Lyapunov condition for passivity. The system described by ẋ = f(x, u), y = g(x), x() =, with u(t), y(t) R m, is said to be passive if t u(τ) T y(τ) dτ
More informationPOLE PLACEMENT. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 19
POLE PLACEMENT Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 19 Outline 1 State Feedback 2 Observer 3 Observer Feedback 4 Reduced Order
More informationRiccati Equations and Inequalities in Robust Control
Riccati Equations and Inequalities in Robust Control Lianhao Yin Gabriel Ingesson Martin Karlsson Optimal Control LP4 2014 June 10, 2014 Lianhao Yin Gabriel Ingesson Martin Karlsson (LTH) H control problem
More informationModule 04 Optimization Problems KKT Conditions & Solvers
Module 04 Optimization Problems KKT Conditions & Solvers Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September
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 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 informationStatic Output Feedback Stabilisation with H Performance for a Class of Plants
Static Output Feedback Stabilisation with H Performance for a Class of Plants E. Prempain and I. Postlethwaite Control and Instrumentation Research, Department of Engineering, University of Leicester,
More informationMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science : MULTIVARIABLE CONTROL SYSTEMS by A.
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Q-Parameterization 1 This lecture introduces the so-called
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 informationSTRUCTURE MATTERS: Some Notes on High Gain Observer Design for Nonlinear Systems. Int. Conf. on Systems, Analysis and Automatic Control 2012
Faculty of Electrical and Computer Engineering Institute of Control Theory STRUCTURE MATTERS: Some Notes on High Gain Observer Design for Nonlinear Systems Klaus Röbenack Int. Conf. on Systems, Analysis
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More informationEL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1)
EL 625 Lecture 0 EL 625 Lecture 0 Pole Placement and Observer Design Pole Placement Consider the system ẋ Ax () The solution to this system is x(t) e At x(0) (2) If the eigenvalues of A all lie in the
More informationLecture 9. Econ August 20
Lecture 9 Econ 2001 2015 August 20 Lecture 9 Outline 1 Linear Functions 2 Linear Representation of Matrices 3 Analytic Geometry in R n : Lines and Hyperplanes 4 Separating Hyperplane Theorems Back to vector
More informationto have roots with negative real parts, the necessary and sufficient conditions are that:
THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 543 LINEAR SYSTEMS AND CONTROL H O M E W O R K # 7 Sebastian A. Nugroho November 6, 7 Due date of the homework is: Sunday, November 6th @ :59pm.. The following
More informationOutline. Linear Matrix Inequalities in Control. Outline. System Interconnection. j _jst. ]Bt Bjj. Generalized plant framework
Outline Linear Matrix Inequalities in Control Carsten Scherer and Siep Weiland 7th Elgersburg School on Mathematical Systems heory Class 3 1 Single-Objective Synthesis Setup State-Feedback Output-Feedback
More informationRobust and Optimal Control, Spring 2015
Robust and Optimal Control, Spring 2015 Instructor: Prof. Masayuki Fujita (S5-303B) D. Linear Matrix Inequality D.1 Convex Optimization D.2 Linear Matrix Inequality(LMI) D.3 Control Design and LMI Formulation
More information16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1
16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1 Charles P. Coleman October 31, 2005 1 / 40 : Controllability Tests Observability Tests LEARNING OUTCOMES: Perform controllability tests Perform
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 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 informationLecture 7 and 8. Fall EE 105, Feedback Control Systems (Prof. Khan) September 30 and October 05, 2015
1 Lecture 7 and 8 Fall 2015 - EE 105, Feedback Control Systems (Prof Khan) September 30 and October 05, 2015 I CONTROLLABILITY OF AN DT-LTI SYSTEM IN k TIME-STEPS The DT-LTI system is given by the following
More informationIntroduction to linear matrix inequalities Wojciech Paszke
Introduction to linear matrix inequalities Wojciech Paszke Institute of Control and Computation Engineering, University of Zielona Góra, Poland e-mail: W.Paszke@issi.uz.zgora.pl Outline Introduction to
More information1. Find the solution of the following uncontrolled linear system. 2 α 1 1
Appendix B Revision Problems 1. Find the solution of the following uncontrolled linear system 0 1 1 ẋ = x, x(0) =. 2 3 1 Class test, August 1998 2. Given the linear system described by 2 α 1 1 ẋ = x +
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 6 (Conic optimization) 07 Feb, 2013 Suvrit Sra Organizational Info Quiz coming up on 19th Feb. Project teams by 19th Feb Good if you can mix your research
More information9 The LQR Problem Revisited
9 he LQR Problem Revisited Problem: Compute a state feedback controller u(t) = Kx(t) that stabilizes the closed loop system and minimizes J := lim E [ z(t) z(t) ] t for the LI system Assumptions: a) D
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 informationGraph and Controller Design for Disturbance Attenuation in Consensus Networks
203 3th International Conference on Control, Automation and Systems (ICCAS 203) Oct. 20-23, 203 in Kimdaejung Convention Center, Gwangju, Korea Graph and Controller Design for Disturbance Attenuation in
More informationChapter 3. State Feedback - Pole Placement. Motivation
Chapter 3 State Feedback - Pole Placement Motivation Whereas classical control theory is based on output feedback, this course mainly deals with control system design by state feedback. This model-based
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 informationShort Course Robust Optimization and Machine Learning. 3. Optimization in Supervised Learning
Short Course Robust Optimization and 3. Optimization in Supervised EECS and IEOR Departments UC Berkeley Spring seminar TRANSP-OR, Zinal, Jan. 16-19, 2012 Outline Overview of Supervised models and variants
More informationSYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER
SYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER Exercise 54 Consider the system: ẍ aẋ bx u where u is the input and x the output signal (a): Determine a state space realization (b): Is the
More informationLecture 2 and 3: Controllability of DT-LTI systems
1 Lecture 2 and 3: Controllability of DT-LTI systems Spring 2013 - EE 194, Advanced Control (Prof Khan) January 23 (Wed) and 28 (Mon), 2013 I LTI SYSTEMS Recall that continuous-time LTI systems can be
More informationStability of Parameter Adaptation Algorithms. Big picture
ME5895, UConn, Fall 215 Prof. Xu Chen Big picture For ˆθ (k + 1) = ˆθ (k) + [correction term] we haven t talked about whether ˆθ(k) will converge to the true value θ if k. We haven t even talked about
More informationControl engineering sample exam paper - Model answers
Question Control engineering sample exam paper - Model answers a) By a direct computation we obtain x() =, x(2) =, x(3) =, x(4) = = x(). This trajectory is sketched in Figure (left). Note that A 2 = I
More informationLinear Matrix Inequalities in Control
Linear Matrix Inequalities in Control Delft Center for Systems and Control (DCSC) Delft University of Technology The Netherlands Department of Electrical Engineering Eindhoven University of Technology
More informationUniversity of Toronto Department of Electrical and Computer Engineering ECE410F Control Systems Problem Set #3 Solutions = Q o = CA.
University of Toronto Department of Electrical and Computer Engineering ECE41F Control Systems Problem Set #3 Solutions 1. The observability matrix is Q o C CA 5 6 3 34. Since det(q o ), the matrix is
More informationCONTROL DESIGN FOR SET POINT TRACKING
Chapter 5 CONTROL DESIGN FOR SET POINT TRACKING In this chapter, we extend the pole placement, observer-based output feedback design to solve tracking problems. By tracking we mean that the output is commanded
More informationH 2 Optimal State Feedback Control Synthesis. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
H 2 Optimal State Feedback Control Synthesis Raktim Bhattacharya Aerospace Engineering, Texas A&M University Motivation Motivation w(t) u(t) G K y(t) z(t) w(t) are exogenous signals reference, process
More informationCopositive Plus Matrices
Copositive Plus Matrices Willemieke van Vliet Master Thesis in Applied Mathematics October 2011 Copositive Plus Matrices Summary In this report we discuss the set of copositive plus matrices and their
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More information1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by
Seminar 1 1. Which ones of the usual symbols of addition, subtraction, multiplication and division define an operation (composition law) on the numerical sets N, Z, Q, R, C? 2. Let A = {a 1, a 2, a 3 }.
More informationAN ITERATION. In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b
AN ITERATION In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b In this, A is an n n matrix and b R n.systemsof this form arise
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationMATH 304 Linear Algebra Lecture 19: Least squares problems (continued). Norms and inner products.
MATH 304 Linear Algebra Lecture 19: Least squares problems (continued). Norms and inner products. Orthogonal projection Theorem 1 Let V be a subspace of R n. Then any vector x R n is uniquely represented
More information1 (30 pts) Dominant Pole
EECS C8/ME C34 Fall Problem Set 9 Solutions (3 pts) Dominant Pole For the following transfer function: Y (s) U(s) = (s + )(s + ) a) Give state space description of the system in parallel form (ẋ = Ax +
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 informationLMIs for Observability and Observer Design
LMIs for Observability and Observer Design Matthew M. Peet Arizona State University Lecture 06: LMIs for Observability and Observer Design Observability Consider a system with no input: ẋ(t) = Ax(t), x(0)
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 informationQuadratic Stability of Dynamical Systems. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
.. Quadratic Stability of Dynamical Systems Raktim Bhattacharya Aerospace Engineering, Texas A&M University Quadratic Lyapunov Functions Quadratic Stability Dynamical system is quadratically stable if
More informationComputational Methods. Systems of Linear Equations
Computational Methods Systems of Linear Equations Manfred Huber 2010 1 Systems of Equations Often a system model contains multiple variables (parameters) and contains multiple equations Multiple equations
More informationOptimization Based Output Feedback Control Design in Descriptor Systems
Trabalho apresentado no XXXVII CNMAC, S.J. dos Campos - SP, 017. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics Optimization Based Output Feedback Control Design in
More informationIMPULSIVE CONTROL OF DISCRETE-TIME NETWORKED SYSTEMS WITH COMMUNICATION DELAYS. Shumei Mu, Tianguang Chu, and Long Wang
IMPULSIVE CONTROL OF DISCRETE-TIME NETWORKED SYSTEMS WITH COMMUNICATION DELAYS Shumei Mu Tianguang Chu and Long Wang Intelligent Control Laboratory Center for Systems and Control Department of Mechanics
More informationAdaptive fuzzy observer and robust controller for a 2-DOF robot arm
Adaptive fuzzy observer and robust controller for a 2-DOF robot arm S. Bindiganavile Nagesh Zs. Lendek A. A. Khalate R. Babuška Delft University of Technology, Technical University of Cluj-Napoca FUZZ-IEEE-2012
More informationAn Algorithm for Solving the Convex Feasibility Problem With Linear Matrix Inequality Constraints and an Implementation for Second-Order Cones
An Algorithm for Solving the Convex Feasibility Problem With Linear Matrix Inequality Constraints and an Implementation for Second-Order Cones Bryan Karlovitz July 19, 2012 West Chester University of Pennsylvania
More informationLinear Algebra. P R E R E Q U I S I T E S A S S E S S M E N T Ahmad F. Taha August 24, 2015
THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS P R E R E Q U I S I T E S A S S E S S M E N T Ahmad F. Taha August 24, 2015 The objective of this exercise is to assess
More informationFEL3210 Multivariable Feedback Control
FEL3210 Multivariable Feedback Control Lecture 8: Youla parametrization, LMIs, Model Reduction and Summary [Ch. 11-12] Elling W. Jacobsen, Automatic Control Lab, KTH Lecture 8: Youla, LMIs, Model Reduction
More informationSome new randomized methods for control and optimization
Some new randomized methods for control and optimization B.T. Polyak Institute for Control Sciences, Russian Academy of Sciences, Moscow, Russia June 29 with E. Gryazina, P. Scherbakov Workshop in honor
More informationCALIFORNIA INSTITUTE OF TECHNOLOGY Control and Dynamical Systems
CDS 101 1. For each of the following linear systems, determine whether the origin is asymptotically stable and, if so, plot the step response and frequency response for the system. If there are multiple
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationIntro. Computer Control Systems: F9
Intro. Computer Control Systems: F9 State-feedback control and observers Dave Zachariah Dept. Information Technology, Div. Systems and Control 1 / 21 dave.zachariah@it.uu.se F8: Quiz! 2 / 21 dave.zachariah@it.uu.se
More informationQuiz Discussion. IE417: Nonlinear Programming: Lecture 12. Motivation. Why do we care? Jeff Linderoth. 16th March 2006
Quiz Discussion IE417: Nonlinear Programming: Lecture 12 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University 16th March 2006 Motivation Why do we care? We are interested in
More informationMath Models of OR: Extreme Points and Basic Feasible Solutions
Math Models of OR: Extreme Points and Basic Feasible Solutions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 1180 USA September 018 Mitchell Extreme Points and Basic Feasible Solutions
More informationEE221A Linear System Theory Final Exam
EE221A Linear System Theory Final Exam Professor C. Tomlin Department of Electrical Engineering and Computer Sciences, UC Berkeley Fall 2016 12/16/16, 8-11am Your answers must be supported by analysis,
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationTopic # /31 Feedback Control Systems. Analysis of Nonlinear Systems Lyapunov Stability Analysis
Topic # 16.30/31 Feedback Control Systems Analysis of Nonlinear Systems Lyapunov Stability Analysis Fall 010 16.30/31 Lyapunov Stability Analysis Very general method to prove (or disprove) stability of
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationGlobal Analysis of Piecewise Linear Systems Using Impact Maps and Quadratic Surface Lyapunov Functions
Global Analysis of Piecewise Linear Systems Using Impact Maps and Quadratic Surface Lyapunov Functions Jorge M. Gonçalves, Alexandre Megretski, Munther A. Dahleh Department of EECS, Room 35-41 MIT, Cambridge,
More informationEE364 Review Session 4
EE364 Review Session 4 EE364 Review Outline: convex optimization examples solving quasiconvex problems by bisection exercise 4.47 1 Convex optimization problems we have seen linear programming (LP) quadratic
More informationLMI Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 4: LMIs for State-Space Internal Stability Solving the Equations Find the output given the input State-Space:
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 informationarxiv: v1 [math.oc] 31 Jan 2017
CONVEX CONSTRAINED SEMIALGEBRAIC VOLUME OPTIMIZATION: APPLICATION IN SYSTEMS AND CONTROL 1 Ashkan Jasour, Constantino Lagoa School of Electrical Engineering and Computer Science, Pennsylvania State University
More informationSynthèse de correcteurs par retour d état observé robustes. pour les systèmes à temps discret rationnels en les incertitudes
Synthèse de correcteurs par retour d état observé robustes pour les systèmes à temps discret rationnels en les incertitudes Dimitri Peaucelle Yoshio Ebihara & Yohei Hosoe Séminaire MOSAR, 16 mars 2016
More informationDecentralized control with input saturation
Decentralized control with input saturation Ciprian Deliu Faculty of Mathematics and Computer Science Technical University Eindhoven Eindhoven, The Netherlands November 2006 Decentralized control with
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 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 information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationforms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms
Christopher Engström November 14, 2014 Hermitian LU QR echelon Contents of todays lecture Some interesting / useful / important of matrices Hermitian LU QR echelon Rewriting a as a product of several matrices.
More informationAn LMI Approach to the Control of a Compact Disc Player. Marco Dettori SC Solutions Inc. Santa Clara, California
An LMI Approach to the Control of a Compact Disc Player Marco Dettori SC Solutions Inc. Santa Clara, California IEEE SCV Control Systems Society Santa Clara University March 15, 2001 Overview of my Ph.D.
More informationCourse Outline. FRTN10 Multivariable Control, Lecture 13. General idea for Lectures Lecture 13 Outline. Example 1 (Doyle Stein, 1979)
Course Outline FRTN Multivariable Control, Lecture Automatic Control LTH, 6 L-L Specifications, models and loop-shaping by hand L6-L8 Limitations on achievable performance L9-L Controller optimization:
More informationFeedback control of transient energy growth in subcritical plane Poiseuille flow
Feedback control of transient energy growth in subcritical plane Poiseuille flow F. Martinelli, M. Quadrio, J. McKernan, J.F. Whidborne LadHyX, École Polytechnique; Politecnico di Milano; King s College,
More informationEEE582 Homework Problems
EEE582 Homework Problems HW. Write a state-space realization of the linearized model for the cruise control system around speeds v = 4 (Section.3, http://tsakalis.faculty.asu.edu/notes/models.pdf). Use
More informationSection Partitioned Matrices and LU Factorization
Section 2.4 2.5 Partitioned Matrices and LU Factorization Gexin Yu gyu@wm.edu College of William and Mary partition matrices into blocks In real world problems, systems can have huge numbers of equations
More informationIntroduction to Nonlinear Control Lecture # 4 Passivity
p. 1/6 Introduction to Nonlinear Control Lecture # 4 Passivity È p. 2/6 Memoryless Functions ¹ y È Ý Ù È È È È u (b) µ power inflow = uy Resistor is passive if uy 0 p. 3/6 y y y u u u (a) (b) (c) Passive
More informationOutput Stabilization of Time-Varying Input Delay System using Interval Observer Technique
Output Stabilization of Time-Varying Input Delay System using Interval Observer Technique Andrey Polyakov a, Denis Efimov a, Wilfrid Perruquetti a,b and Jean-Pierre Richard a,b a - NON-A, INRIA Lille Nord-Europe
More informationLinear State Feedback Controller Design
Assignment For EE5101 - Linear Systems Sem I AY2010/2011 Linear State Feedback Controller Design Phang Swee King A0033585A Email: king@nus.edu.sg NGS/ECE Dept. Faculty of Engineering National University
More informationControl Over Packet-Dropping Channels
Chapter 6 Control Over Packet-Dropping Channels So far, we have considered the issue of reliability in two different elements of the feedback loop. In Chapter 4, we studied estimator-based methods to diagnose
More informationMATH2070 Optimisation
MATH2070 Optimisation Nonlinear optimisation with constraints Semester 2, 2012 Lecturer: I.W. Guo Lecture slides courtesy of J.R. Wishart Review The full nonlinear optimisation problem with equality constraints
More informationMEM 355 Performance Enhancement of Dynamical Systems
MEM 355 Performance Enhancement of Dynamical Systems State Space Design Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University 11/8/2016 Outline State space techniques emerged
More informationProblem 1 Convexity Property
THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS H O M E W O R K # 4 Hafez Bazrafshan October 1, 2015 To facilitate checking, questions are color-coded blue and pertinent
More informationStability lectures. Stability of Linear Systems. Stability of Linear Systems. Stability of Continuous Systems. EECE 571M/491M, Spring 2008 Lecture 5
EECE 571M/491M, Spring 2008 Lecture 5 Stability of Continuous Systems http://courses.ece.ubc.ca/491m moishi@ece.ubc.ca Dr. Meeko Oishi Electrical and Computer Engineering University of British Columbia,
More informationPole Placement (Bass Gura)
Definition: Open-Loop System: System dynamics with U =. sx = AX Closed-Loop System: System dynamics with U = -Kx X sx = (A BK x )X Characteristic Polynomial: Pole Placement (Bass Gura) a) The polynomial
More informationLecture Notes DISC Course on. Linear Matrix Inequalities in Control. Carsten Scherer and Siep Weiland
Lecture Notes DISC Course on Linear Matrix Inequalities in Control Carsten Scherer and Siep Weiland Version 2.: April, 1999 2 Preface Objectives In recent years linear matrix inequalities LMI s have emerged
More informationTutorial on Convex Optimization: Part II
Tutorial on Convex Optimization: Part II Dr. Khaled Ardah Communications Research Laboratory TU Ilmenau Dec. 18, 2018 Outline Convex Optimization Review Lagrangian Duality Applications Optimal Power Allocation
More information