OBSERVABILITY AND CONTROLLABILITY
|
|
- Barry Newman
- 6 years ago
- Views:
Transcription
1 ECE45/55: Multivariable Control Systems I. 5 OBSERVABILITY AND CONTROLLABILITY 5.: Continuous-time observability: Where am I? We describe dual ideas called observability and controllability. Both have precise (binary) mathematical descriptions, but we need to be careful in interpreting the result. We develop some other techniques to help quantify the concepts. Continuous-time observability If a system is observable, we can determine the initial condition of the state vector x./ via processing the input to the system u.t/ and the output of the system y.t/. Since we can simulate the system if we know x./ and u.t/ this also implies that we can determine x.t/ for t. e.g.,forlti, x.t/ D e At x./ C Z t e A.t / Bu./d: Consider the LTI SISO system LCCODE «y.t/ C a Ry.t/ C a Py.t/ C a 3 y.t/ D b «u.t/ C b Ru.t/ C b Pu.t/ C b 3 u.t/: If we have a realization of this system in state-space form Px.t/ D Ax.t/ C Bu.t/ y.t/ D Cx.t/C Du.t/; Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
2 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 and we have initial conditions y./, Py./, Ry./,howdowefindx./? In general, or, y./ D Cx./C Du./ Py./ D C.Ax./ C Bu./ / C D Pu./ ƒ Px./ D CAx./ C CBu./ C D Pu./ Ry./ D CA x./ C CABu./ C CB Pu./ C D Ru./: y.k/./ D CA k x./ C CA k Bu./ CCCBu.k /./ C Du.k/./; 4 y./ Py./ Ry./ 3 5 D 4 C CA CA ƒ O.C;A/ where T is a (block) Toeplitz matrix D u./ 5 x./ C 4 CB D 5 4 Pu./ CAB CB D Ru./ ƒ T Thus, if O.C; A/ is invertible, then ˆ< y./ u./ >= x./ D O 4 Py./ 5 T 4 Pu./ 5 ˆ: >; : Ry./ Ru./ We say that fc;ag is an observable pair if O is nonsingular. CONCLUSION: For a SISO system, if O is nonsingular, then we can determine/estimate the initial state of the system x./ using only u.t/ and y.t/ (and therefore, we can estimate x.t/ for all t ). EXTENSION: For a MIMO system, if O is full rank, then we can determine/estimate the initial state of the system x./ using only u.t/ and y.t/ (and therefore, we can estimate x.t/ for all t ). Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett 5 ;
3 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 3 EXAMPLE: Observability canonical form: 3 Px.t/ D 4 5 x.t/ C 4 ˇ ˇ 3 5 u.t/ y.t/ D h a 3 a a i x.t/: ˇ3 Then O D 4 C CA CA 3 5 D 4 : :: 3 5 D I n : This is why it is called observability form! EXAMPLE: Two unobservable networks u x y u H x x F y H x (Redrawn) x F y In the first, if u.t/ D then y.t/ D 8 t. Cannotdeterminex./. In the second, if u.t/ D, x./ and x./ D, theny.t/ D and we cannot determine x./. [circuitredrawnforu.t/ D ]. Observers An observer is a device that has as inputs u.t/ and y.t/ the input and output of a linear system. The output of the observer is the (estimated) state of the linear system. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
4 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 4 The observer observes the internal state x (estimated as Ox) from external signals u and y. u.t/ Note that our equations yield an observer: A; B; C; D x Observer y.t/ Ox u.t/ A; B; C; D x y.t/ s s u Pu Ru T y Py Ry s s O Ox Later, we ll design more practical observers that don t use differentiators. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
5 ECE45/55, OBSERVABILITY AND CONTROLLABILITY : Continuous-time controllability: Can I get there from here? Can we generate an input u.t/ to set an initial condition quickly? If u.t/ D ı.t/ and x. / D, then Px.t/ D Ax.t/ C Bu.t/ y.t/ D Cx.t/C Du.t/: X.s/ D.sI A/ BU.s/ D.sI A/ B: So, via the Laplace initial-value theorem, x. C / D lim s! sx.s/ D lim s.si A/ B s! D lim I A B s! s D B: Thus, an impulse input brings the state to B from. What if u.t/ D ı.k/.t/? Then X.s/ D.sI A/ Bs k D I A Bs k s s D As A I C C s s C ::: Bs k ƒ holds for large s D Bs k C ABs k C A Bs k 3 CC Ak B s C AkC B s The first terms are impulsive: they have zero value for t>. C Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
6 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 Thus, A x. C k B / D lim s s! s D A k B: So, if u.t/ D ı.k/.t/ then x. C / D A k B. Now, consider the input C AkC B s C u.t/ D g ı.t/ C g P ı.t/ Cgn ı.n/.t/: Since x. / D, x. C / D g B C g AB CCg n A n B,or 3 x. C / D B AB A n B 4 ƒ C where C is called the controllability matrix. CONCLUSION: For a SISO system, if C is nonsingular, then there is an impulsive input u such that x. C / is any desired vector if x. / D. EXTENSION: For a MIMO system, if C is full rank, then there is an impulsive input u such that x. C / is any desired vector if x. / D. In fact, we may use where 4 g g g 3 u.t/ D Xn id where x d is the desired x. C / vector. 3 g i ı.i/.t/ g g g 3 5 D B AB A n B xd 5 Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
7 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 If C is nonsingular, we say fa; Bg is a controllable pair and the system is controllable. EXAMPLE: Controllability canonical form: 3 a 3 Px.t/ D 4 a a h i y.t/ D x.t/: Then ˇ ˇ ˇ3 5 x.t/ C 4 C D ŒB AB A n B 3 D 4 : :: 5 D I n : This is why it is called controllability form! 3 5 u.t/ If a system is controllable, we can instantaneously move the state from any known state to any other state, using impulse-like inputs. Later, we ll see that smooth inputs can effect the state transfer (not instantaneously, though!). DUALITY: fa; B; C; Dg controllable fa T ;C T ;B T ;D T g observable. EXAMPLE: Two uncontrollable networks. u x y u F x F x Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
8 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 8 In the first one, if x./ D then x.t/ D 8 t. Cannotinfluencestate! In the second one, if x./ D x./ then x.t/ D x.t/ independently alter state. 8 t. Cannot Diagonal systems, controllability and observability Recall the diagonal form 3 3 Px.t/ D : 4 :: 5 x.t/ C 4 : 5 u.t/ n n h i h i y.t/ D ı ı ı n x.t/ C u.t/: R x.t/ ı u.t/ : y.t/ n R x n.t/ ı n n When controllable? When observable? 3 C ı ı ı n O D CA 4 : 5 D ı ı n ı n 4 ::: CA n n ı n ı n n ı n 3 5 Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
9 ECE45/55, OBSERVABILITY AND CONTROLLABILITY ı D n ı 4 ::: : 5 4 :: 5 : n n n n ı n ƒ Vandermonde matrix V Singular? detfog D.ı ın/ detfvg D.ı ın/ Y. j i /: CONCLUSION: Observable i j, i j and ı i id ; ;n. i<j s C x.t/ s C x.t/ u.t/ y.t/ u.t/ y.t/ s C x.t/ s C x.t/ If D then not observable. Can only observe the sum x C x. If ık D then cannot observe mode k. What about controllability? Use duality and switch ıs ands. CONCLUSION: Controllable i j, i j and i id ; ;n. s C x.t/ s C x.t/ u.t/ y.t/ u.t/ y.t/ s C x.t/ s C x.t/ If D then not controllable. Can only control the sum x C x. If k D then cannot control mode k. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
10 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 5.3: Discrete-time controllability and observability Discrete-time controllability Similar concept for discrete-time. Consider the problem of driving a system to some arbitrary state xœn xœk C D AxŒk C BuŒk xœ D AxŒ C BuŒ xœ D AŒAxŒ C BuŒ C BuŒ xœ3 D A A xœ C ABuŒ C BuŒ C BuŒ : 3 h i uœn xœn D A n xœ C B AB A B A n B 4 : 5 : ƒ C uœ Which leads to 4 uœn : uœ 3 5 D C ŒxŒn A n xœ : If C has no inverse (det.c/ D ; C is not full-rank) then these control signals don t exist. In that case, the input is only partially effective in influencing the state. If C is full-rank, then the input can move the system to any arbitrary state for any xœ. NOTE I: State transition is not instantaneous. Takes n time steps. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
11 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 NOTE II: In continuous-time, we used input u.t/ D g ı.t/ C g ı.t/ P C,a signal we could only approximate in practice. Here, the input isa perfectly good input signal. Discrete-time reachability In the literature, there are three different controllability definitions:. Transfer any state to any other state.. Transfer any state to zero, called controllability to the origin. 3. Transfer the zero state to any state, called controllability from the origin, orreachability. In continuous time, because e At is nonsingular, the three definitions are equivalent. In discrete time, if A is nonsingular, the three definitions are also equivalent. However, if A is singular, () and (3) are equivalent but not () and (3). EXAMPLE: xœk C D xœk C uœk : Its controllability matrix has rank and the equation is not controllable in () or (3). However, A k D for k 3 so xœ3 D A 3 xœ D for any initial state xœ and any input uœk. Thus, the system is controllable to the origin but not controllable from the origin or reachable. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
12 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 Definition () encompasses the other two definitions, so is used as our definition of controllable. Discrete-time observability Can we reconstruct the state xœ from the output yœk and input uœk? yœk D CxŒk C DuŒk yœ D CxŒ C DuŒ yœ D CŒAxŒ CBuŒ C DuŒ yœ D C A xœ C ABuŒ C BuŒ C DuŒ : yœn D C A n xœ C A n BuŒ CCBuŒn C DuŒn : In vector form, we can write yœ C D uœ yœ 4 : 5 D CA 4 : xœ C CB D uœ 5 4 CAB CB 5 4 : yœn CA n : : ::: D uœn ƒ ƒ O T So, 3 33 yœ uœ xœ D O 44 : 5 T 4 : 55 : yœn uœn If O is full-rank or nonsingular, xœ may be reconstructed with any yœk ; uœk. WesaythatfC;Ag form an observable pair. 3 5 : Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
13 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 3 Do more measurements of yœn ; yœn C ; : : : help in reconstructing xœ? No!(Caley Hamiltontheorem:nextsection). So, if the original state is not observable with n measurements, then it will not be observable with more than n measurements either. Since we know uœk and the dynamics of the system, if the system is observable we can determine the entire state sequence xœk, k once we determine xœ xœn D A n xœ C Xn id A n i BuŒk yœ uœ uœn D A n O 44 : 5 T 4 : 55 C C 4 : 5 : yœn uœn uœ Aperfectlygoodobserver(nodifferentiators...) Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
14 ECE45/55, OBSERVABILITY AND CONTROLLABILITY : Cayley Hamilton Theorem AsquarematrixA satisfies its own characteristic equation. That is, if./ D det.i A/ D then.a/ D : We can easily show this if A is diagonalizable. Let A D V ƒv: Then A D V ƒv V ƒv D V ƒ V A k D V ƒ k V: The characteristic polynomial is: so if we replace with A we get./ D n C a n n CCa.A/ D A n C a n A n CCa I D V ƒ n C a n ƒ n CCa I V: To prove the Cayley Hamilton theorem, we just need to show that the quantity inside the brackets is zero. It is adiagonalmatrix,andeachdiagonalelementhastheform because i is an eigenvalue of A. n i C a n n i CCa D Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
15 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 5 So, each diagonal element is zero, and we have shown the proof. If A is not diagonalizable, the same proof may be repeated using the Jordan form and Jordan blocks: A D T JT: Consider a sketch of the proof for a Jordan block of size and. i / D 3 i C a i C a i C a D : Then J i D.J i / D " " i i 3 i 3 i 3 i " C a i i i C a " i i C a " : We can easily see that the diagonal and lower-diagonal components are zero so where.j i / D " D 3 i C a i C a but D d./ D which completes the sketch. d SIGNIFICANCE: The Cayley Hamilton theorem shows us that A n is a function of matrix powers A n down to A.Therefore,tocomputeany polynomial of A it suffices to compute only powers of A up to A n and appropriately weight their sum. A lot of proofs use the Cayley Hamilton theorem. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
16 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 As we just saw with the section on discrete-time observability, the Cayley Hamilton theorem implies that if we cannot observe the state with n measurements, we cannot observe it with more measurements either. " EXAMPLE: With A D we have./ D det.i A/, so 3 4 "!./ D det A./ D 5.A/ D A 5A I " " D 5 5 " D : 3 4 " Disclaimer: Does observability/controllability matter, practically? The singularity of C has only one bit of information: Is the realization mathematically controllable or not? This may not tell the whole story. " " " A D ; B D ; C D C C fa; Bg are a controllable pair, but barely. EXAMPLE: Controlling an airplane. (Ideas only, no details). System state h x D 4 P i T P ; D Pitch; D Roll: Control with elevator? Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
17 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 " Px D 3 F x C F 4 5 ı e where ı e is the elevator angle. C is singular can t influence roll with elevators. Control with ailerons? Px D " F F x C ı a where ı a is the aileron angle. C is nonsingular! So, we can control both pitch AND roll with ailerons. THIS IS NONSENSE! Physicallythinkofthesystem!Doyouwantto roll plane over every time you need to pitch down? Physical intuition can be better than finding C. Other tools can help... Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
18 ECE45/55, OBSERVABILITY AND CONTROLLABILITY : Continuous-time Gramians Continuous-time controllability Gramian If a continuous-time system is controllable, then is nonsingular for t>. W c.t/ D Z t e A BB T e AT d SIGNIFICANCE: Consider x.t / D e At x./ C Z t e A.t / Bu./d: We claim that for any x./ D x and any x.t / D x the input u.t/ D B T e AT.t t/ Wc.t / e At x x will transfer x to x at time t. PROOF: Substitute the expression for u.t/ into the convolution expression: x.t / D e At x./ D e At x./ Z t Z t e A.t / BB T e AT.t / dwc.t / e At x x e AˇBB T e AT ˇ dˇ Wc.t / e At x x D e At x./ W c.t /Wc.t / e At x x D e At x./ e At x C x D x : Therefore, we can compute the input u.t/ required to transfer the state of the system from one state to another over an arbitrary interval of time. The solution is also the minimum-energy solution. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
19 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 9 EXAMPLE: Consider the system in diagonal form " " :5 :5 Px.t/ D x.t/ C u.t/: The controllability matrix is: C D " :5 :5 which has rank, sothesystemiscontrollable. Consider the input required to move the system state from x./ D Œ T to zero in two seconds. Z " " e :5 :5 h W c./ D e :5 " : :3 D ; :3 :498 and h u.t/ D :5 i " e :5. t/ e. t/ D 58:8e :5t C :9e t : W c./ " i " e :5 e e e If a continuous-time system is controllable, and if it is also stable,then W c D Z e A BB T e AT d can be found by solving for the unique (positive-definite) solution to the (Lyapunov) equation AW c C W c A T D BB T : W c is called the controllability Gramian. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett "! d
20 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 PROOF: We proved this identity when considering Lyapunov stability. Wc measures the minimum energy required to reach a desired point x starting at x./ D (with no limit on t) ( Z ) t min ku./k d x./ D ; x.t/ D x ˇ D x T W c x : In fact, for any specific t, the minimum energy is x T W c.t/x. If A is stable, W c >which implies we can t get anywhere for free. If A is unstable, then W c can have a nonzero nullspace Wc D for some which means that we can get to using u s with energy as small as you like! (u just gives a little kick to the state; the instability carries it out to efficiently). Wc may be a better indicator of controllability than C. Continuous-time observability Gramian If a system is observable, Wo.t/ is nonsingular for t>where W o.t/ D SIGNIFICANCE: We can prove that where Ny.t/ D y.t/ C Z t x./ D W o.t / Z t e AT C T Ce A d: Z t e AT t C T Ny.t/dt e A.t / Bu./d Du.t/ D Ce At x./: Therefore, we can determine the initial state x./ given a finite observation period (and not use differentiators!). Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
21 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 PROOF: We prove that the above equations are correct by substitution: W o.t / Z t e AT t C T Ny.t/dt D W o.t / Z t D Wo.t /W o.t /x./ D x./: e AT t C T Ce At dtx./ If a continuous-time system is observable, and if it is also stable, then W o D Z e AT C T Ce A d is the unique (positive-definite) solution to the (Lyapunov) equation A T W o C W o A D C T C: W o is called the observability Gramian. This relationship can be proven in the same way we proved the similar relationship for the controllability gramian. If measurement (sensor) noise is IID N.; I/ then W o is a measure of error covariance in measuring x./ from u and y over longer and longer periods lim E k Ox./ t! x./k D x./ T Wo x./: If A is stable, then W o >and we can t estimate the initial state perfectly even with an infinite number of measurements u.t/ and y.t/ for t (since memory of x./ fades). If A is not stable then W o can have a nonzero nullspace Wo x./ D which means that the covariance goes to zero as t!. Wo may be a better indicator of observability than O. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
22 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 5.: Discrete-time Gramians Discrete-time controllability Gramian In discrete-time, if a system is controllable, then W dc Œn D is nonsingular. In particular, W dc D Xn md A m BB T.A T / m X A m BB T.A T / m md is called the discrete-time controllability Gramian and is the unique positive-definite solution to the Lyapunov equation W dc AW dc A T D BB T : As with continuous-time, Wdc measures the minimum energy required to reach a desired point x starting at xœ D (with no limit on m) ( m ) X min kuœk k ˇˇˇˇˇ xœ D ; xœm D x D x T W dc x : kd ASIDE: When considering discrete-time stability, we showed that this form of equation is indeed a Lyapunov equation. Discrete-time observability Gramian In discrete-time, if a system is observable, then W do Œn D is nonsingular. In particular, Xn.A T / m CC T A m md Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
23 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 3 W do D X.A T / m CC T A m md is called the discrete-time observability Gramian and is the unique positive-definite solution to the Lyapunov equation W do A T W do A D C T C: As with continuous-time, if measurement (sensor) noise is IID N.; I / then W do is a measure of error covariance in measuring xœ from u and y over longer and longer periods lim E k OxŒ t! xœ k D xœ T Wdo xœ : Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
24 ECE45/55, OBSERVABILITY AND CONTROLLABILITY : Computing transformation matrices Transformation to controllability form Given a system Px.t/ D Ax.t/ C Bu.t/ y.t/ D Cx.t/C Du.t/; can we find a transformation (similarity) matrix T to transform this system into controllability form? Recall, this looks like: 3 3 a n Px co.t/ D : a n 4 : ::: : 5 x co.t/ C 4 : 5 u.t/ a h i y.t/ D x co.t/ C Du.t/: ˇ ˇ ˇn Note that Cco D I so it is controllable. Thus, our original system must be controllable. The transformation is accomplished via Thus x D Tx co : T AT D A co ; T B D B co CT D C co ; D D D co : Let s find T explicitly; let T D Œt ;:::;t n : Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
25 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 5 Note that B D TBco or 3 B D T 4 : 5 D t : So, t D B. FromAT D TA co we have AŒt ;:::;t n D Œt ;:::;t n 4 a n : a n : ::: : a 3 5 : So " nx ŒAt;:::Atn D t ;:::;t n ; a k t n kc : kd By induction, At D t D AB At D t 3 D A B; and so forth ::: so T D ŒB AB A n B D C: CONCLUSION: AsystemfA; B; C; Dg can be transformed to controllability canonical form if and only if it is controllable, in which case the change of coordinates is x D Cx co : EXTENSION I: If x old D Tx new then T D C old C new.thatis,toconvert between any two realizations, T is a combination of the controllability Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
26 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 matrices of the two different realizations. C new D B new A new B new Anew n B new or D T B old D T C old ; T A old TT B old T A n old TT B old T D C old C new : EXTENSION II: If x old D Tx new then T D O old O new. Thiscanbeshownina similar way. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
27 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 5.8: Canonical (Kalman) decompositions What happens if fa; Bg not controllable or if fa; C g not observable? Is part of the system controllable? Is part of the system observable? Given a system with fa; Bg not controllable, Px.t/ D Ax.t/ C Bu.t/, y.t/ D Cx.t/,let strytotransformtocontrollabilitycanonicalform. Let t D B; t D AB; : : : t r D A r B,andsupposet ;t ;:::;t r are independent but for some constants ;:::; r. t rc D A r B D rt t r Then rank.c/ D r since the vectors A r B; A rc B;:::;A n B can all be expressed as a linear combination of t ;t ;:::;t r. Let src ;:::;s n be your favorite vectors for which h i CN old D t t r s rc s n is invertible. If we were able to change coordinates to controllability form via x old D Tx new,wewoulduset D C old Cnew. But, the system is not controllable, so we use T D CN old Cnew D CN old. We get (in the new coordinate system) " " " " Pxc.t/ Ac A xc.t/ Bc D C u.t/ Px Nc.t/ A Nc x Nc.t/ i y.t/ D hc " x c.t/ c C Nc C Du.t/: x Nc.t/ Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
28 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 8 Ac is a right-companion matrix and B c is of the controllability-canonical form. We see that the uncontrollable modes x Nc are completely decoupled from u.t/. EXAMPLE: Consider s C D s.s C /.s / D s s : In observer-canonical form, " " Px.t/ D x.t/ C u.t/ h i y.t/ D x.t/: So, t D " and t D At D " D t : So, rank.c/ D. Lets D Œ T.Theconvertedstate-spaceformis " " PNx.t/ D Nx.t/ C u.t/ h i y.t/ D Nx.t/: Now suppose that we desire to transform a system that is not observable. The dual form separates out the unobservable states. Let t D C; t D CA; : : : t r D CA r,andsupposet ;t ;:::;t r are independent but t rc D CA r D rt t r for some constants ;:::; r. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
29 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 9 Then, let src ;:::;s n be your favorite row vectors for which 3 t : t r NO old D s rc 4 : 5 s n is invertible. If we were able to change coordinates to observability form via x old D Tx new,wewoulduset D O old O new. But, the system is not observable, so we use T D NO old O new D NO old. Then, we get the Kalman decomposition " " " " Pxo.t/ Ao xo.t/ Bo D C u.t/ Px No.t/ A A No x No.t/ B No h i " x o.t/ y.t/ D C o C Du.t/: x No.t/ Note: No path from x No to y! Full Kalman decomposition We can do both transformations in sequence to get full Kalman decomposition. See text chapter. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
30 ECE45/55, OBSERVABILITY AND CONTROLLABILITY : Popov Belevitch Hautus controllability/observability tests PBH EIGENVECTOR TEST: fc;ag is an unobservable pair iff a non-zero eigenvector v of A satisfies Cv D. (i.e., C and v are perpendicular). PROOF: ) Suppose Av D v and Cv D for v. Then CAv D C v D and so forth up to CA n v D n Cv D. So, Ov D and since v this means that O is not full rank and fc;ag is not observable. ( Now suppose that O is not full rank (fc;ag unobservable). Let s extract the unobservable part. That is, find T such that " T A o AT D CT D h A C o where A o is size r where r D rank.o/ and therefore A No is size n r. A No i ; Let v be an eigenvector of A No.Then " " " T A o AT D v A A No v D " v so we have found an eigenvector of A A D where D T " v : Now, we just need to show that C D (note: ). " h i " C D ƒ CT D C o D v NC v and we are done. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
31 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 3 DUAL: fa; Bg is uncontrollable iff there is a left eigenvector w T of A such that w T B D. INTERPRETATION: In modal coordinates, homogeneous response is nx x.t/ D e it v i.wi T x.// and y.t/ D Cx.t/: Or, id y.t/ D nx e it Cv i.wi T x.//: id If fc;ag is unobservable, then it has an unobservable mode, where Av i D i v i and Cv i D. If fa; Bg is uncontrollable, then it has an uncontrollable mode, namely the coefficients of the state along that mode is independent of the input u.t/. The coefficients of x in the mode associated with are w T x. d dt.wt x/ D w T.Ax C Bu/ D.w T x/ or regardless of the input u.t/! w T x.t/ D e t.w T x.// PBH RANK TESTS: The following two tests are often easier to perform h i. fa; Bg controllable iff rank si A B D n for all s C. h i ) If rank si A B h D n for all s C then there can be no nonzero i h i vector v such that v T si A B D v T.sI A/ v T B D : Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
32 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 3 Consequently, there is no nonzero vector v such that v T s D v T A and v T B D. BythePBHeigenvectortest,thesystemwill therefore be controllable ( If the system is controllable, then there is no nonzero vector v such that v T s D v T A and v T B D by the PBH eigenvector test. i Therefore, rank hsi A B D n for all s C. ". fc;ag observable iff rank C si A D n for all s C. Proofsimilar. h i si A B D n for all s not eigenvalues of A, sothe h i test is really fa; Bg controllable iff rank i I A B D n for i, i D ; : : : ; n the eigenvalues of A. (Dualargumentforobservability). i If hsi A B drops rank at s D then there is an uncontrollable mode with exponent (frequency). " C If drops rank at s D then there is an unobservable si A mode with exponent (frequency). COMMENTS: rank Summary Therefore, we can label individual modes of a system as either controllable or not, or observable or not. The overall picture is: Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
33 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 33 u.t/ Controllable and observable y.t/ Controllable but not observable Observable but not controllable Some other definitions: Neither observable nor controllable STABILIZABLE: Asystemwhoseunstablemodesarecontrollable. DETECTABLE: Asystemwhoseunstablemodesareobservable. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
34 ECE45/55, OBSERVABILITY AND CONTROLLABILITY : Minimal realizations Why a system isn t control/observ-able To realize H.s/ D s C we could use. Px.t/ D x.t/ C u.t/, y.t/ D x.t/. Thisgives A D Œ, B D Œ, C D Œ, D D Œ. C adj.si A/B det.si A/ D s C : This realization is both controllable and observable. s. Observer realization of s C s D s s.thisgives " " h i A D, B D, C D, D D Œ. C adj.si A/B D s det.si A/ s D s C : " " C O D D.Observable. CA " h i C D B AB D.Notcontrollable. s C 3. Controller realization of s C s C D s C s C s C. " " h i A D, B D, C D, D D Œ. C D C adj.si A/B s C D det.si A/ s C s C D s C : " h i B AB D.Controllable. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
35 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 35 O D " C CA D ".Notobservable. TREND: Non-minimal realizations of transfer functions will either be uncontrollable, unobservable, or both. Four equivalent statements: I: There exist common roots of C adj.si A/B and det.si A/. II: There exist eigenvalues of A which are not poles of G.s/, counting multiplicities. III: The system is either unobservable or uncontrollable. IV: There exist extra (unnecessary) states non minimal. DEFINITION: We say a system is minimal if no system with the same transfer function has fewer states. PROOF: I II IH) II: The transfer function G.s/ D C.sI A/ B C D D C adj.si A/B C D det.si A/ : det.si A/ If there are common roots in C adj.si A/B and det.si A/ they will cancel out of the transfer function. But, eigenvalues of A are det.si A/ D, sopolesofg.s/ will not contain all eigenvalues of A. IIH) I: Eigenvalues of A are det.si A/ D. PolesofG.s/, fromabove, are det.si A/ D unless canceled. The only way to cancel a pole is to have common root in C adj.si A/B. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
36 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 3 PROOF: I IV fa; B; C; Dg is minimal iff C adj.si A/B and det.si A/ are coprime (have no common roots). IH) IV: Suppose C adj.si A/B and det.si A/ have common roots. Cancel to get G.s/ D C adj.si A/B det.si A/ C D D b r.s/ a r.s/ where b r.s/ and a r.s/ are coprime ( r means reduced ). Because of cancellation, k D deg.ar /<deg.det.si A// D n. Consider controller canonical form realization of br.s/=a r.s/, for example. It has k states, but same transfer function as fa; B; C; Dg, contradicting that fa; B; C; Dg minimal. IVH) I: If there are extra states (non-minimal) then n>k(n D states, k D polesing.s/). G.s/ D C.sI A/ B C D D C adj.si A/B C D det.si A/ det.si A/ G.s/ has n poles unless some cancel with C adj.si A/B. Therefore, if n>k, C adj.si A/B and det.si A/ are not coprime. PROOF: III IV Controllable and observable iff minimal. IIIH) IV: Uncontrollable or unobservable H) not minimal. Perform Kalman decomposition to split system into co, c No, Nco and Nc No parts. Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
37 ECE45/55, OBSERVABILITY AND CONTROLLABILITY 5 3 u.t/ B c R x c.t/ C c A c Uncontrollable part of realization A R x c.t/ C Nc y.t/ N A D " A c A, NB D " B c, NC D A Nc h C c C Nc i, ND D Œ. A Nc Same transfer function using A c, B c, C c as A, N NB, NC.Therefore uncontrollable and/or unobservable means not minimal. IVH) III: Non-minimal means uncontrollable or unobservable. Suppose fa; B; C; Dg is non-minimal. C.sI A/ B C D ƒ n states D NC.sI N A/ NB C ND ƒ r<nstates CB C CAB s s Consider OC D 4 C CA B s 3 C CA CA : CA n 3 CD N C NB s C C N AN NB s C C N AN NB s 3 h i B AB A B A n B 5 C Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
38 ECE45/55, OBSERVABILITY AND CONTROLLABILITY CB CA n B D 4 : : CA n B CA n B x 3 NC NC N A D n : 4? NC AN n 5 4 y NC AN n!! r n r 5 D NB 4 NC NB NC N A n NB : NC AN n NB AN NB AN n NB! n : NC AN n NB 3 5 x r? y x n r? y Therefore det.o/ det.c/ D, sothesystemiseitherunobservable, or uncontrollable, or both. The four equivalences have now been proven. FACT: All minimal realization of G.s/ are related by a unique change of coordinates T.Canyouprovethis? Where to from here? Have seen important topics of observability and controllability. Now understand how a system could be unobservable or uncontrollable. If physically true, may need to add sensors or actuators. Important to work with minimal realizations, when possible. Now, time to consider: How do I build a controller? Very powerful tools in next chapter. 3 5 Lecture notes prepared by Dr. Gregory L. Plett. Copyright c 5,, 9,, 5, 3,,, Gregory L. Plett
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
More informationSTATE-SPACE DYNAMIC SYSTEMS (DISCRETE-TIME)
ECE452/552: Multivariable Control Systems I. 3 1 STATE-SPACE DYNAMIC SYSTEMS (DISCRETE-TIME) 3.1: The transform Computer control requires analog-to-digital (A2D) and digital-toanalog (D2A) conversion.
More informationControllability, 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
More informationMultivariable 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
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 informationObservability 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
More informationLecture 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
More informationLecture 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
More informationECE504: Lecture 9. D. Richard Brown III. Worcester Polytechnic Institute. 04-Nov-2008
ECE504: Lecture 9 D. Richard Brown III Worcester Polytechnic Institute 04-Nov-2008 Worcester Polytechnic Institute D. Richard Brown III 04-Nov-2008 1 / 38 Lecture 9 Major Topics ECE504: Lecture 9 We are
More informationMULTIVARIABLE 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)
More informationLinear 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
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 informationTopic # 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
More informationECEN 605 LINEAR SYSTEMS. Lecture 7 Solution of State Equations 1/77
1/77 ECEN 605 LINEAR SYSTEMS Lecture 7 Solution of State Equations Solution of State Space Equations Recall from the previous Lecture note, for a system: ẋ(t) = A x(t) + B u(t) y(t) = C x(t) + D u(t),
More informationẋ 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
More informationSolution 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
More informationControllability. 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
More informationModule 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
More informationKalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and
Kalman Decomposition Controllable / uncontrollable decomposition Suppose that the controllability matrix C R n n of a system has rank n 1
More information1 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
More informationBalanced 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
More informationFall 線性系統 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.
More informationModule 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
More informationControl Systems. System response. L. Lanari
Control Systems m i l e r p r a in r e v y n is o System response L. Lanari Outline What we are going to see: how to compute in the s-domain the forced response (zero-state response) using the transfer
More informationControl 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)
More informationControl 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
More informationNonlinear Observers. Jaime A. Moreno. Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México
Nonlinear Observers Jaime A. Moreno JMorenoP@ii.unam.mx Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México XVI Congreso Latinoamericano de Control Automático October
More informationOUTPUT-FEEDBACK CONTROL
ECE4520/5520: Multivariable Control Systems I. 1 OUTPUT-FEEDBACK CONTROL.1: Open-loop and closed-loop estimators Open-loop estimators State feedback is impractical since we don t know the state! But, what
More informationJoã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.
More informationControl 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
More informationMASSACHUSETTS 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: [
More informationControl 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
More informationIdentification Methods for Structural Systems
Prof. Dr. Eleni Chatzi System Stability Fundamentals Overview System Stability Assume given a dynamic system with input u(t) and output x(t). The stability property of a dynamic system can be defined from
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 informationModule 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control
Module 09 From s-domain to time-domain From ODEs, TFs to State-Space Modern Control Ahmad F. Taha EE 3413: Analysis and Desgin of Control Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/
More informationLinear Systems. Linear systems?!? (Roughly) Systems which obey properties of superposition Input u(t) output
Linear Systems Linear systems?!? (Roughly) Systems which obey properties of superposition Input u(t) output Our interest is in dynamic systems Dynamic system means a system with memory of course including
More informationModule 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
More informationLINEAR QUADRATIC GAUSSIAN
ECE553: Multivariable Control Systems II. LINEAR QUADRATIC GAUSSIAN.: Deriving LQG via separation principle We will now start to look at the design of controllers for systems Px.t/ D A.t/x.t/ C B u.t/u.t/
More informationIntro. 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
More information1 Similarity transform 2. 2 Controllability The PBH test for controllability Observability The PBH test for observability...
Contents 1 Similarity transform 2 2 Controllability 3 21 The PBH test for controllability 5 3 Observability 6 31 The PBH test for observability 7 4 Example ([1, pp121) 9 5 Subspace decomposition 11 51
More informationControl Systems Design
ELEC4410 Control Systems Design Lecture 13: Stability Julio H. Braslavsky julio@ee.newcastle.edu.au School of Electrical Engineering and Computer Science Lecture 13: Stability p.1/20 Outline Input-Output
More informationMEM 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
More informationChap 4. State-Space Solutions and
Chap 4. State-Space Solutions and Realizations Outlines 1. Introduction 2. Solution of LTI State Equation 3. Equivalent State Equations 4. Realizations 5. Solution of Linear Time-Varying (LTV) Equations
More informationGrammians. 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
More informationContents. 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
More information1 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
More informationME 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
More informationECE504: Lecture 8. D. Richard Brown III. Worcester Polytechnic Institute. 28-Oct-2008
ECE504: Lecture 8 D. Richard Brown III Worcester Polytechnic Institute 28-Oct-2008 Worcester Polytechnic Institute D. Richard Brown III 28-Oct-2008 1 / 30 Lecture 8 Major Topics ECE504: Lecture 8 We are
More informationRobust 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
More information6.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
More informationPerspective. 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
More informationControl 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
More informationCDS 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
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 informationObservability. 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,
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 informationChapter 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
More informationLinear 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
More informationECE504: Lecture 10. D. Richard Brown III. Worcester Polytechnic Institute. 11-Nov-2008
ECE504: Lecture 10 D. Richard Brown III Worcester Polytechnic Institute 11-Nov-2008 Worcester Polytechnic Institute D. Richard Brown III 11-Nov-2008 1 / 25 Lecture 10 Major Topics We are finishing up Part
More informationAdvanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis
065-3 Advanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis 6 October - 0 November, 009 Digital Signal Processing The z-transform Massimiliano Nolich DEEI Facolta' di Ingegneria
More information1 Some Facts on Symmetric Matrices
1 Some Facts on Symmetric Matrices Definition: Matrix A is symmetric if A = A T. Theorem: Any symmetric matrix 1) has only real eigenvalues; 2) is always iagonalizable; 3) has orthogonal eigenvectors.
More informationLec 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
More informationProblem 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
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 informationECE557 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,
More informationObservability. 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
More informationMA 527 first midterm review problems Hopefully final version as of October 2nd
MA 57 first midterm review problems Hopefully final version as of October nd The first midterm will be on Wednesday, October 4th, from 8 to 9 pm, in MTHW 0. It will cover all the material from the classes
More informationProblem Set 5 Solutions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Problem Set 5 Solutions The problem set deals with Hankel
More informationSYSTEMTEORI - Ö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
More informationControl 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:
More information2.4 REALIZATION AND CANONICAL FORMS
Copyright F.L. Lewis 2008 All rights reserved Updated: Saturday, October 12, 2013 These notes are taken from F.L. Lewis, Applied Optimal Control and Estimation: Digital Design and Implementation, Prentice-Hall,
More informationPole placement control: state space and polynomial approaches Lecture 1
: state space and polynomial approaches Lecture 1 dynamical O. Sename 1 1 Gipsa-lab, CNRS-INPG, FRANCE Olivier.Sename@gipsa-lab.fr www.gipsa-lab.fr/ o.sename November 7, 2017 Outline dynamical dynamical
More informationControl 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
More informationCourse Background. Loosely speaking, control is the process of getting something to do what you want it to do (or not do, as the case may be).
ECE4520/5520: Multivariable Control Systems I. 1 1 Course Background 1.1: From time to frequency domain Loosely speaking, control is the process of getting something to do what you want it to do (or not
More informationAdvanced Control Theory
State Space Solution and Realization chibum@seoultech.ac.kr Outline State space solution 2 Solution of state-space equations x t = Ax t + Bu t First, recall results for scalar equation: x t = a x t + b
More informationBanded symmetric Toeplitz matrices: where linear algebra borrows from difference equations. William F. Trench Professor Emeritus Trinity University
Banded symmetric Toeplitz matrices: where linear algebra borrows from difference equations William F. Trench Professor Emeritus Trinity University This is a lecture presented the the Trinity University
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 informationCDS 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
More informationLecture 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
More informationEE263: Introduction to Linear Dynamical Systems Review Session 6
EE263: Introduction to Linear Dynamical Systems Review Session 6 Outline diagonalizability eigen decomposition theorem applications (modal forms, asymptotic growth rate) EE263 RS6 1 Diagonalizability consider
More informationECEN 605 LINEAR SYSTEMS. Lecture 8 Invariant Subspaces 1/26
1/26 ECEN 605 LINEAR SYSTEMS Lecture 8 Invariant Subspaces Subspaces Let ẋ(t) = A x(t) + B u(t) y(t) = C x(t) (1a) (1b) denote a dynamic system where X, U and Y denote n, r and m dimensional vector spaces,
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More information5. 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
More informationMATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS
MATH 221: SOLUTIONS TO SELECTED HOMEWORK PROBLEMS 1. HW 1: Due September 4 1.1.21. Suppose v, w R n and c is a scalar. Prove that Span(v + cw, w) = Span(v, w). We must prove two things: that every element
More informationChapter 7. Canonical Forms. 7.1 Eigenvalues and Eigenvectors
Chapter 7 Canonical Forms 7.1 Eigenvalues and Eigenvectors Definition 7.1.1. Let V be a vector space over the field F and let T be a linear operator on V. An eigenvalue of T is a scalar λ F such that there
More informationReachability, Observability and Minimality for a Class of 2D Continuous-Discrete Systems
Proceedings of the 7th WSEAS International Conference on Systems Theory and Scientific Computation, Athens, Greece, August 24-26, 27 Reachability, Observability and Minimality for a Class of 2D Continuous-Discrete
More informationFull 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
More informationSystems and Control Theory Lecture Notes. Laura Giarré
Systems and Control Theory Lecture Notes Laura Giarré L. Giarré 2018-2019 Lesson 14: Rechability Reachability (DT) Reachability theorem (DT) Reachability properties (DT) Reachability gramian (DT) Reachability
More informationMath 110 Linear Algebra Midterm 2 Review October 28, 2017
Math 11 Linear Algebra Midterm Review October 8, 17 Material Material covered on the midterm includes: All lectures from Thursday, Sept. 1st to Tuesday, Oct. 4th Homeworks 9 to 17 Quizzes 5 to 9 Sections
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 informationObservability 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
More informationRecitation 8: Graphs and Adjacency Matrices
Math 1b TA: Padraic Bartlett Recitation 8: Graphs and Adjacency Matrices Week 8 Caltech 2011 1 Random Question Suppose you take a large triangle XY Z, and divide it up with straight line segments into
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationJordan Canonical Form
Jordan Canonical Form Massoud Malek Jordan normal form or Jordan canonical form (named in honor of Camille Jordan) shows that by changing the basis, a given square matrix M can be transformed into a certain
More informationELEC 3035, Lecture 3: Autonomous systems Ivan Markovsky
ELEC 3035, Lecture 3: Autonomous systems Ivan Markovsky Equilibrium points and linearization Eigenvalue decomposition and modal form State transition matrix and matrix exponential Stability ELEC 3035 (Part
More informationIntroduction 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
More informationEigenvalues and Eigenvectors
Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Eigenvalues are the key to a system of n differential equations : dy=dt ay becomes dy=dt Ay. Now A is a matrix and y is a vector.y.t/;
More informationControl Systems I. Lecture 5: Transfer Functions. Readings: Emilio Frazzoli. Institute for Dynamic Systems and Control D-MAVT ETH Zürich
Control Systems I Lecture 5: Transfer Functions Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 20, 2017 E. Frazzoli (ETH) Lecture 5: Control Systems I 20/10/2017
More informationAutonomous system = system without inputs
Autonomous system = system without inputs State space representation B(A,C) = {y there is x, such that σx = Ax, y = Cx } x is the state, n := dim(x) is the state dimension, y is the output Polynomial representation
More informationMultivariable 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:
More information