# Kalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and

Size: px
Start display at page:

Download "Kalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and"

Transcription

1 Kalman Decomposition Controllable / uncontrollable decomposition Suppose that the controllability matrix C R n n of a system has rank n 1 <n. Then there exists an invertible transformation, T R n n such that: z = T 1 x, (Ã11 Ã ż = 12 z + Ã 22 ( B where B = T, and A = T T 1. Ã 22 (Ã11 Ã 12 ( B u (7 Observable / unobservable decomposition Hence if the observability matrix is not full rank, then using basis for its null space as the last k basis vectors of R n, the system can be represented as: where C = ( C ( (Ã11 B1 ż = z + u Ã 21 Ã 22 B 2 y = ( C z T 1, and A = T T 1. Ã 22 (Ã11 Ã 12 and the dim of Ã22 is non-zero (and is the dim of the null space of the observability matrix. and the dim of Ã22 is n n 1. M.E. University of Minnesota 64 M.E. University of Minnesota 65

2 Theorem There exists a coordinate transformation z = T 1 x R n such that Ã 11 Ã 13 B 1 Ã ż = 21 Ã 22 A 23 A 24 Ã 33 z + B 2 u Ã 43 Ã 44 y = ( C1 C2 z Let T = ( t 1 t 2 t 3 t 4 (with compatible block sizes, then t 2 (C Ō: t 2 = basis for Range(C Null(O. t 1 (C O: t 1 t 2 = basis for Range(C t 4 ( C Ō: t 2 t 4 = basis for Null(O. t 3 ( C O: t 1 t 2 t 3 t 4 = basis for R n. Note: Onlyt 2 is uniquely defined. Stabilizability and Detectability If the uncontrollable modes Ā33, Ā 44 are stable (have eigenvalues on the Left Half Plane, then, system is called stabilizable. One can use feedback to make the system stable; Uncontrollable modes decay, so not an issue. If the unobservable modes Ā22, Ā 44 are stable (have eigenvalues on the Left Half Plane, then, system is called detectable. The states z 2, z 4 decay to Eventually, they will have no effect on the output State can be reconstructed by ignoring the unobservable states (eventually. M.E. University of Minnesota 66 M.E. University of Minnesota 67

3 Relation to Transfer Function Poles For the system they are values of s C s.t. G(s becomes infinite. ẋ = Ax + Bu y = Cx + Du The transfer function from U(s Y (s is given by: G(s =C(sI A 1 B + D = Cadj(sI AB det(si A + D. Note that transfer function is not affected by similarity transform. From Kalman decomposition, it is obvious that G(s = C 1 (si Ã11 1 B1 + D where Ã11, B1, C1 correspond to the controllable and observable component. poles of G(s are clearly the eigenvalues of Ã11. Zeros For the SISO case, z C(complex numbers is a zero if it makes G(z =. Thus, zeros satisfy Cadj(zI AB + Ddet(zI A = assuming system is controllable and observable, otherwise, need to apply Kalman decomposition first. In the general MIMO case, a zero implies that there can be non-zero inputs U(s that produce output Y (s the is identically zero. Therefore, there exists X(z, U(z such that: zi AX(z =BU(z =CX(z+DU(z M.E. University of Minnesota 68 M.E. University of Minnesota 69

4 This will be true if and only if at s = z ( si A B rank C D is less than the normal rank of the matrix at other s. We shall return to the multivariable zeros when we discuss the effect of state feedback on the zero of the system. Pole-zero cancellation Cascade system with input/output (u 1,y 2 : System 1 with input/output (u 1,y 1 has a zero at α and a pole at β. ẋ 1 = A 1 x 1 + B 1 u 1 y 1 = C 1 x 1 System 2 with input/output (u 2,y 2 has a pole at α and a zero at β. ẋ 2 = A 2 x 2 + B 2 u 2 y 2 = C 2 x 2 Cascade interconnection: u 2 = y 2. Then 1. The system pole at β is not observable from y 2 2. The system pole at α is not controllable from u 1. M.E. University of Minnesota 7 M.E. University of Minnesota 71

5 The cascade system is given by: A = ( A1 ; B = B 2 C 1 A 2 Consider x = ( x1 x 2. ( B1 ; C = ( C 2 Use PBH test with λ = β. Does there exist x 1 and x 2 s.t. βi A 1 B 2 C 1 βi A 2 ( x1 =??? x C 2 2 Let x 1 be eigenvector associated with β for A 1. and β is a zero of system 2, PHB test shows that the mode β is not observable. Similar case for α mode in system 2 not controllable by u: PHB test for controllability for α mode: ( ( x T 1 x T αi A 1 B 1 2 = (??? B 2 C 1 αi A 2 Let x T 2 be the left eigenvector of A 1 s.t. x T 2 A 1 = αx T 2 Solve for x T 1 in the 1st column: x T 1 (αi A 1 =x T 2 B 2 C 1 x T 1 = x T 2 B 2 C 1 (αi A 1 1 Let x 2 =(βi A 2 1 B 2 C 2 x 1 (i.e. row in PBH test. Then since solve second With this choice of x 1 and x 2, x T 1 B 1 = x T 2 B 2 C 1 (αi A 1 1 B }{{} 1 = G 1 (s=α= Cx = C 2 x 2 =(C 2 (βi A 2 1 B 2 C }{{} 2 x 1 G 2 (s=β= Thus, by the PHB test, the α mode is not controllable. DO NOT CANCEL OUT UNSTABLE MODES!!! M.E. University of Minnesota 72 M.E. University of Minnesota 73

6 Degree of controllability / observability Formal definitions are black and white. Similarly, if A is stable, as T, =A T W o + W o A + C T C Degree of controllability and observability can be evaluated by the size of W r and W o with infinite time horizon: W r (, = lim = T W o (, = lim T T e A(T τ BB T e AT (T τ dτ e At BB T e AT t dt T e AT τ C T Ce Aτ dτ W r satisfies differential equation: d dt W r(,t=aw r (,t+w r (,ta T + BB T If all eigenvalues of A have strictly negative real parts (i.e. A is stable, then, as T, =AW r + W r A T + BB T Minimum norm control: To reach x( = x from x( =in infinite time, u = L T r W 1 c x min u( J(u =min u( u T (τu(τdτ = x T W 1 r x. If state x is difficult to reach, then x T Wr 1 x is large practically uncontrollable. Signal in an initial state, if x( = x, then, with u(τ y T (τy(τdτ = x T W o x. If x T W o x is small, the signal of x in the output y( is small, thus, it is hard to observe practically unobservable. M.E. University of Minnesota 74 M.E. University of Minnesota 75

7 Generally, one can look at the smallest eigenvalues W r and W o, the span of the associated eigenvectors will be difficult to control, or difficult to observe. Balanced Realization Reduce the number of states while minimizing effect on I/O response (transfer function State equations from distributed parameters system, P.D.E. via finite elements methods, etc. generate many states. If unobservable and uncontrollable remove. What about lightly controllable, lightly observable states? Issues: States can be lightly controllable, observable. but heavily States can be lightly observable, but heavily controllable. Both contribute to significant component to input/output (transfer function response. M.E. University of Minnesota 76 M.E. University of Minnesota 77

8 Idea: Exhibit states so that they are simultaneously lightly (heavily controllable and observable. Consider a stable system: ẋ = Ax + Bu y = Cx + Du If A is stable, controllability and observability grammians can be computed by solving the Lyapunov equations: =AW c + W c A T + BB T =A T W o + W o A + C T C If state x is difficult to reach, then x T Wc 1 x is large practically uncontrollable. If x T W o x is small, the signal of x in the output y( is small, thus, it is hard to observe practically unobservable. Generally, one can look at the smallest eigenvalues W c and W o, the span of the associated eigenvectors will be difficult to control, or difficult to observe. Transformation of grammians: (beware of which side T goes!: z = Tx Minimum norm control should be invariant to coordinate transformation: Therefore x T Wc 1 x = z T Wc,z 1 z = x T T T Wc,z 1 Tx W 1 c = T T W 1 c,z T W c,z = T W c T T. Similarly, the energy in a state transmitted to output should be invariant: x T W o x = zw o,z z W o,z = T T W o T 1. Theorem: (Balanced realization If the linear time invariant system is controllable and observerable, then, there exists an invertible transformation T R n n s.t. W o,z = W c,z. M.E. University of Minnesota 78 M.E. University of Minnesota 79

9 The balanced realization algorithm: 5. This gives W r,z = W o,z =Σ. 1. Compute controllability (reachability and observability grammians: >> W r = gram(sys, c ; >> W o = gram(sys, o 2. Write W o = R T R [One can use SVD] >> [U,S,V]=svd(W o ; >> R = sqrtm(s*v ; 3. Diagonalize RW r R T [via SVD again]: RW r R T = UΣ 2 U T, where UU T = I and Σ is diagonal. >> [U 1,S 1,V 1 ]=svd(r*w r *R ; >> Σ = sqrtm(s 1 ; 4. Take T =Σ 1 2U T R >> T = inv(sqrtm(σ*u 1 *R; >> W r,z = T W r T, >> W o,z = inv(t W o inv(t Proof: Direct substitution! Once W r,z and W o,z are diagonal, and equal, one can decide to eliminate states that correspond to the smallest few entries. Do not remove unstsable states from the realization since these states need to be controlled (stabilized It is also possible to maintain some D.C. performance. Consider the system in the balanced realization form: ( ( ( ( d z1 A11 A = 12 z1 B1 + u dt z 2 A 21 A 22 z 2 B 2 y = C 1 z 2 + C 2 z 2 + Du where z 1 R n 1 and z 2 R n 2, and n 1 + n 2 = n. Suppose that the z 1 are associated with M.E. University of Minnesota 8 M.E. University of Minnesota 81

10 the simultaneously lightly controllable and lightly observable mode. Naive trunction - Remove z 2 : ż 1 = A 11 z 1 + B 1 u y = C 1 z 1 + Du However, this does not retain the D.C. (steady state gain from u to y (which is important from a regulation application point of view. To maintain the steady state response, instead of eliminating z 2 completely, replace z 2 by its steady state value: In steady state: ż 2 ==A 21 z 1 + A 22 z2 + B 2 u z2 = A 1 22 (A 21z 1 + B 2 u Truncation that maintains steady state gain: ż 1 = A 11 z 1 + A 12 z2 + B 1 u y = C 1 z 1 + C 2 z2 + Du ż 1 = [ A 11 A 12 A 1 22 A ] 21 }{{} A r + [ B1 A 12 A 1 22 B ] 2 u }{{} y = [ C 1 C 2 A 1 22 A ] [ 21 z }{{} 1 + D C2 A 1 22 B ] 2 u }{{} C r D r So that the truncated system z 1 R n 1, ż 1 = A r z 1 + B r u y = C r z 1 + D r u with have the same steady state response as the original system. B r This is feasible if A 22 eigenvalue. is invertible ( is not an M.E. University of Minnesota 82 M.E. University of Minnesota 83

### Controllability, Observability, Full State Feedback, Observer Based Control

Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time

### Linear System Theory

Linear System Theory Wonhee Kim Chapter 6: Controllability & Observability Chapter 7: Minimal Realizations May 2, 217 1 / 31 Recap State space equation Linear Algebra Solutions of LTI and LTV system Stability

### ME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ

ME 234, Lyapunov and Riccati Problems. This problem is to recall some facts and formulae you already know. (a) Let A and B be matrices of appropriate dimension. Show that (A, B) is controllable if and

### Multivariable Control. Lecture 03. Description of Linear Time Invariant Systems. John T. Wen. September 7, 2006

Multivariable Control Lecture 3 Description of Linear Time Invariant Systems John T. Wen September 7, 26 Outline Mathematical description of LTI Systems Ref: 3.1-3.4 of text September 7, 26Copyrighted

### Balanced Truncation 1

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI

### 16.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

### ẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)

EEE582 Topical Outline A.A. Rodriguez Fall 2007 GWC 352, 965-3712 The following represents a detailed topical outline of the course. It attempts to highlight most of the key concepts to be covered and

### 1 Continuous-time Systems

Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.4: Dynamic Systems Spring Homework Solutions Exercise 3. a) We are given the single input LTI system: [

### Robust Control 2 Controllability, Observability & Transfer Functions

Robust Control 2 Controllability, Observability & Transfer Functions Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University /26/24 Outline Reachable Controllability Distinguishable

### CDS Solutions to the Midterm Exam

CDS 22 - Solutions to the Midterm Exam Instructor: Danielle C. Tarraf November 6, 27 Problem (a) Recall that the H norm of a transfer function is time-delay invariant. Hence: ( ) Ĝ(s) = s + a = sup /2

### Problem 2 (Gaussian Elimination, Fundamental Spaces, Least Squares, Minimum Norm) Consider the following linear algebraic system of equations:

EEE58 Exam, Fall 6 AA Rodriguez Rules: Closed notes/books, No calculators permitted, open minds GWC 35, 965-37 Problem (Dynamic Augmentation: State Space Representation) Consider a dynamical system consisting

### Control Systems. Laplace domain analysis

Control Systems Laplace domain analysis L. Lanari outline introduce the Laplace unilateral transform define its properties show its advantages in turning ODEs to algebraic equations define an Input/Output

### Perspective. ECE 3640 Lecture 11 State-Space Analysis. To learn about state-space analysis for continuous and discrete-time. Objective: systems

ECE 3640 Lecture State-Space Analysis Objective: systems To learn about state-space analysis for continuous and discrete-time Perspective Transfer functions provide only an input/output perspective of

### Topic # Feedback Control

Topic #11 16.31 Feedback Control State-Space Systems State-space model features Observability Controllability Minimal Realizations Copyright 21 by Jonathan How. 1 Fall 21 16.31 11 1 State-Space Model Features

### Lecture 3. Chapter 4: Elements of Linear System Theory. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.

Lecture 3 Chapter 4: Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 3 p. 1/77 3.1 System Descriptions [4.1] Let f(u) be a liner operator, u 1 and u

### ME Fall 2001, Fall 2002, Spring I/O Stability. Preliminaries: Vector and function norms

I/O Stability Preliminaries: Vector and function norms 1. Sup norms are used for vectors for simplicity: x = max i x i. Other norms are also okay 2. Induced matrix norms: let A R n n, (i stands for induced)

### Grammians. Matthew M. Peet. Lecture 20: Grammians. Illinois Institute of Technology

Grammians Matthew M. Peet Illinois Institute of Technology Lecture 2: Grammians Lyapunov Equations Proposition 1. Suppose A is Hurwitz and Q is a square matrix. Then X = e AT s Qe As ds is the unique solution

### Control Systems. Frequency domain analysis. L. Lanari

Control Systems m i l e r p r a in r e v y n is o Frequency domain analysis L. Lanari outline introduce the Laplace unilateral transform define its properties show its advantages in turning ODEs to algebraic

### SYSTEMTEORI - Ö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

### Observability and state estimation

EE263 Autumn 2015 S Boyd and S Lall Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time observability

### 3 Gramians and Balanced Realizations

3 Gramians and Balanced Realizations In this lecture, we use an optimization approach to find suitable realizations for truncation and singular perturbation of G. It turns out that the recommended realizations

### Control Systems Design, SC4026. SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft

Control Systems Design, SC4026 SC4026 Fall 2010, dr. A. Abate, DCSC, TU Delft Lecture 4 Controllability (a.k.a. Reachability) and Observability Algebraic Tests (Kalman rank condition & Hautus test) A few

### ECEEN 5448 Fall 2011 Homework #4 Solutions

ECEEN 5448 Fall 2 Homework #4 Solutions Professor David G. Meyer Novemeber 29, 2. The state-space realization is A = [ [ ; b = ; c = [ which describes, of course, a free mass (in normalized units) with

### Linear dynamical systems with inputs & outputs

EE263 Autumn 215 S. Boyd and S. Lall Linear dynamical systems with inputs & outputs inputs & outputs: interpretations transfer function impulse and step responses examples 1 Inputs & outputs recall continuous-time

### Contents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31

Contents Preamble xiii Linear Systems I Basic Concepts 1 I System Representation 3 1 State-Space Linear Systems 5 1.1 State-Space Linear Systems 5 1.2 Block Diagrams 7 1.3 Exercises 11 2 Linearization

### Zeros and zero dynamics

CHAPTER 4 Zeros and zero dynamics 41 Zero dynamics for SISO systems Consider a linear system defined by a strictly proper scalar transfer function that does not have any common zero and pole: g(s) =α p(s)

### CONTROL 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

### Intro. Computer Control Systems: F8

Intro. Computer Control Systems: F8 Properties of state-space descriptions and feedback Dave Zachariah Dept. Information Technology, Div. Systems and Control 1 / 22 dave.zachariah@it.uu.se F7: Quiz! 2

### POLE 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

### Control Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli

Control Systems I Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 13, 2017 E. Frazzoli (ETH)

### CME 345: MODEL REDUCTION

CME 345: MODEL REDUCTION Balanced Truncation Charbel Farhat & David Amsallem Stanford University cfarhat@stanford.edu These slides are based on the recommended textbook: A.C. Antoulas, Approximation of

### EEE582 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

### CDS Solutions to Final Exam

CDS 22 - Solutions to Final Exam Instructor: Danielle C Tarraf Fall 27 Problem (a) We will compute the H 2 norm of G using state-space methods (see Section 26 in DFT) We begin by finding a minimal state-space

### Automatic Control 2. Model reduction. Prof. Alberto Bemporad. University of Trento. Academic year

Lecture: Automatic Control 2 Prof. Alberto Bemporad University of Trento Academic year 2010-2011 Prof. Alberto Bemporad (University of Trento) Automatic Control 2 Academic year 2010-2011 1 / 17 Lecture:

### 5. Observer-based Controller Design

EE635 - Control System Theory 5. Observer-based Controller Design Jitkomut Songsiri state feedback pole-placement design regulation and tracking state observer feedback observer design LQR and LQG 5-1

### (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =

. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)

### Control Systems Design, SC4026. SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft

Control Systems Design, SC4026 SC4026 Fall 2009, dr. A. Abate, DCSC, TU Delft Lecture 4 Controllability (a.k.a. Reachability) vs Observability Algebraic Tests (Kalman rank condition & Hautus test) A few

### EE221A 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,

### Semidefinite 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,

### Lecture 19 Observability and state estimation

EE263 Autumn 2007-08 Stephen Boyd Lecture 19 Observability and state estimation state estimation discrete-time observability observability controllability duality observers for noiseless case continuous-time

### FEL3210 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

### Observability. It was the property in Lyapunov stability which allowed us to resolve that

Observability We have seen observability twice already It was the property which permitted us to retrieve the initial state from the initial data {u(0),y(0),u(1),y(1),...,u(n 1),y(n 1)} It was the property

### Lecture 4 and 5 Controllability and Observability: Kalman decompositions

1 Lecture 4 and 5 Controllability and Observability: Kalman decompositions Spring 2013 - EE 194, Advanced Control (Prof. Khan) January 30 (Wed.) and Feb. 04 (Mon.), 2013 I. OBSERVABILITY OF DT LTI SYSTEMS

### Lecture 7 (Weeks 13-14)

Lecture 7 (Weeks 13-14) Introduction to Multivariable Control (SP - Chapters 3 & 4) Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 7 (Weeks 13-14) p.

### Control Systems Design

ELEC4410 Control Systems Design Lecture 14: Controllability Julio H. Braslavsky julio@ee.newcastle.edu.au School of Electrical Engineering and Computer Science Lecture 14: Controllability p.1/23 Outline

### MEM 355 Performance Enhancement of Dynamical Systems MIMO Introduction

MEM 355 Performance Enhancement of Dynamical Systems MIMO Introduction Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University 11/2/214 Outline Solving State Equations Variation

### Chapter 30 Minimality and Stability of Interconnected Systems 30.1 Introduction: Relating I/O and State-Space Properties We have already seen in Chapt

Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter

### MULTIVARIABLE ZEROS OF STATE-SPACE SYSTEMS

Copyright F.L. Lewis All rights reserved Updated: Monday, September 9, 8 MULIVARIABLE ZEROS OF SAE-SPACE SYSEMS If a system has more than one input or output, it is called multi-input/multi-output (MIMO)

### Model reduction for linear systems by balancing

Model reduction for linear systems by balancing Bart Besselink Jan C. Willems Center for Systems and Control Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, Groningen,

### Lec 6: State Feedback, Controllability, Integral Action

Lec 6: State Feedback, Controllability, Integral Action November 22, 2017 Lund University, Department of Automatic Control Controllability and Observability Example of Kalman decomposition 1 s 1 x 10 x

### ECE 388 Automatic Control

Controllability and State Feedback Control Associate Prof. Dr. of Mechatronics Engineeering Çankaya University Compulsory Course in Electronic and Communication Engineering Credits (2/2/3) Course Webpage:

### João P. Hespanha. January 16, 2009

LINEAR SYSTEMS THEORY João P. Hespanha January 16, 2009 Disclaimer: This is a draft and probably contains a few typos. Comments and information about typos are welcome. Please contact the author at hespanha@ece.ucsb.edu.

### 6.241 Dynamic Systems and Control

6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May

### Denis 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

### Module 03 Linear Systems Theory: Necessary Background

Module 03 Linear Systems Theory: Necessary Background Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September

### Fall 線性系統 Linear Systems. Chapter 08 State Feedback & State Estimators (SISO) Feng-Li Lian. NTU-EE Sep07 Jan08

Fall 2007 線性系統 Linear Systems Chapter 08 State Feedback & State Estimators (SISO) Feng-Li Lian NTU-EE Sep07 Jan08 Materials used in these lecture notes are adopted from Linear System Theory & Design, 3rd.

### Robust Multivariable Control

Lecture 2 Anders Helmersson anders.helmersson@liu.se ISY/Reglerteknik Linköpings universitet Today s topics Today s topics Norms Today s topics Norms Representation of dynamic systems Today s topics Norms

### ECE557 Systems Control

ECE557 Systems Control Bruce Francis Course notes, Version.0, September 008 Preface This is the second Engineering Science course on control. It assumes ECE56 as a prerequisite. If you didn t take ECE56,

### The disturbance decoupling problem (DDP)

CHAPTER 3 The disturbance decoupling problem (DDP) Consider the system 3.1. Geometric formulation { ẋ = Ax + Bu + Ew y = Cx. Problem 3.1 (Disturbance decoupling). Find a state feedback u = Fx+ v such that

### Controllability. Chapter Reachable States. This chapter develops the fundamental results about controllability and pole assignment.

Chapter Controllability This chapter develops the fundamental results about controllability and pole assignment Reachable States We study the linear system ẋ = Ax + Bu, t, where x(t) R n and u(t) R m Thus

### Solution of Linear State-space Systems

Solution of Linear State-space Systems Homogeneous (u=0) LTV systems first Theorem (Peano-Baker series) The unique solution to x(t) = (t, )x 0 where The matrix function is given by is called the state

### Control Systems I. Lecture 7: Feedback and the Root Locus method. Readings: Jacopo Tani. Institute for Dynamic Systems and Control D-MAVT ETH Zürich

Control Systems I Lecture 7: Feedback and the Root Locus method Readings: Jacopo Tani Institute for Dynamic Systems and Control D-MAVT ETH Zürich November 2, 2018 J. Tani, E. Frazzoli (ETH) Lecture 7:

### Discrete and continuous dynamic systems

Discrete and continuous dynamic systems Bounded input bounded output (BIBO) and asymptotic stability Continuous and discrete time linear time-invariant systems Katalin Hangos University of Pannonia Faculty

### Module 07 Controllability and Controller Design of Dynamical LTI Systems

Module 07 Controllability and Controller Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha October

### 6.241 Dynamic Systems and Control

6.241 Dynamic Systems and Control Lecture 12: I/O Stability Readings: DDV, Chapters 15, 16 Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology March 14, 2011 E. Frazzoli

### Introduction to Modern Control MT 2016

CDT Autonomous and Intelligent Machines & Systems Introduction to Modern Control MT 2016 Alessandro Abate Lecture 2 First-order ordinary differential equations (ODE) Solution of a linear ODE Hints to nonlinear

### (a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.

1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III

### Module 08 Observability and State Estimator Design of Dynamical LTI Systems

Module 08 Observability and State Estimator Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha November

### Control Systems I. Lecture 6: Poles and Zeros. Readings: Emilio Frazzoli. Institute for Dynamic Systems and Control D-MAVT ETH Zürich

Control Systems I Lecture 6: Poles and Zeros Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 27, 2017 E. Frazzoli (ETH) Lecture 6: Control Systems I 27/10/2017

### ECEEN 5448 Fall 2011 Homework #5 Solutions

ECEEN 5448 Fall 211 Homework #5 Solutions Professor David G. Meyer December 8, 211 1. Consider the 1-dimensional time-varying linear system ẋ t (u x) (a) Find the state-transition matrix, Φ(t, τ). Here

### TRACKING AND DISTURBANCE REJECTION

TRACKING AND DISTURBANCE REJECTION Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 13 General objective: The output to track a reference

### Introduction to MVC. least common denominator of all non-identical-zero minors of all order of G(s). Example: The minor of order 2: 1 2 ( s 1)

Introduction to MVC Definition---Proerness and strictly roerness A system G(s) is roer if all its elements { gij ( s)} are roer, and strictly roer if all its elements are strictly roer. Definition---Causal

### 1. 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 +

### MCE693/793: Analysis and Control of Nonlinear Systems

MCE693/793: Analysis and Control of Nonlinear Systems Input-Output and Input-State Linearization Zero Dynamics of Nonlinear Systems Hanz Richter Mechanical Engineering Department Cleveland State University

### Output Feedback and State Feedback. EL2620 Nonlinear Control. Nonlinear Observers. Nonlinear Controllers. ẋ = f(x,u), y = h(x)

Output Feedback and State Feedback EL2620 Nonlinear Control Lecture 10 Exact feedback linearization Input-output linearization Lyapunov-based control design methods ẋ = f(x,u) y = h(x) Output feedback:

### The norms can also be characterized in terms of Riccati inequalities.

9 Analysis of stability and H norms Consider the causal, linear, time-invariant system ẋ(t = Ax(t + Bu(t y(t = Cx(t Denote the transfer function G(s := C (si A 1 B. Theorem 85 The following statements

### Linear Systems. Chapter Basic Definitions

Chapter 5 Linear Systems Few physical elements display truly linear characteristics. For example the relation between force on a spring and displacement of the spring is always nonlinear to some degree.

### Full State Feedback for State Space Approach

Full State Feedback for State Space Approach State Space Equations Using Cramer s rule it can be shown that the characteristic equation of the system is : det[ si A] 0 Roots (for s) of the resulting polynomial

### Lecture Note #6 (Chap.10)

System Modeling and Identification Lecture Note #6 (Chap.) CBE 7 Korea University Prof. Dae Ryoo Yang Chap. Model Approximation Model approximation Simplification, approximation and order reduction of

### EL 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

### Modelling and Control of Dynamic Systems. Stability of Linear Systems. Sven Laur University of Tartu

Modelling and Control of Dynamic Systems Stability of Linear Systems Sven Laur University of Tartu Motivating Example Naive open-loop control r[k] Controller Ĉ[z] u[k] ε 1 [k] System Ĝ[z] y[k] ε 2 [k]

### 1 Controllability and Observability

1 Controllability and Observability 1.1 Linear Time-Invariant (LTI) Systems State-space: Dimensions: Notation Transfer function: ẋ = Ax+Bu, x() = x, y = Cx+Du. x R n, u R m, y R p. Note that H(s) is always

### Observability. Dynamic Systems. Lecture 2 Observability. Observability, continuous time: Observability, discrete time: = h (2) (x, u, u)

Observability Dynamic Systems Lecture 2 Observability Continuous time model: Discrete time model: ẋ(t) = f (x(t), u(t)), y(t) = h(x(t), u(t)) x(t + 1) = f (x(t), u(t)), y(t) = h(x(t)) Reglerteknik, ISY,

### Some solutions of the written exam of January 27th, 2014

TEORIA DEI SISTEMI Systems Theory) Prof. C. Manes, Prof. A. Germani Some solutions of the written exam of January 7th, 0 Problem. Consider a feedback control system with unit feedback gain, with the following

### Maths for Signals and Systems Linear Algebra in Engineering

Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 15, Tuesday 8 th and Friday 11 th November 016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE

### SYSTEMTEORI - ÖVNING Stability of linear systems Exercise 3.1 (LTI system). Consider the following matrix:

SYSTEMTEORI - ÖVNING 3 1. Stability of linear systems Exercise 3.1 (LTI system. Consider the following matrix: ( A = 2 1 Use the Lyapunov method to determine if A is a stability matrix: a: in continuous

### Intro. 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

### Lecture 2: Discrete-time Linear Quadratic Optimal Control

ME 33, U Berkeley, Spring 04 Xu hen Lecture : Discrete-time Linear Quadratic Optimal ontrol Big picture Example onvergence of finite-time LQ solutions Big picture previously: dynamic programming and finite-horizon

### Observability and Constructability

Capitolo. INTRODUCTION 5. Observability and Constructability Observability problem: compute the initial state x(t ) using the information associated to the input and output functions u(t) and y(t) of the

### Lifted approach to ILC/Repetitive Control

Lifted approach to ILC/Repetitive Control Okko H. Bosgra Maarten Steinbuch TUD Delft Centre for Systems and Control TU/e Control System Technology Dutch Institute of Systems and Control DISC winter semester

### Problem Set 4 Solution 1

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Problem Set 4 Solution Problem 4. For the SISO feedback

### Multivariable Control. Lecture 05. Multivariable Poles and Zeros. John T. Wen. September 14, 2006

Multivariable Control Lecture 05 Multivariable Poles and Zeros John T. Wen September 4, 2006 SISO poles/zeros SISO transfer function: G(s) = n(s) d(s) (no common factors between n(s) and d(s)). Poles:

### Model Reduction for Linear Dynamical Systems

Summer School on Numerical Linear Algebra for Dynamical and High-Dimensional Problems Trogir, October 10 15, 2011 Model Reduction for Linear Dynamical Systems Peter Benner Max Planck Institute for Dynamics

### Introduction to Geometric Control

Introduction to Geometric Control Relative Degree Consider the square (no of inputs = no of outputs = p) affine control system ẋ = f(x) + g(x)u = f(x) + [ g (x),, g p (x) ] u () h (x) y = h(x) = (2) h

### EE Control Systems LECTURE 9

Updated: Sunday, February, 999 EE - Control Systems LECTURE 9 Copyright FL Lewis 998 All rights reserved STABILITY OF LINEAR SYSTEMS We discuss the stability of input/output systems and of state-space

### Lecture 4: Analysis of MIMO Systems

Lecture 4: Analysis of MIMO Systems Norms The concept of norm will be extremely useful for evaluating signals and systems quantitatively during this course In the following, we will present vector norms

### C&O367: Nonlinear Optimization (Winter 2013) Assignment 4 H. Wolkowicz

C&O367: Nonlinear Optimization (Winter 013) Assignment 4 H. Wolkowicz Posted Mon, Feb. 8 Due: Thursday, Feb. 8 10:00AM (before class), 1 Matrices 1.1 Positive Definite Matrices 1. Let A S n, i.e., let