{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

EEL5173 Fall 2009 Lecture _14

EEL5173 Fall 2009 Lecture _14 - IV Controllability and...

Info icon This preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
IV. Controllability and Observability f x r 1. Controllability and Reachability (Zak) i. DT System (1) Reachability x 1 x 2 ) ( ) ( ) 1 ( k Bu k x A k x + = + r r 0 r Theorem. The system is reachable if and only if { } [ ] B A AB B B A S n def 1 , , , , = L is of rank n .
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Ex. 0.5 2 3 0.7 D D u ( k ) y ( k ) x 1 ( k ) x 1 ( k+ 1) x 2 ( k ) x 2 ( k+ 1) { } [ ] = = = = = 0 0 5 . 0 1 , , 2 0 1 , 7 . 0 0 0 5 . 0 AB B B A S n B A S { A , B } is singular. Hence, the system is not reachable.
Image of page 2
Ex. A system is governed by the following state equations. Determine whether the system is reachable or not. ) ( 0 0 1 ) ( 0 1 0 0 0 1 4 6 9 ) 1 ( k u k x k x + = + r r S { A , B } is non-singular. Hence, the system is reachable. { } [ ] { } 1 , 1 0 0 9 1 0 75 9 1 , , , 3 2 = = = = B A S B A AB B B A S n
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon