Design of Positive Linear Observers for Positive Systems via Coordinates Transformation and Positive Realization
|
|
- Annabelle Wilkins
- 5 years ago
- Views:
Transcription
1 Design of Positive Linear Observers for Positive Systems via Coordinates Transformation and Positive Realization Juhoon Back 1 Alessandro Astolfi 1 1 Department of Electrical and Electronic Engineering Imperial College, UK ICM 3 May 2006
2 Outline 1 Background 2 Postive Linear Observer via Coordinates Trasformation Necessary Condition on the Existence of PLO via CT Sufficient Condition: Design of PLO via CT 3 Positive Linear Observer via Positive Realization Positive Realization and PLO via PR Existence of PLO via PR 4 Conclusion and Discussion
3 Background Positive Linear System Positive System: ẋ = f (x, u), x R n, u R m Positive orthant: R n + := [0, ) n x(0) R n +, u(t) R m +, t 0 x(t) R n +, t 0. Natural if x represents density, population,... Field: Economics, Biology, etc.
4 Background Positive Linear System Positive System: ẋ = f (x, u), x R n, u R m Positive orthant: R n + := [0, ) n x(0) R n +, u(t) R m +, t 0 x(t) R n +, t 0. Natural if x represents density, population,... Field: Economics, Biology, etc. Positive Linear System: ẋ = Ax + Bu, y = Cx Positive Linear System (wrt x, y) A is Metzler (off-diagonal nonnegative), B 0, C 0. If A is Metzler, the eigenvalue of maximal real part λ max (A) is real.
5 Background Positive Linear System Example ẋ = [ ] 1 1 x u = 0.5(2 + sin t). [ ] 1 u 0
6 Background Positive Linear Observer Linear observer for linear systems Luenberger type observer ˆx = Aˆx + K(y Cˆx), A KC : Hurwitz Existence condition : detectability of (A, C) Positive linear observer: A positive linear system with input y, output ˆx Guarantees error convergence ( ˆx x 0) Reasonable for positive systems: ˆx 0. Good candidate: ˆx = Aˆx + K(y Cˆx) A KC : Hurwitz, Metzler, K 0 Existence condition has not been found for general case
7 Background Previous Results Observer Structure: Luenberger Type Observer ˆx = Aˆx + K(y Cˆx) A KC : Hurwitz, Metzler, K 0 Van Den Hof (1998, SIAM) : Compartmental Systems, MO Compartmental System: Every column sum of A 0, A Metzler, B 0, C 0. Dautrebande, Bastin (1999, ECC) : Positive Systems, MO Leenheer, Aeyels (2001, SCL): Stabilization, SI
8 Coordinates Change Motivating Example Example ẋ = y = [ 1 [ ] 1 1 x =: Ax, ] x =: Cx. Identity PLO not possible ˆx = Aˆx + K(y Cˆx) A KC : Hur. and Met., K 0 [ ] 1 k1 1 A KC = 2 k 2 0
9 Coordinates Change Motivating Example Example ẋ = y = [ 1 [ ] 1 1 x =: Ax, ] x =: Cx. [ ] 2 Take k =. 3 Luenberger [ ] Observer: [ ] ˆx = ˆx + y Not positive System Identity PLO
10 Coordinates Change Motivating Example Example ẋ = y = [ 1 [ ] 1 1 x =: Ax, ] x =: Cx. Identity PLO PLO via Transformation ˆx = [ ] 3 1 ˆx Transform: z = Tx = [ ] 2 y (Not PLO) 4 [ ] 1 x ẑ = T(A KC)T 1 ẑ + TKy [ ] [ ] = ẑ y, ˆx = T 1 ẑ 5 PLO
11 PLO via Coordinates Transformation Sylvester Equation Structure: ẑ = Fẑ + Gy ˆx = T 1 z F: Hurwitz and Metzler matrix, G R n q + T: nonsingular matrix with T 1 R n n +. Equivalent to solve the Sylvester Equation: TA FT = GC, F, G : Design parameters Coodinate transformation involved Hard: T 1 R n n +, inverse eigenvalue problem F. Sufficient condition for the existence T: σ(f) σ(a) = φ When σ(f) σ(a) = φ, necessary condition for invertible T: Observability (A, C) and Controllability (F, G)
12 PLO via Coordinates Transformation Design Procedure Procedure with Nonresonnance Condition 1 Choose a controllable pair (F, G) such that F is Hurwitz and Metzler, σ(f) σ(a) = φ, and G R n k +. 2 Solve the unique T in TA FT = GC. 3 Check if T is nonsingular and T 1 R n n +. 4 If T fails to meet the conditions of step 3 of the procedure, then choose other (F, G) pair and repeat the process.
13 PLO via Coordinates Transformation Design Procedure Procedure with Nonresonnance Condition 1 Choose a controllable pair (F, G) such that F is Hurwitz and Metzler, σ(f) σ(a) = φ, and G R n k +. 2 Solve the unique T in TA FT = GC. 3 Check if T is nonsingular and T 1 R n n +. 4 If T fails to meet the conditions of step 3 of the procedure, then choose other (F, G) pair and repeat the process. σ(f) σ(a) = φ: restrictive (for uniqueness of T). Procedure without σ(f) σ(a) = φ is an observer design procedure [Chen1984]. Requires iteration (not constructive).
14 Necessary Condition on the Existence of PLO via CT Restriction on the Spectrum Basic Tool Lemma Let A R n n be Metzler and C R 1 n +. Suppose λ max(a) 0. If there exists K R n 1 + such that A KC is Metzler and λ max (A KC) < λ max (A), then the algebraic multiplicity of λ max (A) (=: m) is at most 1.
15 Necessary Condition on the Existence of PLO via CT Restriction on the Spectrum Basic Tool Lemma Let A R n n be Metzler and C R 1 n +. Suppose λ max(a) 0. If there exists K R n 1 + such that A KC is Metzler and λ max (A KC) < λ max (A), then the algebraic multiplicity of λ max (A) (=: m) is at most 1. Proof: by Contradiction. Assume m > 1. Detectable. For a Metzler matrix A, the algebraic multiplicity of λ max (A) equals the geometric multiplicity of λ max (A) (nullity of (A λ max (A)I)). [ ] C rank rank C + rank [A λ A λ max (A)I max (A)I] = 1 + n m < n Condtradiction.
16 Necessary Condition on the Existence of PLO via CT Restriction on the Spectrum Theorem Let A R n n be a Metzler matrix and C := [c 1,, c n ] R 1 n +. If there exists K R n + and S R n n + with det S 0 such that S 1 AS KCS is Metzler and Hurwitz, then the number of nonnegative real eigenvalue of A counting the multiplicity is at most 1. Note: 1. TA FT = GC, T 1 0 AS SF = SGCS, S F = TAT 1 GCT 1 = S 1 AS GCS.
17 Necessary Condition on the Existence of PLO via CT Restriction on the Spectrum Proof: F = TAT 1 GCT 1 = S 1 AS GCS, by Contradiction idea: Reduce parameters to one and use Root Locus 1. A = S 1 AS, C = CS. 2. Suppose A KC = S 1 AS KCS is Metzler and Hurwitz. 3. A δkc, δ [0, 1] is Metzler. 4. δ [0, 1) s.t. A δkc is Metzler and Hurwitz δ [δ, 1]. 5. One parameter det(si A + δkc) = det((si A)(I + δ(si A) 1 KC)) Root Locus analysis. = det(si A)(1 + δc(si A) 1 K) = det(si A) + δcadj(si A)K =: D(s) + δn(s)
18 Necessary Condition on the Existence of PLO via CT Necessary Condition when F is a diagonal Simple structure of PLO ẑ = Fẑ + Gy = λ 1... λ n + g 1. g n y Assumption 1 (Non Resonnance): σ(f) σ(a) = φ Assumption 2 (F diagonal): F = diag{λ 1, λ 2,, λ n }, λ i R, and λ i λ j if i j Theorem Single-output System. Suppose Assumption 1 and 2 hold. If there exists a positive linear observer of dimension n, then Card(σ(A) R ) n 1.
19 Necessary Condition on the Existence of PLO via CT Necessary Condition when F is a diagonal-proof Assume λ 1 < λ 2 < < λ n. TI IT = 0 TA FT = GC. TA n F n T = GCA n 1 + FGCA n F n 2 GCA + F n 1 GC T (A) (F)T = U F Λ α V A α n 1 α n 2 α 1 1 C := [ G FG F n 1 G ] α n 2 α n CA..... α CA n CA n 1 T = ( (F)) 1 U F Λ α V A. (1)
20 Necessary Condition on the Existence of PLO via CT Necessary Condition when F is a diagonal-proof n PLO, S R n n + s.t. TS = I. U F Λ α V A S = (F). (2) g 1 λ 1 g 1 λ n 1 1 g 1 U F Λ α =... Λ α g n λ n g n λ n 1 n g n g 1 θ 1 (λ 1 ) g 1 θ 2 (λ 1 ) g 1 θ n (λ 1 ) =... g n θ 1 (λ n ) g n θ 2 (λ n ) g n θ n (λ n ) θ i (s) := s n i + α 1 s n i 1 + α 2 s n i α n i, i = 1,, n 1 θ n (s) := 1. (3)
21 Necessary Condition on the Existence of PLO via CT Necessary Condition when F is a diagonal-proof Θ := θ 1 (λ 1 ) θ 2 (λ 1 ) θ n (λ 1 )... θ 1 (λ n ) θ 2 (λ n ) θ n (λ n ) det Θ = (λ i λ j ). (4) 1 i<j n F ( (F) as well) is diagonal and g i 0, (λ 1 ) g (λ 0 2 ) ΘV A S = g ΘV A S i = 0 (i 1) 1 (λ i) g i 0 (n i) 1 (λ n) g n,, S i : ith column of S (5)
22 Necessary Condition on the Existence of PLO via CT Necessary Condition when F is a diagonal-proof Cramer s rule: CS i = 1 0 (i 1) 1. θ 2 (λ 1 ) θ n (λ 1 ) det Θ det (λ i) g i... 0 (n i) 1. θ 2 (λ n ) θ n (λ n ) = ( 1) i (λ i ) g i det Θ det Θ [i] θ 2 (λ 1 ) θ n (λ 1 ).. Θ [i] := θ 2 (λ i 1 ) θ n (λ i 1 ) θ 2 (λ i+1 ) θ n (λ i+1 ).. θ 2 (λ n ) θ n (λ n ) which should be nonnegative because C 0, S i 0. (6)
23 Necessary Condition on the Existence of PLO via CT Necessary Condition when F is a diagonal-proof The nonsingularity of the matrices in (6) and Assumption 1 ( (λ i ) 0) implies Using (4), compute det Θ [i] det Θ = CS i = ( 1) i (λ i) det Θ [i] g i det Θ = 1 u<v n,u i,v i (λ u λ v ) 1 u<v n (λ u λ v ) > 0, i = 1,, n. (7) 1 (λ 1 λ i ) (λ i 1 λ i )(λ i λ i+1 ) (λ i λ n), 2 i n 1 1 (λ 1 λ 2 ) (λ 1 λ n), i = 1 1 (λ 1 λ n) (λ n 1 λ n), i = n.
24 Necessary Condition on the Existence of PLO via CT Necessary Condition when F is a diagonal-proof Since λ i < λ i+1, i = 1,, n 1, CS i = ( 1) i+n 1 det Θ (λ i ) [i] g i det Θ ( 1) i+n 1 (λ i ) > 0, i = 1,, n. ( 1) i+n 1 (λ i ) ( 1) i+1+n 1 (λ i+1 ) > 0, i = 1,, n 1, (λ i ) (λ i+1 ) < 0, i = 1,, n 1. Note: ( ) is a continuous function λ i s.t. (λ i ) = 0, λ i < λ i < λ i+1, i = 1,, n 1. there are at least n 1 negative real eigenvalues of A.
25 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues Definition Reducible: if there exists a permutation matrix P R n n s.t. ( ) PAP t A11 0 = A 21 A 22 where A 11, A 22 are square matrices. A is said to be irreducible if A is not reducible. Note: if A is irreducible, it has an eigenvector V 1 whose elements are all positive.
26 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues Assume: A has n real distinct eigenvalues λ 1,, λ n s.t. λ 1 > > λ n. Jordan Form: A = VJV 1 (8) J := diag{λ 1,, λ n } (9) V := [ V 1 V n ] (10) Theorem Single-output positive system. Suppose A is irreducible and (A, C) is observable. There exists a positive linear observer of dimension n if (A, C) satisfies 1) σ(a) R and σ(a) contains one (or no) nonnegative real number, 2) all the eigenvalues of A are simple.
27 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof Observability assumption CV i 0. Scale V i s.t. CV i = 1, i = 1,, n. Main idea: Construct S and G to solve AS SF = SGCS Let β, γ be real numbers in the open interval (0, 1). We define [ ] 1 β (1 γ)1 S(β, γ) = 1 (n 1). (11) β1 (n 1) 1 γi n 1 Properties of S: det S = γ n 2 [γ nβγ + (n 1)β]. [ S 1 = γn 3 γ 2 ] γ(1 γ)1 1 (n 1) det S β(1 γ)1 n 1 + π β,γ I n 1 βγ1 (n 1) 1 where π β,γ := γ(1 β) + (n 1)β(1 γ). Note: π β,γ > 0, β, γ (0, 1). (12)
28 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof Construction of S: Let β (0, 1), γ (0, 1) such that S(β, γ) = VS(β, γ). (13) S(β, γ) 0, β (0, β ), γ (0, γ ). (14) β, γ always exist. In fact, let S i be the ith column of S. Then, S 1 = (1 β)v 1 + β( V 2 V n ) S i = (1 γ)v 1 + γv i, i = 2,, n. (15) Note: S i starts from V 1 (i.e., β = 0, γ = 0) and ends at (V V n ) or V i (i.e., β = 1, γ = 1). Thus, by continuity, the existence of β, and γ is proved.
29 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof T(β, γ) = S 1 (β, γ). F = TAT 1 GCT 1. (16) Note: first column of S 1 is elementwise positive G = µs 1 e 1 (17) where e 1 := [ 1 chosen later. 0 1 (n 1) ] t and µ is a positive number to be F = S 1 VJV 1 S GCS = S 1 V 1 VJV 1 VS S 1 µe 1 CVS = S 1 [J µe n ]S.
30 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof Fine µ, β, γ rendering F Hurwitz and Metzler. Then, F := det S γ n 3 F T := det S S 1 γn 3 F = T[J µe n ]S [ ] π β,γ [λ 1 (1 γ) µ]1 = T 1 (n 1) β [ ] t λ 2 λ n γdiag{λ 2,, λ n } where π β,γ := (λ 1 µ)(1 β) + (n 1)µβ.
31 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof Thus, F 11 F 21 F n1 γ 2 π β,γ + βγ(1 γ) n i=2 λ i. = βγπ β,γ βπ β,γ λ 2 + β 2 (1 γ) n F nk i=2 λ i. βγπ β,γ βπ β,γ λ n + β 2 (1 γ) n i=2 λ i and for k = 2,, n, F 1k γ 2 [(λ 1 λ k )(1 γ) µ] F 2k. = βγ[(λ 1 λ k )(1 γ) µ] + δ 2,k γπ β,γ λ k. βγ[(λ 1 λ k )(1 γ) µ] + δ n,k γπ β,γ λ k where δ i,j = 1 if i = j and δ i,j = 0 otherwise.
32 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof From this computation, we derive some properties of F. P1. For all k = 3,, n, F 21 F k1. P2. For all k = 2,, n, F 1k 0 if and only if F jk 0, j = 2,, n, j k. P3. For all k = 3,, n, F 12 F 1k. P1 can be proved easily since F 21 F k1 = βπ β,γ (λ 2 λ k ) < 0, P2 follows from 1 γ F 1k = 1 β F jk = γ[(λ 1 λ k )(1 γ) µ], and the relation F 12 F 1k = γ 2 (1 γ)( λ 2 + λ k ) < 0, k = 3,, n, ensures P3.
33 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof From P1, P2, P3, and the fact that F is similar to J µe n whose spectrum is {λ 1 µ, λ 2,, λ n }, it follows that F is Hurwitz and Metzler if there exist µ, β (0, β ), and γ (0, γ ) such that the following inequalities hold λ 1 µ < 0 (18) n γπ β,γ π β,γ λ 2 + β(1 γ) λ i 0 (19) i=2 (λ 1 λ 2 )(1 γ) µ 0. (20) We choose µ in (λ 1, λ 1 λ 2 ) and define { γ = min γ, λ } 1 λ 2 µ. λ 1 λ 2 Then, for each γ in (0, γ ), the inequality (20) holds.
34 Sufficient Condition: Design of PLO via CT A with Distinct Real Eigenvalues: proof With µ and γ chosen above, it remains to choose β for (19). To do this, we expand the left hand side of (19) as follows γπ β,γ π β,γ λ 2 + β(1 γ) n i=2 λ i = γ(λ 1 λ 2 nµ)β + (1 γ)β n i=2 ( λ 2 + λ i ) + (λ 1 λ 2 µ)γ Thus, the inequality (19) is equivalent to (λ 1 λ 2 µ)γ Υ(γ, µ, λ 1,, λ n )β (21) where Υ(γ, µ, λ 1,, λ n ) = γ(λ 1 λ 2 nµ) + (1 γ) n i=2 (λ 2 λ i ). This inequality (hence (19)) holds true for any β (0, β ) where { β, if Υ 0 β = { } min β,, if Υ > 0. Thus, the proof is complete. λ 1 λ 2 γ Υ(γ,µ,λ 1,,λ n)
35 PLO via Positive Ralization Positive Realization Definition Transfer function matrix T(s) with input u and output y. If there exists ż = Fz + Gu, y = Hx F : Metzler, G 0, H 0 such that T(s) = H(sI F) 1 G, then (F, G, H) is said to be a positive realization of T(s). Finite Dimensional PR: Find a polyhedral cone with certain property (F invariant). SISO: If (A, B, C) is a minimal realization of G(s), G(s) has a PR if and only if a polyhedral convex cone M s.t. (A + λi)m M for some λ 0, R M O R : Reachability Cone, O : Observability Cone.
36 PLO via Positive Ralization Positive Realization Existence PR - impulse response and dominant pole Theorem (SISO) Let T(s) be a rational transfer function. T(s) has a positive realization if and only if 1. The impulse response function h(t) is positive, i.e., h(t) > 0 for every t > 0 and h(0) 0, and 2. There is a unique (possibly multiple) pole of T(s) with maximal real part. MIMO: T(s) has a PR iff each component of T(s) has a PR.
37 PLO via Positive Ralization Problem Formulation- Observer Definition Given a positive linear system, a linear system ẑ = Fẑ + Gy, ẑ R N ˆx = Hẑ, ˆx R n (22) is called a positive linear observer if F is Hurwitz and Metzler, G R N q +, H Rn N +, and lim t Hẑ(t) x(t) = 0 for all ẑ(0) R N + and x(0) R n +. Observer can be interpreted as a Transfer Function. Positive Realization is employed (N : additional degree of freedom). Under what condition the existence of positive linear observer is guaranteed? How to construct (F, G, H)?.
38 PLO via Positive Ralization Existence of PLO via PR Theorem Detectable Positive linear system (A, C). If there exists K R n q such that A KC is a Hurwitz matrix and the transfer function G o (s) = (si A + KC) 1 K admits a positive realization, then there exists a PR (F, G, H) with F being Hurwitz such that dynamic system ẑ = Fẑ + Gy, ˆx = Hẑ, ˆx R n is a positive linear observer for (A, C). ẑ R N N is a design variable N can be larger than n or smaller than n
39 PLO via Positive Ralization Existence of PLO via PR-proof Let A K = A KC and T be the transformation decomposing (A K, K, I) into controllable and uncontrollable part. [ ] [ ] AK,c A TA K = 12 Kc T, TK =, T 1 = [ ] C 0 A K,c 0 c C c such that (A K,c, K c ) is controllable. Then, G o (s) = C c (si A K,c ) 1 K c. Let (F, G, H) be a positive realization of G o (s). Note that this realization may not be Hurwitz (i.e., there may be an positive real eigenvalue which is uncontrollable or unobservable). Following the same procedure of Anderson et al (Theorem 3.2), one can exclude these modes to obtain a reduced oder positive realization (F, G, H) such that λ max (F) is a pole of G o (s), i.e., F is Hurwitz.
40 PLO via Positive Ralization Existence of PLO via PR-proof Now, suppose (F, G, H) with F being Hurwitz be a positive realization of G o (s) with a cone M generated by M, i.e., A K,c M = MF, K c = MG, H = C c M. (23) Since A K T 1 [ ] [ ] [ ] A = A K Cc C c = Cc C K,c A 12 c = 0 A [ ] K,c T 1 AK,c A 12, it follows that A 0 A K C c = C c A K,c. Similarly, one K,c has C c K c = K. Hence, AH HGCH = A K H + KCH HGCH Let e = ˆx x. Then, = A K C c M + C c K c CH HGCH = C c A K,c M + C c MGCH HGCH = HF. ė = HFẑ + HGCx Ax = = (A KC)e
41 PLO via Positive Ralization Existence of PLO via PR Theorem Consider a positive linear observer (F, G, H) for (A, C) ((F, G, H) is a positive realization of G o (s) = (si A + KC) 1 K). Let n c be the dimension of controllable part of (A KC, K). Then, 1. K rank H = n c. 3. AH FH = HGCH. Theorem A positive linear system (A, C), assume (A, C) is an observable pair. If there is K R n q such that K > 0 and G o (s) = (si A + KC) 1 K admits a PR (F, G, H) which is a PLO via PR, then there exists K such that A KC is Hurwitz, (A KC, K) is controllable, and G o (s) = (si A + KC) 1 K admits a PR (F, G, H) with rank H = n. (Proof: Underway)
42 PLO via Positive Ralization Existence of PLO via PR Theorem For a single output positive system (A, C), suppose A is irreducible and (A, C) is detectable. Let λ 1 = λ max (A). There exists a PLO via PR (F, G, H) if all eigenvalues of A except λ 1 lie in the open left half complex plain. Stable engenvalues can be complex (compare PLO via CT). One dimensional PLO via PR can be constructed (estimate the mode of λ 1 ).
43 PLO via Positive Ralization Existence of PLO via PR- irreducible case, proof A: irreducible, (A, C) is detectable v max int R n + such that Av max = λ max (A)v max, Cv max = 1. λ := max{re λ λ σ(a), λ λ 1 }. K := (λ 1 + ɛ)v max, λ < ɛ < 0 As observered by Brauer, 1952 (Theorem 2.9), we have σ(a KC) = (σ(a) {λ 1 }) { ɛ} since Cv max = 1. All the eigenvalues of A and A KC coincide except that λ 1 is replaced by ɛ. A KC is Hurwitz and the eigenvalue with the maximum real part is real.
44 PLO via Positive Ralization Existence of PLO via PR- irreducible case, proof Define G o (s) = (si A + KC) 1 K. g o (t) = e (A KC)t K = e (A (λ 1+ɛ)v maxc)t (λ 1 + ɛ)v max [ ] 1 = (λ 1 + ɛ) i! [A (λ 1 + ɛ)v max C] i t i i=0 [ ] 1 = (λ 1 + ɛ) i! ( ɛt)i v max i=0 = (λ 1 + ɛ)e ɛt v max > 0 which implies that G o (s) has a positive realization. v max
45 Conclusion and Discussion Done Postive linear observer for positive linear systems. Coordinates Transformation and Positive Realization. Existence Conditions and Constructive Designs. Todo More general case: Forced Systems, Nonlinear Systems. Study on dual problem: Negative Stabilization
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 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 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 informationIntro. Computer Control Systems: F9
Intro. Computer Control Systems: F9 State-feedback control and observers Dave Zachariah Dept. Information Technology, Div. Systems and Control 1 / 21 dave.zachariah@it.uu.se F8: Quiz! 2 / 21 dave.zachariah@it.uu.se
More informationA Characterization of the Hurwitz Stability of Metzler Matrices
29 American Control Conference Hyatt Regency Riverfront, St Louis, MO, USA June -2, 29 WeC52 A Characterization of the Hurwitz Stability of Metzler Matrices Kumpati S Narendra and Robert Shorten 2 Abstract
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 informationZeros 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)
More informationPOLE PLACEMENT. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 19
POLE PLACEMENT Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 19 Outline 1 State Feedback 2 Observer 3 Observer Feedback 4 Reduced Order
More 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 informationGeometric Mapping Properties of Semipositive Matrices
Geometric Mapping Properties of Semipositive Matrices M. J. Tsatsomeros Mathematics Department Washington State University Pullman, WA 99164 (tsat@wsu.edu) July 14, 2015 Abstract Semipositive matrices
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 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 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 informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationNonlinear Control Systems
Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 7. Feedback Linearization IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs1/ 1 1 Feedback Linearization Given a nonlinear
More informationControl Systems. Dynamic response in the time domain. L. Lanari
Control Systems Dynamic response in the time domain L. Lanari outline A diagonalizable - real eigenvalues (aperiodic natural modes) - complex conjugate eigenvalues (pseudoperiodic natural modes) - phase
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 informationMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science : MULTIVARIABLE CONTROL SYSTEMS by A.
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Q-Parameterization 1 This lecture introduces the so-called
More informationEL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1)
EL 625 Lecture 0 EL 625 Lecture 0 Pole Placement and Observer Design Pole Placement Consider the system ẋ Ax () The solution to this system is x(t) e At x(0) (2) If the eigenvalues of A all lie in the
More informationLecture 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 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 informationModel reduction via tangential interpolation
Model reduction via tangential interpolation K. Gallivan, A. Vandendorpe and P. Van Dooren May 14, 2002 1 Introduction Although most of the theory presented in this paper holds for both continuous-time
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 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 informationLinear System Theory
Linear System Theory Wonhee Kim Lecture 4 Apr. 4, 2018 1 / 40 Recap Vector space, linear space, linear vector space Subspace Linearly independence and dependence Dimension, Basis, Change of Basis 2 / 40
More informationCity Suburbs. : population distribution after m years
Section 5.3 Diagonalization of Matrices Definition Example: stochastic matrix To City Suburbs From City Suburbs.85.03 = A.15.97 City.15.85 Suburbs.97.03 probability matrix of a sample person s residence
More informationHigh-Gain Observers in Nonlinear Feedback Control. Lecture # 2 Separation Principle
High-Gain Observers in Nonlinear Feedback Control Lecture # 2 Separation Principle High-Gain ObserversinNonlinear Feedback ControlLecture # 2Separation Principle p. 1/4 The Class of Systems ẋ = Ax + Bφ(x,
More informationLecture 4 Eigenvalue problems
Lecture 4 Eigenvalue problems Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
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 informationEE263: Introduction to Linear Dynamical Systems Review Session 5
EE263: Introduction to Linear Dynamical Systems Review Session 5 Outline eigenvalues and eigenvectors diagonalization matrix exponential EE263 RS5 1 Eigenvalues and eigenvectors we say that λ C is an eigenvalue
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 informationav 1 x 2 + 4y 2 + xy + 4z 2 = 16.
74 85 Eigenanalysis The subject of eigenanalysis seeks to find a coordinate system, in which the solution to an applied problem has a simple expression Therefore, eigenanalysis might be called the method
More information3 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
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 informationNonlinear Control Systems
Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f
More informationLecture Note 5: Semidefinite Programming for Stability Analysis
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State
More informationLecture 15 Perron-Frobenius Theory
EE363 Winter 2005-06 Lecture 15 Perron-Frobenius Theory Positive and nonnegative matrices and vectors Perron-Frobenius theorems Markov chains Economic growth Population dynamics Max-min and min-max characterization
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 informationSYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER
SYSTEMTEORI - ÖVNING 5: FEEDBACK, POLE ASSIGNMENT AND OBSERVER Exercise 54 Consider the system: ẍ aẋ bx u where u is the input and x the output signal (a): Determine a state space realization (b): Is the
More informationTight Robust interval observers: an LP approach
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec 9-, 28 WeB36 Tight Robust interval observers: an LP approach M Ait Rami, C H Cheng and C de Prada Abstract This paper
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 informationSTRUCTURE MATTERS: Some Notes on High Gain Observer Design for Nonlinear Systems. Int. Conf. on Systems, Analysis and Automatic Control 2012
Faculty of Electrical and Computer Engineering Institute of Control Theory STRUCTURE MATTERS: Some Notes on High Gain Observer Design for Nonlinear Systems Klaus Röbenack Int. Conf. on Systems, Analysis
More informationIntroduction to Nonlinear Control Lecture # 4 Passivity
p. 1/6 Introduction to Nonlinear Control Lecture # 4 Passivity È p. 2/6 Memoryless Functions ¹ y È Ý Ù È È È È u (b) µ power inflow = uy Resistor is passive if uy 0 p. 3/6 y y y u u u (a) (b) (c) Passive
More informationDense LU factorization and its error analysis
Dense LU factorization and its error analysis Laura Grigori INRIA and LJLL, UPMC February 2016 Plan Basis of floating point arithmetic and stability analysis Notation, results, proofs taken from [N.J.Higham,
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 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 informationProblem Set 3: Solution Due on Mon. 7 th Oct. in class. Fall 2013
EE 56: Digital Control Systems Problem Set 3: Solution Due on Mon 7 th Oct in class Fall 23 Problem For the causal LTI system described by the difference equation y k + 2 y k = x k, () (a) By first finding
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 informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationStability, Pole Placement, Observers and Stabilization
Stability, Pole Placement, Observers and Stabilization 1 1, The Netherlands DISC Course Mathematical Models of Systems Outline 1 Stability of autonomous systems 2 The pole placement problem 3 Stabilization
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 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 informationA basic canonical form of discrete-time compartmental systems
Journal s Title, Vol x, 200x, no xx, xxx - xxx A basic canonical form of discrete-time compartmental systems Rafael Bru, Rafael Cantó, Beatriz Ricarte Institut de Matemàtica Multidisciplinar Universitat
More informationLinear System Theory
Linear System Theory Wonhee Kim Lecture 3 Mar. 21, 2017 1 / 38 Overview Recap Nonlinear systems: existence and uniqueness of a solution of differential equations Preliminaries Fields and Vector Spaces
More informationOn the simultaneous diagonal stability of a pair of positive linear systems
On the simultaneous diagonal stability of a pair of positive linear systems Oliver Mason Hamilton Institute NUI Maynooth Ireland Robert Shorten Hamilton Institute NUI Maynooth Ireland Abstract In this
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 informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More information1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0
Numerical Analysis 1 1. Nonlinear Equations This lecture note excerpted parts from Michael Heath and Max Gunzburger. Given function f, we seek value x for which where f : D R n R n is nonlinear. f(x) =
More informationSymmetric Matrices and Eigendecomposition
Symmetric Matrices and Eigendecomposition Robert M. Freund January, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 2 1 Symmetric Matrices and Convexity of Quadratic Functions
More informationAn alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions - Corrected Version
1 An alternative proof of the Barker, Berman, Plemmons (BBP) result on diagonal stability and extensions - Corrected Version Robert Shorten 1, Oliver Mason 1 and Christopher King 2 Abstract The original
More information21 Linear State-Space Representations
ME 132, Spring 25, UC Berkeley, A Packard 187 21 Linear State-Space Representations First, let s describe the most general type of dynamic system that we will consider/encounter in this class Systems may
More informationNonlinear Control Lecture 5: Stability Analysis II
Nonlinear Control Lecture 5: Stability Analysis II Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2010 Farzaneh Abdollahi Nonlinear Control Lecture 5 1/41
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 informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More information16. Local theory of regular singular points and applications
16. Local theory of regular singular points and applications 265 16. Local theory of regular singular points and applications In this section we consider linear systems defined by the germs of meromorphic
More informationOn families of anticommuting matrices
On families of anticommuting matrices Pavel Hrubeš December 18, 214 Abstract Let e 1,..., e k be complex n n matrices such that e ie j = e je i whenever i j. We conjecture that rk(e 2 1) + rk(e 2 2) +
More informationState will have dimension 5. One possible choice is given by y and its derivatives up to y (4)
A Exercise State will have dimension 5. One possible choice is given by y and its derivatives up to y (4 x T (t [ y(t y ( (t y (2 (t y (3 (t y (4 (t ] T With this choice we obtain A B C [ ] D 2 3 4 To
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 informationStabilization and Passivity-Based Control
DISC Systems and Control Theory of Nonlinear Systems, 2010 1 Stabilization and Passivity-Based Control Lecture 8 Nonlinear Dynamical Control Systems, Chapter 10, plus handout from R. Sepulchre, Constructive
More informationAn Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace
An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace Takao Fujimoto Abstract. This research memorandum is aimed at presenting an alternative proof to a well
More informationHankel Optimal Model Reduction 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Hankel Optimal Model Reduction 1 This lecture covers both the theory and
More informationControl engineering sample exam paper - Model answers
Question Control engineering sample exam paper - Model answers a) By a direct computation we obtain x() =, x(2) =, x(3) =, x(4) = = x(). This trajectory is sketched in Figure (left). Note that A 2 = I
More 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 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 informationKey words. Complementarity set, Lyapunov rank, Bishop-Phelps cone, Irreducible cone
ON THE IRREDUCIBILITY LYAPUNOV RANK AND AUTOMORPHISMS OF SPECIAL BISHOP-PHELPS CONES M. SEETHARAMA GOWDA AND D. TROTT Abstract. Motivated by optimization considerations we consider cones in R n to be called
More informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
More informationDiscrete 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
More informationControl Systems. Time response
Control Systems Time response L. Lanari outline zero-state solution matrix exponential total response (sum of zero-state and zero-input responses) Dirac impulse impulse response change of coordinates (state)
More informationLecture 1: Review of linear algebra
Lecture 1: Review of linear algebra Linear functions and linearization Inverse matrix, least-squares and least-norm solutions Subspaces, basis, and dimension Change of basis and similarity transformations
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationLinear algebra for computational statistics
University of Seoul May 3, 2018 Vector and Matrix Notation Denote 2-dimensional data array (n p matrix) by X. Denote the element in the ith row and the jth column of X by x ij or (X) ij. Denote by X j
More informationTheorem 1. ẋ = Ax is globally exponentially stable (GES) iff A is Hurwitz (i.e., max(re(σ(a))) < 0).
Linear Systems Notes Lecture Proposition. A M n (R) is positive definite iff all nested minors are greater than or equal to zero. n Proof. ( ): Positive definite iff λ i >. Let det(a) = λj and H = {x D
More informationMath113: Linear Algebra. Beifang Chen
Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary
More informationx 3y 2z = 6 1.2) 2x 4y 3z = 8 3x + 6y + 8z = 5 x + 3y 2z + 5t = 4 1.5) 2x + 8y z + 9t = 9 3x + 5y 12z + 17t = 7
Linear Algebra and its Applications-Lab 1 1) Use Gaussian elimination to solve the following systems x 1 + x 2 2x 3 + 4x 4 = 5 1.1) 2x 1 + 2x 2 3x 3 + x 4 = 3 3x 1 + 3x 2 4x 3 2x 4 = 1 x + y + 2z = 4 1.4)
More informationACM/CMS 107 Linear Analysis & Applications Fall 2016 Assignment 4: Linear ODEs and Control Theory Due: 5th December 2016
ACM/CMS 17 Linear Analysis & Applications Fall 216 Assignment 4: Linear ODEs and Control Theory Due: 5th December 216 Introduction Systems of ordinary differential equations (ODEs) can be used to describe
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 informationEigenvalues and Eigenvectors
/88 Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Eigenvalue Problem /88 Eigenvalue Equation By definition, the eigenvalue equation for matrix
More informationModeling and Analysis of Dynamic Systems
Modeling and Analysis of Dynamic Systems Dr. Guillaume Ducard Fall 2017 Institute for Dynamic Systems and Control ETH Zurich, Switzerland G. Ducard c 1 / 57 Outline 1 Lecture 13: Linear System - Stability
More informationCSL361 Problem set 4: Basic linear algebra
CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices
More informationNonlinear Programming Algorithms Handout
Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are
More informationSolution via Laplace transform and matrix exponential
EE263 Autumn 2015 S. Boyd and S. Lall Solution via Laplace transform and matrix exponential Laplace transform solving ẋ = Ax via Laplace transform state transition matrix matrix exponential qualitative
More informationThe goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T
1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationECEN 420 LINEAR CONTROL SYSTEMS. Lecture 6 Mathematical Representation of Physical Systems II 1/67
1/67 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 6 Mathematical Representation of Physical Systems II State Variable Models for Dynamic Systems u 1 u 2 u ṙ. Internal Variables x 1, x 2 x n y 1 y 2. y m Figure
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 informationLecture 15: Multivariate normal distributions
Lecture 15: Multivariate normal distributions Normal distributions with singular covariance matrices Consider an n-dimensional X N(µ,Σ) with a positive definite Σ and a fixed k n matrix A that is not of
More informationApplications of Controlled Invariance to the l 1 Optimal Control Problem
Applications of Controlled Invariance to the l 1 Optimal Control Problem Carlos E.T. Dórea and Jean-Claude Hennet LAAS-CNRS 7, Ave. du Colonel Roche, 31077 Toulouse Cédex 4, FRANCE Phone : (+33) 61 33
More informationModule 02 CPS Background: Linear Systems Preliminaries
Module 02 CPS Background: Linear Systems Preliminaries Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html August
More information