Chap. 3. Controlled Systems, Controllability
|
|
- Jessie Leonard
- 6 years ago
- Views:
Transcription
1 Chap. 3. Controlled Systems, Controllability
2 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 : of size n n and B : of size n m. Definition The pair (A, B) is controllable if, given a duration T > 0 and two arbitrary points x 0, x T R n, there exists a piecewise continuous function t ū(t) from [0, T ] to R m, such that the integral curve x(t) generated by ū with x(0) = x 0, satisfies x(t ) = x T.
3 In other words e AT x 0 + T 0 e A(T t) Bū(t)dt = x T. This property depends only on A and B : Theorem (Kalman) A necessary and sufficient condition for (A, B) to be controllable is ( ) rank C = rank B AB A n 1 B = n. C is called Kalman s controllability matrix (of size n nm).
4 Proof Without loss of generality, we can consider that x 0 = 0 by changing x T in y T = x T e AT x 0 since T Consider the matrices 0 e A(T t) Bū(t)dt = y T = x T e AT x 0. C(t) = e A(T t) B, G = where C : transposed matrix of C. We prove 2 lemmas. T 0 C(t)C (t)dt
5 Lemma 1 A necessary and sufficient condition for (A, B) to be controllable is that G is invertible. Assume G invertible. It suffices to set : ū(t) = B e A (T t) G 1 y T. Thus T 0 e A(T t) Bū(t)dt = T 0 = GG 1 y T = y T and ū generates the required trajectory. The converse is immediate. e A(T t) BB e A (T t) G 1 y T dt
6 Lemma 2 Invertibility of G is equivalent to rank C = n. By contradiction, if G isn t invertible, v R n, v 0, such that v G = 0. Thus v Gv = T 0 v C(t)C (t)vdt = 0. Since v v C(t)C (t)v : quadratic form 0, T 0 v C(t)C (t)vdt = 0 implies v C(t)C (t)v = 0 t [0, T ]. Thus : v C(t) = 0 t [0; T ]. But v C(t) = v e A(T t) B = v I + i 1 A i(t t)i B = 0 i! implies that v B = 0, v A i B = 0 pour tout i 1 or v C = 0 with v 0, thus : rank C < n.
7 Conversely, if rank C < n, v 0 such that v C = 0. Thus, according to what precedes, v A i B = 0 for i = 0,..., n 1. By Cayley-Hamilton Theorem, A n+i, i 0, is a linear combination of the A j s, j = 1,..., n 1. Thus v A i B = 0, i 0 or v G = 0, which proves the Theorem.
8 Examples ẋ 1 = x 2, ( ) 0 is controllable : B =, A = ( ) C = and rank C = x 2 = u ( ) 0 1, 0 0 ẋ 1 = u, ( 1 isn t controllable : B = ( ) C = and rank C = ), A = x 2 = u ( ) 0 0, 0 0 Note : ẋ 1 ẋ 2 : 0, or x 1 x 2 = Cste : relation between states independent of u.
9 1.2. Controllability Canonical Form Définition Two systems ẋ = Ax + Bu, ż = F z + Gv are said equivalent by change of coordinates and feedback (we note (A, B) (F, G)) iff there exist invertible matrices M and L and a matrix K such that { ẋ = Ax + Bu = ż = F z + Gv z = Mx, v = Kx + Lu and conversely. M : change of coordinates, invertible of size n n, and K and L : feedback gains, with L invertible of size m m and K of size m n. Changes of coordinates preserve the state dimension and (non degenerate) feedbacks preserve the input dimension.
10 The relation is an equivalence relation : reflexive : (A, B) (A, B) (M = I n, K = 0 and L = I m ) symmetric : x = M 1 z and u = L 1 KM 1 z + L 1 v transitive : if (A, B) (F, G) and (F, G) (H, J), z = Mx, v = Kx + Lu imply ż = F z + Gv and s = T z, w = Nz + P v imply ṡ = Hs + Jw. Thus s = T Mx, w = (NM + P K)x + P Lu. Note that F = M(A BL 1 K)M 1, G = MBL 1.
11 The Single Input Case with (A, b) controllable : ẋ = Ax + bu rank C = rank ( b Ab... A n 1 b ) = n. One can construct the matrices M, K and L that transform the system in its canonical form, ż = F z + gv or F = , g = ż 1 = z 2,..., ż n 1 = z n, ż n = v
12 The Multi Input Case (m > 1) : The controllability matrix ẋ = Ax + Bu, B = ( b 1... b n ). C = ( b 1 Ab 1... A n 1 b 1... b m Ab m... A n 1 b m ) has rank n and one can construct a sequence of integers n 1,..., n m called controllability indices such that with n n m = n C = ( b 1 Ab 1... A n 1 1 b 1... b m Ab m... A n m 1 b m ) of size n n, invertible. The controllability indices n 1,..., n m exist for all controllable linear systems, are defined up to permutation and are invariant by change of coordinates and feedback.
13 Theorem (Brunovsky) : Every linear system with n states and m inputs is equivalent by change of coordinates and feedback to the canonical form F = diag{f 1,..., F m }, G = diag{g 1,..., g m } where each pair F i, g i is given by F i = , g i = with F i of size n i n i and g i of size n i , i = 1,..., m Consequences : trajectory planning, feedback design.
14 1.3. Trajectory Planning ẋ = Ax + bu n states, 1 input, controllable. System equivalent to ż = F z + gv with z = Mx, v = Kx + Lu. We want to start from x(0) = x 0 at t = 0 with u(0) = u 0, and arrive at x(t ) = x T at t = T with u(t ) = u T. We translate these conditions on z and v : Setting y = z 1, we have z(0) = Mx 0, v(0) = Kx 0 + Lu 0 z(t ) = Mx T, v(t ) = Kx T + Lu T y (i) = z i+1, i = 0,..., n 1, y (n) = v. The initial and final conditions are interpreted as conditions on the successive derivatives of y up to order n at times 0 and T.
15 Given a curve t [0, T ] y ref (t) R, of class C n, satisfying the initial and final conditions. All the other system variables may be obtained by differentiation of y ref, and without integrating the system s equations. We have v ref = y (n) ref and u ref = L 1 KM 1 z ref + L 1 v ref, with z ref = (y ref, ẏ ref,..., y (n 1) ref ). Accordingly x ref = M 1 z ref. The input u ref exactly generates ẋ ref = Ax ref + bu ref.
16 The previous y-trajectory may be obtained by polynomial interpolation : y ref (t) = 2n+1 i=0 a i ( t T ) i. with a 0,..., a 2n+1 computed from the successive derivatives of y ref at times 0 and T : y (k) ref (t) = 1 T k 2n+1 i=k i(i 1) (i k + 1)a i ( t T ) i k
17 At t = 0 : and at t = T : y ref (0) = a 0 y (k) k! ref (0) = T ka k, k = 1,..., n 1, v ref (0) = n! T na n y (k) ref (T ) = 1 T k y ref (T ) = 2n+1 i=k v ref (T ) = 1 T n 2n+1 i=0 a i, i! (i k)! a i, k = 1,..., n 1, 2n+1 i=n i! (i n)! a i
18 Thus a 0 = y ref (0), a k = T k k! y(k) ref (0), k = 1,..., n 1, a n = T n n! v ref(0) n + 1 n + 2 2n + 1 a (n + 1)n (n + 2)(n + 1) (2n + 1)2n n+1... a 2n+1 (n+2)! (2n+1)! (n + 1)! 2... (n+1)! y ref (T ) n i=0 a i. = T k y (k) ref (T ) n i=k i! (i k)! a i. T n v ref (T ) n!a n
19 1.4. Trajectory Tracking, Pole Placement Assume that the state x is measured at every time. We want to follow the reference trajectory y ref, the system being perturbed by non modelled disturbances. Note e = y y ref the deviation between the measured trajectory and its reference. We have e (n) = v v ref. Note v v ref = n 1 i=0 K ie (i), the gains K i being arbitrary. Thus or ė. e (n) = e (n) = n 1 i=0 K i e (i) K 0 K 1 K 2... K n 1 e ė. e (n 1).
20 the gains K i are the coefficients of the characteristic polynomial of the closed-loop matrix A + BK. Theorem If the system ẋ = Ax+Bu is controllable, the eigenvalues of A+BK may be placed arbitrarily in the complex plane by a suitable feedback u = Kx. Corollary A controllable linear system is stabilizable and, by state feedback, all its characteristic exponents can be arbitrarily chosen.
21 2. First Order Controllability of Nonlinear Systems Consider the nonlinear system ẋ = f(x, u) with x X, n-dimensional manifold, and u R m. Its tangent linear system around the equilibrium point ( x, ū) is given by with A = f f x ( x, ū), B = u ( x, ū). ξ = Aξ + Bv Definition We say that a nonlinear system is first order controllable around an equilibrium point ( x, ū) if its tangent linear system at ( x, ū) is controllable, i.e. iff rank C = n, with C = ( B AB A n 1 B ).
22 Definition We say that a nonlinear system is locally controllable around an equilibrium point ( x, ū) if : for all ε > 0, there exists η > 0 such that for every pair of points (x 0, x 1 ) R n R n satisfying x 0 x < η and x 1 x < η, there exists a piecewise continuous control ũ on [0, ε] such that ũ(t) < ε t [0, ε] and X ε (x 0, ũ) = x 1, where X ε (x 0, ũ) is the integral curve at time ε, generated from x 0 at time 0 with the control ũ. Theorem If a nonlinear system is first-order controllable at the equilibrium point ( x, ū), it is locally controllable at ( x, ū).
23 Remark The scalar system : ẋ = u 3 is locally controllable but not first-order controllable. To join x 0 and x 1 in duration T = ε, x 0 and x 1 arbitrarily chosen close to 0, one can use the motion planning approach : ( ) t 2 ( x(t) = x 0 + (x 1 x 0 ) 3 2 t ). ε ε Thus u(t) = ( ẋ(t) ) 1 ( ( ) 3 = 6 x1 x (tε ) ( 0 ε 1 t ) ) 1 3 ε. One easily checks that if x 0 < η and x 1 < η with η < ε4 3 then u(t) < ε, which proves the local controllability. On the contrary, at the equilibrium point (0, 0), the tangent linear system is ẋ = 0, and is indeed not first-order controllable.
24 3. Local Controllability and Lie Brackets For simplicity s sake, the system is assumed affine in the control, i.e. m ẋ = f 0 (x) + u i f i (x) with f 0 (0) = 0, (( x, ū) = (0, 0) is an equilibrium point). From the vector fields f 0,..., f m, we construct the sequence of distributions : i=1 D 0 = span{f 1,..., f m }, D i+1 = [f 0, D i ] + D i, i 1 where D i is the involutive closure of the distribution D i.
25 Proposition 3.1 The sequence of distributions D i is non decreasing, i.e. D i D i+1 for all i, and there exists an integer k and an involutive distribution D such that D k = D k +r = D for all r 0. Moreover, D enjoys the two following properties : (i) span{f 1,..., f m } D (ii) [f 0, D ] D. Proof D i [f 0, D i ] + D i = D i+1 D i+1. Thus, there exists a largest D, with D = D. But : rank D i+1 rank D i + 1 for small i = 0, 1,.... thus, there exists k n such that D k = D k +r = D. Moreover, D 0 D : (i), and D = [f 0, D ] + D implies [f 0, D ] D : (ii).
26 Proposition 3.2 Let D be involutive with constant rank equal to k in an open U, satisfying (ii). There exists a diffeomorphism ϕ such that, if we note : { ξi = ϕ i (x), i = 1,..., k we have : ϕ f 0 (ξ, ζ) = ζ j = ϕ k+j (x), k i=1 where the γ i s are C functions. Proof We have ϕ f 0 (ξ, ζ) = γ i (ξ, ζ) ξ i + k i=1 j = 1,..., n k n k i=1 γ i (ξ, ζ) ξ i + γ k+i (ζ) ζ i n k i=1 But, by Frobenius Theorem, D = span{ ξ 1,..., ξk }. By (ii), we have [ϕ f 0, ξ i ] D for all i = 1,..., k. But : γ k+i (ξ, ζ) ζ i.
27 [ϕ f 0, ξ i ] = + k j=1 n k j=1 = ( γ j [, ξ j ( γ k+j [, ζ j k j=1 γ j ξ i ξ j ξ i ] γ j ξ i ξ j ) ξ i ] γ k+j ξ i n k j=1 γ k+j ξ i ζ j ζ j ) D Thus γ k+j = 0 for all i, j, or γ ξ k+j depends only of ζ, which proves i the Proposition.
28 Theorem Let D be defined as in Proposition 3.1, satisfying (i) and (ii). A necessary condition for the system to be locally controllable around the origin is that rank D (x) = n, x U where U is a neighborhood of the origin. Proof By contradiction. Assume that D satisfies (i), (ii) and rank D (x) = k < n, x U Using (i), the image by ϕ of f i, i = 1,..., m, is ϕ f i = k j=1 η i,j ξ j.
29 Therefore, ϕ f 0 + = m u i f i = (ϕ f 0 ) + i=1 k γ j (ξ, ζ) + j=1 m u i (ϕ f i ) i=1 m u i η i,j (ξ, ζ) + ξ j i=1 n k j=1 In other words, in these coordinates, the system reads m ξ j = γ j (ξ, ζ) + u i η i,j (ξ, ζ), j = 1,..., k i=1 ζ j = γ k+j (ζ), j = 1,..., n k and the ζ part is not controllable, which achieves the proof. γ k+j (ζ) ζ j.
30 Denote by Lie{f 0,..., f m } the Lie algebra generated by the linear combinations of f 0,..., f m and all their Lie brackets. Lie{f 0,..., f m }(x) is the vector space generated by the vectors of Lie{f 0,..., f m } at the point x. By construction, D Lie{f 0,..., f m } but the equality doesn t hold true in general. Theorem Assume that the m+1 vector fields f 0,..., f m are analytic. Local controllability at x = 0, u = 0, implies : Lie{f 0,..., f m }(x) = T x R n, x X. Remark If f 0 0, we have D = Lie{f 1,..., f m }. Thus, if f 1,..., f m are analytic, local controllability is equivalent to rank D = n in some open set.
31 Example ẋ 1 = x 2 2, ẋ 2 = u Equilibrium point (x 1, 0), x 1 arbitrary. D 0 = span{f 1 } = span{ x } and D 2 0 = D 0 ; D 1 = span{f 1, [f 0, f 1 ]} = span{ x, x 2 2 x1 }, has rank 2 and is involutive if x 2 0. But [f 1, [f 0, f 1 ]] = 2 x D 1 1 (x 1, 0), thus D = D 1 (x 1, 0) = span{ x, 2 x1 }. However, if x 1 > 0, one cannot reach points such that x 1 < 0. Thus the rank condition is necessary but not sufficient for local controllability!
32 Remark For general systems : ẋ = f(x, u) one can use the previous formalism by setting u i = v i, i = 1,..., m since ẋ = f(x, u) u 1 = v 1. u m = v m has the required affine form.
33 Remark The rank condition for linear systems : m ẋ = Ax + u i b i Set and i=1 f 0 (x) = Ax = n i=1 ( nj=1 A i,j x j ) xi f i (x) = b i = n j=1 b i,j xj, i = 1,..., m. D 0 = span{b 1,..., b m }. D 0 = D 0 since [b i, b j ] = 0 for all i, j. [Ax, b i ] = = n j,k=1 n j=1 b i,j x j b i,j A k,j x k n n A k,l x l x l=1 k n (Ab i ) j k=1 j=1 x j = Ab i.
34 Thus D 1 = [Ax, D 0 ] + D 0 = span{b 1,..., b m, Ab 1,..., Ab m }. and D 1 involutive (made of constant vector fields). We have D k = span{b 1,..., b m, Ab 1,..., Ab m,..., A k b 1,..., A k b m } for all k 1. There exists k < n such that D k = D and rank D (x) = rank C for all x U.
35 4. Some Extensions using Module Theory 4.1. Recalls on Modules Consider : K a principal ideal ring (not necessarily commutative) M a group and an external product K M M, i.e. satisfying αm M for all α K and m M. M is a module if and only if the external product satisfies : (αβ)m = α(βm) and (α + β)m = αm + βm for all α, β K and all m M. Remark If K is a field, then M is a vector-space.
36 Examples K = R[ dt d ] the set of polynomials of dt d with coefficients in R, and let {x 1,..., x n } be a basis of R n. Let M be made of all vectors of the form n k i d j x n a i i,j dt j = k i a i,j x (j) i i=1 j=1 with k 1,..., k n arbitrary integers. M is a finitely generated K-module. Let K be the field of meromorphic functions of t, K = K[ dt d ] and let {x 1,..., x n } be a basis of R n. Let M be made of all vectors of the form n i=1 k i j=1 i=1 j=1 a i,j (t)x (j) i with k 1,..., k n arbitrary integers and the a i,j s meromorphic functions. Then M is a finitely generated K-module.
37 Let M be a K-module. An element m M, m 0, is said to be torsion if there exists α K, α 0, such that αm = 0. We denote by T the set of all torsion elements of M. It is obviously a submodule of M, called the torsion submodule. We say that a K-module F is free if and only if for every m F, m 0, αm = 0, with α K, implies α = 0. We have Proposition 1 Let K = K[ dt d ] where K is a field. (i) A finitely generated module M can be uniquely decomposed into a torsion sub-module T and a free sub-module F : M = T F. (ii) It is free if and only if T = {0}.
38 4.2. Linear Systems Let K = K[ dt d ], where K is a field, and M a finitely generated K- module. Let A(τ) be a (n m) n polynomial matrix of τ = dt d with coefficients in K. We consider the linear system in M A(τ)x = 0. The quotient of M by the lines of this system is again a finitely generated K-module. Therefore, the data of a linear system is equivalent to the one of a finitely generated K-module. Definition. (Fliess, 1990) Given a finitely generated K-module M, we say that the associated linear system is controllable if and only if M is free.
39 Example Consider the n-dimensional time-varying linear system ẋ = F (t)x + G(t)u with u R m, F and G meromorphic w.r.t. t in a given open interval of R, and rank G(t) = m for every t in this interval. It reads ( dt d I F (t))x = G(t)u. Let C be a (n m) n matrix such that C(t)B(t) = 0 with rank C(t) = n m for every t. We have A( d def )x = C(t)( d dt dt I F (t))x = 0 thus A( dt d ) = C(t)( dt d I F (t)) is a (n m) n matrix with coefficients in K = K[ dt d ], with K the field of meromorphic functions of t. The linear system is equivalent to the set of linear equations A( d )x = 0. dt
40 We denote by M the finitely generated K-module generated by a basis of R n and M 0 its quotient submodule generated by the lines of A( dt d )x = 0. Assume that the pair (F, G) is not controllable. By Kalman s decomposition, there exists a k-dimensional subspace, described by the set of n k independent equations K(t)x = 0 such that the n k-dimensional quotient subsystem is controllable. Clearly, K K and the set {x Kx = 0} is the torsion submodule of M 0 which is thus not free. Consequently, M 0 is free if the pair (F, G) is controllable in the usual sense. The converse follows the same lines.
41 Remarks. This definition is independent of the system variables description. For 1st order controllable nonlinear systems, the tangent linear approximation at any point constitutes a linear time-varying system whose module is free.
Module 07 Controllability and Controller Design of Dynamical LTI Systems
Module 07 Controllability and Controller Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha October
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 informationMathematics for Control Theory
Mathematics for Control Theory Geometric Concepts in Control Involutivity and Frobenius Theorem Exact Linearization Hanz Richter Mechanical Engineering Department Cleveland State University Reading materials
More informationControl, Stabilization and Numerics for Partial Differential Equations
Paris-Sud, Orsay, December 06 Control, Stabilization and Numerics for Partial Differential Equations Enrique Zuazua Universidad Autónoma 28049 Madrid, Spain enrique.zuazua@uam.es http://www.uam.es/enrique.zuazua
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 informationChapter 6. Differentially Flat Systems
Contents CAS, Mines-ParisTech 2008 Contents Contents 1, Linear Case Introductory Example: Linear Motor with Appended Mass General Solution (Linear Case) Contents Contents 1, Linear Case Introductory Example:
More informationChap. 1. Some Differential Geometric Tools
Chap. 1. Some Differential Geometric Tools 1. Manifold, Diffeomorphism 1.1. The Implicit Function Theorem ϕ : U R n R n p (0 p < n), of class C k (k 1) x 0 U such that ϕ(x 0 ) = 0 rank Dϕ(x) = n p x U
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 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 information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
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 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 informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationMCE693/793: Analysis and Control of Nonlinear Systems
MCE693/793: Analysis and Control of Nonlinear Systems Input-Output and Input-State Linearization Zero Dynamics of Nonlinear Systems Hanz Richter Mechanical Engineering Department Cleveland State University
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 informationLecture 2: Controllability of nonlinear systems
DISC Systems and Control Theory of Nonlinear Systems 1 Lecture 2: Controllability of nonlinear systems Nonlinear Dynamical Control Systems, Chapter 3 See www.math.rug.nl/ arjan (under teaching) for info
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 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 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 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 informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationAlgebra II. Paulius Drungilas and Jonas Jankauskas
Algebra II Paulius Drungilas and Jonas Jankauskas Contents 1. Quadratic forms 3 What is quadratic form? 3 Change of variables. 3 Equivalence of quadratic forms. 4 Canonical form. 4 Normal form. 7 Positive
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 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 informationExamples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More informationDecay rates for partially dissipative hyperbolic systems
Outline Decay rates for partially dissipative hyperbolic systems Basque Center for Applied Mathematics Bilbao, Basque Country, Spain zuazua@bcamath.org http://www.bcamath.org/zuazua/ Numerical Methods
More informationIntroduction to Geometric Control
Introduction to Geometric Control Relative Degree Consider the square (no of inputs = no of outputs = p) affine control system ẋ = f(x) + g(x)u = f(x) + [ g (x),, g p (x) ] u () h (x) y = h(x) = (2) h
More informationInfinite-Dimensional Triangularization
Infinite-Dimensional Triangularization Zachary Mesyan March 11, 2018 Abstract The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector
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 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 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 information1 Flat, Smooth, Unramified, and Étale Morphisms
1 Flat, Smooth, Unramified, and Étale Morphisms 1.1 Flat morphisms Definition 1.1. An A-module M is flat if the (right-exact) functor A M is exact. It is faithfully flat if a complex of A-modules P N Q
More informationfy (X(g)) Y (f)x(g) gy (X(f)) Y (g)x(f)) = fx(y (g)) + gx(y (f)) fy (X(g)) gy (X(f))
1. Basic algebra of vector fields Let V be a finite dimensional vector space over R. Recall that V = {L : V R} is defined to be the set of all linear maps to R. V is isomorphic to V, but there is no canonical
More informationReview of Controllability Results of Dynamical System
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 13, Issue 4 Ver. II (Jul. Aug. 2017), PP 01-05 www.iosrjournals.org Review of Controllability Results of Dynamical System
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 informationFeedback Linearization
Feedback Linearization Peter Al Hokayem and Eduardo Gallestey May 14, 2015 1 Introduction Consider a class o single-input-single-output (SISO) nonlinear systems o the orm ẋ = (x) + g(x)u (1) y = h(x) (2)
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationLECTURE 25-26: CARTAN S THEOREM OF MAXIMAL TORI. 1. Maximal Tori
LECTURE 25-26: CARTAN S THEOREM OF MAXIMAL TORI 1. Maximal Tori By a torus we mean a compact connected abelian Lie group, so a torus is a Lie group that is isomorphic to T n = R n /Z n. Definition 1.1.
More informationMulti-Robotic Systems
CHAPTER 9 Multi-Robotic Systems The topic of multi-robotic systems is quite popular now. It is believed that such systems can have the following benefits: Improved performance ( winning by numbers ) Distributed
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 informationM.6. Rational canonical form
book 2005/3/26 16:06 page 383 #397 M.6. RATIONAL CANONICAL FORM 383 M.6. Rational canonical form In this section we apply the theory of finitely generated modules of a principal ideal domain to study the
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 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 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 informationCALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M =
CALCULUS ON MANIFOLDS 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M = a M T am, called the tangent bundle, is itself a smooth manifold, dim T M = 2n. Example 1.
More informationMath 530 Lecture Notes. Xi Chen
Math 530 Lecture Notes Xi Chen 632 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca 1991 Mathematics Subject Classification. Primary
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 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 informationSince G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =
Problem 1 Show that if π is an irreducible representation of a compact lie group G then π is also irreducible. Give an example of a G and π such that π = π, and another for which π π. Is this true for
More informationQ N id β. 2. Let I and J be ideals in a commutative ring A. Give a simple description of
Additional Problems 1. Let A be a commutative ring and let 0 M α N β P 0 be a short exact sequence of A-modules. Let Q be an A-module. i) Show that the naturally induced sequence is exact, but that 0 Hom(P,
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More informationABSTRACT NONSINGULAR CURVES
ABSTRACT NONSINGULAR CURVES Affine Varieties Notation. Let k be a field, such as the rational numbers Q or the complex numbers C. We call affine n-space the collection A n k of points P = a 1, a,..., a
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 informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationEcon 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis
Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms De La Fuente notes that, if an n n matrix has n distinct eigenvalues, it can be diagonalized. In this supplement, we will provide
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 informationHigh-Gain Observers in Nonlinear Feedback Control. Lecture # 3 Regulation
High-Gain Observers in Nonlinear Feedback Control Lecture # 3 Regulation High-Gain ObserversinNonlinear Feedback ControlLecture # 3Regulation p. 1/5 Internal Model Principle d r Servo- Stabilizing u y
More informationMatrices A brief introduction
Matrices A brief introduction Basilio Bona DAUIN Politecnico di Torino Semester 1, 2014-15 B. Bona (DAUIN) Matrices Semester 1, 2014-15 1 / 44 Definitions Definition A matrix is a set of N real or complex
More informationLECTURE NOTES AMRITANSHU PRASAD
LECTURE NOTES AMRITANSHU PRASAD Let K be a field. 1. Basic definitions Definition 1.1. A K-algebra is a K-vector space together with an associative product A A A which is K-linear, with respect to which
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 informationGeneric Picard-Vessiot extensions for connected by finite groups Kolchin Seminar in Differential Algebra October 22nd, 2005
Generic Picard-Vessiot extensions for connected by finite groups Kolchin Seminar in Differential Algebra October 22nd, 2005 Polynomial Galois Theory case Noether first introduced generic equations in connection
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationGENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION
GENERALIZED EIGENVECTORS, MINIMAL POLYNOMIALS AND THEOREM OF CAYLEY-HAMILTION FRANZ LUEF Abstract. Our exposition is inspired by S. Axler s approach to linear algebra and follows largely his exposition
More informationExercise Sheet 7 - Solutions
Algebraic Geometry D-MATH, FS 2016 Prof. Pandharipande Exercise Sheet 7 - Solutions 1. Prove that the Zariski tangent space at the point [S] Gr(r, V ) is canonically isomorphic to S V/S (or equivalently
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationIDEAL CLASSES AND RELATIVE INTEGERS
IDEAL CLASSES AND RELATIVE INTEGERS KEITH CONRAD The ring of integers of a number field is free as a Z-module. It is a module not just over Z, but also over any intermediate ring of integers. That is,
More informationDuality of finite-dimensional vector spaces
CHAPTER I Duality of finite-dimensional vector spaces 1 Dual space Let E be a finite-dimensional vector space over a field K The vector space of linear maps E K is denoted by E, so E = L(E, K) This vector
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 informationMathematical Systems Theory: Advanced Course Exercise Session 5. 1 Accessibility of a nonlinear system
Mathematical Systems Theory: dvanced Course Exercise Session 5 1 ccessibility of a nonlinear system Consider an affine nonlinear control system: [ ẋ = f(x)+g(x)u, x() = x, G(x) = g 1 (x) g m (x) ], where
More informationThe local structure of affine systems
The local structure of affine systems César Aguilar and Andrew D. Lewis Department of Mathematics and Statistics, Queen s University 05/06/2008 C. Aguilar, A. Lewis (Queen s University) The local structure
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationThe disturbance decoupling problem (DDP)
CHAPTER 3 The disturbance decoupling problem (DDP) Consider the system 3.1. Geometric formulation { ẋ = Ax + Bu + Ew y = Cx. Problem 3.1 (Disturbance decoupling). Find a state feedback u = Fx+ v such that
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 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 information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
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 informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More information(VI.C) Rational Canonical Form
(VI.C) Rational Canonical Form Let s agree to call a transformation T : F n F n semisimple if there is a basis B = { v,..., v n } such that T v = λ v, T v 2 = λ 2 v 2,..., T v n = λ n for some scalars
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 informationQUATERNIONS AND ROTATIONS
QUATERNIONS AND ROTATIONS SVANTE JANSON 1. Introduction The purpose of this note is to show some well-known relations between quaternions and the Lie groups SO(3) and SO(4) (rotations in R 3 and R 4 )
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationPutzer s Algorithm. Norman Lebovitz. September 8, 2016
Putzer s Algorithm Norman Lebovitz September 8, 2016 1 Putzer s algorithm The differential equation dx = Ax, (1) dt where A is an n n matrix of constants, possesses the fundamental matrix solution exp(at),
More informationMATRIX LIE GROUPS AND LIE GROUPS
MATRIX LIE GROUPS AND LIE GROUPS Steven Sy December 7, 2005 I MATRIX LIE GROUPS Definition: A matrix Lie group is a closed subgroup of Thus if is any sequence of matrices in, and for some, then either
More informationCorrections to Introduction to Topological Manifolds (First edition) by John M. Lee December 7, 2015
Corrections to Introduction to Topological Manifolds (First edition) by John M. Lee December 7, 2015 Changes or additions made in the past twelve months are dated. Page 29, statement of Lemma 2.11: The
More information4F3 - Predictive Control
4F3 Predictive Control - Discrete-time systems p. 1/30 4F3 - Predictive Control Discrete-time State Space Control Theory For reference only Jan Maciejowski jmm@eng.cam.ac.uk 4F3 Predictive Control - Discrete-time
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationCHEBYSHEV INEQUALITIES AND SELF-DUAL CONES
CHEBYSHEV INEQUALITIES AND SELF-DUAL CONES ZDZISŁAW OTACHEL Dept. of Applied Mathematics and Computer Science University of Life Sciences in Lublin Akademicka 13, 20-950 Lublin, Poland EMail: zdzislaw.otachel@up.lublin.pl
More informationBulletin of the Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Special Issue of the Bulletin of the Iranian Mathematical Society in Honor of Professor Heydar Radjavi s 80th Birthday Vol 41 (2015), No 7, pp 155 173 Title:
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 informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
More informationControl Systems Design
ELEC4410 Control Systems Design Lecture 18: State Feedback Tracking and State Estimation Julio H. Braslavsky julio@ee.newcastle.edu.au School of Electrical Engineering and Computer Science Lecture 18:
More informationLECTURE 15-16: PROPER ACTIONS AND ORBIT SPACES
LECTURE 15-16: PROPER ACTIONS AND ORBIT SPACES 1. Proper actions Suppose G acts on M smoothly, and m M. Then the orbit of G through m is G m = {g m g G}. If m, m lies in the same orbit, i.e. m = g m for
More informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationRepresentations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III
Representations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III Lie algebras. Let K be again an algebraically closed field. For the moment let G be an arbitrary algebraic group
More information