Geometric Control Theory for Hybrid Systems
|
|
- Thomasine Richard
- 5 years ago
- Views:
Transcription
1 Geometric Control Theory for Hybrid Systems Evren Yurtseven H&NS Master s thesis Coach(es): Committee: prof.dr.ir. W.P.M.H. Heemels (supervisor) dr. M.K. Camlibel dr. M.K. Camlibel prof.dr.ir. W.P.M.H. Heemels prof.dr. J.M. Schumacher dr. S. Weiland Eindhoven University of Technology Department of Mechanical Engineering Hybrid & Networked Systems Eindhoven, August, 2010
2 TABLE OF CONTENTS 1. Introduction Disturbance Decoupling of Switched Linear Systems Controllability of Bimodal Discrete-time Piecewise Linear Systems Bibliography
3 CHAPTER 1 INTRODUCTION Geometric control theory for linear time-invariant (LTI) systems has a long and rich history, as is evidenced by the availability of various textbooks on the topic [H.L02, BM92, Won85]. For solving certain problems such as disturbance decoupling problems (DDPs), characterization of sets of particular interest including reachable and unobservable sets, geometric control theory proves to be an extremely powerful tool. Solutions to various problems for smooth nonlinear systems, based on a geometric approach, are also available in the literature [IKGGN81, NVdS82]. Interestingly, geometric control theory for hybrid systems is largely absent in the literature, despite the enourmous attention this class of dynamical systems has received over the past decades. This thesis focuses on the development of geometric control theory for certain classes of hybrid systems. For this purpose, geometric control theory will be used to solve DDPs and controllability problems for switched linear and piecewise linear systems, respectively. 1.1 Problem Formulation Although many geometric control theoretic results are available for linear and smooth nonlinear systems, when one leaves the realm of linear and smooth nonlinear systems and looks into hybrid dynamical systems, the availability and usage of geometric control theory become quite limited. There are, however, some results available for interesting problems for certain classes of hybrid systems, that are based on a geometric approach. In [JvdS02] the largest controlled invariant set for switched linear systems (SLSs) is studied in which both the switching (discrete control input) and the continuous input can be manipulated as control inputs. In the context of linear parameter-varying (LPV) systems
4 CHAPTER 1. INTRODUCTION various parameter-varying (controlled and conditioned) invariant subspaces are introduced in [BBS03] and various algorithms are presented to compute them. Based on [BBS03] first results in the direction of applying these concepts to solve DDP in LPV systems are given in [SBS03] using parameter-dependent state feedback. Recently, in [Ots10] DDP for SLSs using mode-dependent state feedback control is solved. In [ZCL05] local versions of DDP with respect to continuous disturbances in switched nonlinear systems are solved using both mode-dependent and mode-independent state feedback. It should be pointed out that the works mentioned so far prove their main results by first extending fundamental concepts of geometric control theory for LTI systems such as A-invariance, controlled invariance and so on, to the class of hybrid systems they are interested in and then using these new extended concepts in their solutions to the problems. There exist also studies in the literature that provide solutions to certain problems for particular classes of hybrid systems, that heavily make use of geometric control theory for LTI systems in proving their main results. In [CHS08a], algebraic necessary and sufficient conditions for the controllability of continuous-time conewise linear systems are given. This work solves a seemingly very complicated problem for an important class of hybrid systems by first transforming the hybrid system of interest into a much more manageable form using geometric control theory for LTI systems and proving the controllability of the original system to be equivalent to the controllability of a particular subsystem of the original system. Also in solving other problems defined for hybrid systems, the usage of geometric control theory for LTI systems offers attractive solutions, see e.g. [CHS08b, Cam07]. In the light of these works, this thesis will focus on the following problems in which geometric control theory will play an essential role: Find conditions under which a switched linear system s output is or can be made decoupled from (i) the continuous disturbances (ii) the switching signal (iii) both the continuous disturbances and the switching signal Find conditions under which a bimodal discrete-time piecewise linear system is (i) null controllable (ii) reachable (iii) controllable 2
5 CHAPTER 1. INTRODUCTION 1.2 Contributions of This Thesis The first contribution of this thesis will be to give complete characterizations of disturbance decoupling in switched linear systems, that is under what conditions is a given SLS disturbance decoupled or can it be made disturbance decoupled by using, either modedependent or mode-independent, static state feedback. We do so by first extending the building blocks of geometric control theory for LTI systems such as A-invariance, controlled invariance, conditioned invariance et cetera, to switched linear systems. Then, making use of these new concepts we present the main results and the algorithms with which our results can be put to use. We consider three different versions of disturbance decoupling: with respect to the continuous disturbances; with respect to the discrete switching signal, i.e. the mode of the SLS; and with respect to both. While the first version is a well-motivated and well-known problem, the second and the third are considered for the first time in this thesis. Disturbance decoupling with respect to the switching signal is a desirable property when the switching signal cannot be manipulated and each mode of the SLS corresponds to a certain failure scenario and particular outputs of the system are desired not to be influenced by these scenarios. Disturbance decoupling with respect to both the switching signal and the continuous disturbances is a property that we will show to be strongly related to disturbance decoupling of piecewise linear systems with respect to the continuous disturbances. Before concluding this part of the thesis, we will also provide geometric necessary and sufficient conditions for the solvability of the disturbance decoupling problem with respect to the continuous disturbances by mode-dependent dynamic measurement feedback. These contributions are presented in Chapter 2. An abridged version of the chapter is accepted for publication in the proceedings of the IEEE Conference on Decision and Control 2010 in Atlanta, USA. The complete contents will further be sent for journal publication. The second part of this thesis is devoted to providing algebraic necessary and sufficient conditions for the null controllability, reachability and controllability of a class of bimodal discrete-time piecewise linear systems. The class is characterized by continuous right-hand side and scalar input whereas the state can be of any dimension. By using geometric control theory for LTI systems we will show that the controllability problem is equivalent to the controllability of a particular subsystem of the original system, which is in the form of a socalled push-pull system. Exploiting the results on the controllability of input-constrained linear systems we will derive conditions for the controllability of push-pull systems leading to our main results. These contributions are explained in detail in Chapter 3. The results will be submitted for journal publication as well. 3
6 CHAPTER 2 Disturbance Decoupling of Switched Linear Systems At Yarragi Essegin ziki DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS Abstract In this paper we consider disturbance decoupling problems for switched linear systems. We will provide necessary and sufficient conditions for three different versions of disturbance decoupling, which differ based on which signals are considered to be the disturbance. In the first version the continuous exogenous input is considered as the disturbance, in the second the switching signal and in the third both of them are considered as disturbances. The latter instance of the problem is relevant for disturbance decoupling of piecewise linear systems, as we will show. The solutions of the three disturbance decoupling problems will be based on geometric control theory for switched linear systems and will entail both modedependent and mode-independent static state feedback. In addition, a mode-dependent dynamic measurement feedback based solution of the disturbance decoupling problem with respect to the continuous disturbances will be provided. Index Terms Disturbance decoupling, switched linear systems, invariant subspaces, geometric control theory I. INTRODUCTION Geometric control theory for linear time-invariant systems has a long and rich history, as is evidenced by the availability of various textbooks on the topic [2, 6, 18]. In particular, for solving disturbance decoupling problems (DDPs) for linear systems the usage of geometric theory turned out to be extremely powerful. Also solutions to various problems for smooth nonlinear systems using a nonlinear geometric approach are available in the literature, see, e.g., [3, 7, 11]. However, outside the context of linear or smooth nonlinear control systems, the number of results on DDPs is rather limited. This is specifically surprising for hybrid dynamical systems or subclasses such as switched systems [9], as they have been studied extensively over the last two decades. Only a few results are available on geometric control theory and solutions to DDPs for switched systems. In [8] the largest controlled invariant set for switched linear systems (SLSs) is studied in which both the switching (discrete control input) and the continuous input can be manipulated as control inputs. In the context of linear parametervarying (LPV) systems various parameter-varying (controlled and conditioned) invariant subspaces are introduced in [1] and various algorithms are presented to compute them. Based on [1] first results in the direction of applying these concepts to DDPs with respect to continuous disturbances are given in [14] using parameter-dependent state feedback. Recently, in [12] the DDP for switched linear systems using mode-dependent state feedback control is solved and combined with results on quadratic stabilizability [4, 17]. Also for reachability
7 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS problems for SLSs invariant subspaces played an important role. In particular, in [15, 16] it was shown that the reachable set of an SLS is equal to the smallest controlled invariant set containing the subspace spanned by all the input matrices of the individual subsystems. For switched nonlinear systems, the only work known to the authors is [19]. In [19] local versions of DDP with respect to continuous disturbances are solved using both mode-dependent and mode-independent static state feedback. The objectives of this paper are to provide complete answers to DDPs for SLSs using various new controlled and conditioned invariant subspaces for SLSs. We first assume that the control input is absent and analyze the disturbance decoupling properties of a SLS. In contrast with the above mentioned references, which only study disturbance decoupling (DD) with respect to continuous exogenous disturbances, we consider three variants of DD as will be formally defined in Section II, namely DD with the disturbances being either (i) the exogenous continuous disturbances, (ii) the switching signal, or (iii) both the continuous disturbances and the switching signal. We will show that the latter instance of the problem is relevant for disturbance decoupling of piecewise linear systems. In Section III we will fully characterize these three DD properties. In Section IV we will add continuous control inputs to the problem and solve the DDP using state feedback controllers that may be both modedependent and mode-independent. We will allow for direct feedthrough terms of the control input into the to-be-decoupled output variable, a situation that was not considered in the aforementioned references. Note also that variant (ii) and (iii) are in the present paper for the first time. In Section V we provide algorithms to compute the largest common controlled invariant subspaces using both mode-dependent and mode-independent feedback, which can be used to verify the characterizations of the solvability of the DDPs provided in Section IV and also to construct feedbacks solving the DDPs. Before stating the conclusions, we will provide also the solution to the DDP using mode-dependent output-based dynamic feedback controllers. II. PROBLEM FORMULATION A switched linear system (SLS) without control inputs is described by the following equations ẋ(t) = A σ(t) x(t) + E σ(t) d(t) z(t) = H σ(t) x(t) (1a) (1b) where x(t) R nx, d(t) R n d and z(t) R n z denote the state variable, the exogenous input and output, respectively, at time t R + := [0, ). For each i {1,..., M}, A i R nx nx, E i R nx n d and H i R nz nx are matrices describing a linear subsystem. Switching between subsystems (modes) is orchestrated by the switching signal σ. We assume that σ lies in the set S of right-continuous functions R + {1,..., M} that are piecewise constant with a finite number of discontinuities in a finite length interval. Particular switching signals are the constant ones σ i S, i = 1,..., M, which are defined as σ i (t) = i for all t R +. We assume that the exogenous signal d is locally integrable, i.e. d L loc 1 (R +, R n d ). Clearly, the SLS (1) has for each d L loc 1 (R +, R n d ), initial condition x(0) = x0 R nx and switching signal σ S a unique solution x x0,σ,d and a corresponding output z x0,σ,d. We will consider the following three variants of disturbance decoupling, which differ based on which signals are considered to be the disturbance. Definition II.1 The SLS (1) is called disturbance decoupled (DD) with respect to d if z x0,σ,d 1 = z x0,σ,d 2 (2) for all x 0 R nx, σ S and d 1, d 2 L loc 1 (R +, R n d ). Definition II.2 The SLS (1) is called disturbance decoupled (DD) with respect to σ if z x0,σ 1,d = z x0,σ 2,d (3) for all x 0 R nx, σ 1, σ 2 S and d L loc 1 (R +, R n d ). Definition II.3 The SLS (1) is called disturbance decoupled (DD) with respect to both σ and d if z x0,σ 1,d 1 = z x0,σ 2,d 2 (4) for all x 0 R nx, σ 1, σ 2 S and d 1, d 2 L loc 1 (R +, R n d ). 5
8 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS Remark II.4 DD with respect to continuous disturbances d is commonly studied and well motivated within the context of linear systems [2, 6, 18] and nonlinear systems [3, 7, 11]. DD with respect to σ or both σ and d is typical for switched systems as studied here. These variants of DD are relevant in situations where the switching signal σ is uncontrolled and we would like to design a (closedloop) system in which σ does not influence certain important performance variables z. In particular, when σ models certain faults in the system such as breakage of pipes, actuators, sensors, etc. and thus each mode i {1,..., M} corresponds to one of these discrete fault scenarios, it would be desirable to decouple z from σ (and possibly other continuous disturbances d). Hence, as such these variants of DD are fundamental problems in the area of faulttolerant control [10]. Another motivation for DD with respect to both σ and d are DD problems for piecewise linear systems, see Section III-D below. III. DISTURBANCE DECOUPLING CHARACTERIZATIONS To provide characterizations for the above mentioned DD properties, we need to introduce some concepts and a technical lemma. We call a subspace V R nx A-invariant for A R nx nx, if AV V. We call a subspace {A 1,..., A M }- invariant A i R nx nx, i = 1,..., M, if A i V V for all i = 1,..., M. Given a matrix A R nx nx and a subspace W R nx, let A W denote the smallest A invariant subspace that contains W, i.e., A W = W + AW A nx 1 W (5) For a set of matrices {A 1,..., A M } and a subspace W, the smallest {A 1,..., A M }-invariant subspace that contains W, denoted by V s (W), is uniquely defined by the following three properties: 1) W V s (W); 2) V s (W) is {A 1,..., A M }-invariant; 3) For any subspace V being {A 1,..., A M }- invariant with W V, it holds that V s (W) V. Calculation of V s (W) can be done using the recurrence relation V 1 = W; V i+1 = A j V i j=1 Since V i V i+1 for i = 1, 2,... and V p = V p+1 implies V q = V p for all q p, it holds that V q = V s (W) for all q n x, see, e.g., [1, 16]. The reachable set of (1) is defined as R := {x 0,σ,d (T ) T R +, σ S and d L loc 1 (R +, R n d )} being the set of states that can be reached from the origin in finite time for some σ and d. Lemma III.1 For the SLS (1), R = V s ( im E i ) i=1 See [15, 16] for the proof of this lemma. A. Disturbance decoupling with respect to d In this section we consider DD with respect to d. Theorem III.2 The SLS (1) is DD with respect to d if and only if an {A 1,..., A M }-invariant subspace V exists such that H 1 im E i V ker. (6) H M i=1 Proof: Once σ is fixed the SLS (1) reduces to a linear time-varying system. Using the resulting linearity properties shows that (17) is equivalent to z 0,σ,d = 0 σ S d L loc 1 (R +, R n d ) (7) Necessity: Since each x R can be reached for some σ and d, i.e. x = { x 0,σ,d (T ) for some T R +, we can take σ i σ(t) 0 t < T (t) = for i = σ i (t) t T 1,..., M in (7) to get that H i x = z 0,σ i,d(t ) = 0. Hence (6) holds for V = R due to Lemma III.1. Sufficiency: Since x 0,σ,d (t) R for all t R +, it follows from Lemma III.1 that x 0,σ,d (t) V for all t R + as R = V s ( im E i ) V. Hence, due i=1 to (6), z 0,σ,d (t) = H σ(t) x 0,σ,d (t) = 0 and thus (7) is satisfied. 6
9 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS B. Disturbance decoupling with respect to σ In this section we consider DD with respect to σ in which we will use N i being the unobservable subspace corresponding to the pair (H i, A i ), i.e., N i = ker H i ker H i A i... ker H i A nx 1 i. Note that N i is also the largest A i -invariant subspace contained in ker H i, i {1,..., M}. Theorem III.3 The SLS (1) is DD with respect to σ if and only if for all (i, j) {1,..., M} {1,..., M} the following conditions hold (i) H i = H j ; (ii) N i = N j ; (iii) im(a i A j ) N i ; (iv) im(e i E j ) N i. Proof: Necessity: To prove the necessity of the conditions, take σ 1 = σ i and σ 2 = σ j. Let d(t) = d 0 for all t R +. Then, one gets due to DD with respect to σ that and hence z x0,σ i, d = z x0,σ j, d H i e Ait x 0 + ( t H 0 ie Ai(t s) E i ds)d 0 H j e Ajt x 0 + ( (8) t H 0 je Aj(t s) E j ds)d 0 for all t R +. Since x 0 and d 0 are both arbitrary, one gets H i A k i = H j A k j (9) H i A k i E i = H j A k j E j (10) for all k 0 by differentiating (8) with respect to time and evaluating at t = 0. Condition (i) follows from (9) for k = 0, and (ii) from k = 0, 1,..., n x 1. To see that (iii) holds, note that H i A l i(a i A j ) = H i A l+1 i H i A l ia j (9) = H i A l+1 j H i A l ia j = H i (A l j A l i)a j (9) = 0 for all l. For condition (iv), observe that H i A l ie i (10) = H j A l je j (9) = H i A l ie j and hence H i A l i(e i E j ) = 0 for all l 0. Sufficiency: First, we will show that H i A k i = H j A k j (11) for all i, j {1, 2,..., M} {1, 2,..., M} and k 0 by induction. Note that (11) holds for k = 0 due to condition (i). Assume that it holds for some k. Then H i A k+1 i H j A k+1 j = H i A k+1 i H i A k i A j = H i A k i (A i A j ) Also note that (iii) = 0. H i A k i E i H j A k j E j (11) = H i A k i E i H i A k i E j = H i A k i (E i E j ) (iv) = 0 for all k 0. Thus, we get H i A k i E i = H j A k j E j (12) for all i, j {1, 2,..., M} {1, 2,..., M} and k 0. Now, let z = z x0,σ 1,d z x0,σ 2,d (13) x = x x0,σ 1,d x x0,σ 2,d (14) for some x 0, σ 1, σ 2, and d. It follows from (11) for k = 0 that z(t) = H σ1(t) x(t). By differentiating and using (11) for k = 1 and (12) for k = 0, one gets z(t) = H σ1(t)a σ1(t) x(t) for all t R +. Repeating the same argument, one obtains z (k) (t) = H σ1(t)a k σ 1(t) x(t) for all k 0 and for all t R +. Due to (11) this yields z (k) (t) = H i A k i x(t) for all t R +, in which i {1,..., M} can be selected arbitrarily. Then, there exists a nonzero polynomial p(λ) (e.g., the characteristic polynomial of A i for any i) such that p( d dt ) z = 0 7
10 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS by the Cayley-Hamilton theorem. Since x(0) = 0, one has z (k) (0) = 0 for all k 0. Therefore, z(t) = 0 for all t R +. In other words, z x0,σ 1,d = z x0,σ 2,d for all x 0, σ 1, σ 2, and d. Based on Theorem III.3, we can also derive an alternative characterization of DD with respect to σ, which is more geometric in nature. Corollary III.4 The SLS (1) is DD with respect to σ if and only if there exists an {A 1,..., A M }- invariant subspace V such that for all (i, j) {1,..., M} {1,..., M} (i) H i = H j (ii) im (A i A j ) V ker H i (iii) im (E i E j ) V Proof: Necessity: The necessity of these conditions follows directly from Theorem III.3 by taking V = N i. Sufficiency: As N i is the largest A i -invariant subspace that is contained in ker H i for all i {1,..., M}, condition (ii), together with the {A 1,..., A M }-invariance of V, implies that V N i. This fact together with (i) implies that condition (i), (iii) and (iv) of Theorem III.3 are satisfied. To show that also (ii) of Theorem III.3 is satisfied, we observe that statement (ii) of this theorem implies that H i A i = H i A j for all (i, j) {1,..., M} {1,..., M}. Due to im (A i A j ) V and V being {A 1,..., A M }-invariant, it must hold that A k i im (A i A j ) V ker H i for all k N and thus H i A k+1 i = H i A k i A j for all i, j. We will now prove that H i A k i = H j A k j (15) for all k N using induction. Clearly, it holds for k = 0. Suppose it holds for k, then H j A k+1 j (15) = H i A k i A j = H i A k+1 i Hence, (15) holds for all k N and thus N i = N j for all i, j. As such, we recovered the conditions of Theorem III.3, which completes the proof. C. Disturbance decoupling with respect to σ and d Using the above results, we will characterize DD with respect to σ and d now. Lemma III.5 The SLS (1) is DD with respect to both σ and d if and only if it is DD with respect to σ and DD with respect to d. Proof: The necessity of the conditions follows by taking, first σ 1 = σ 2 in (4), which yields (17) and secondly, d 1 = d 2 in (4), which gives (3). The sufficiency follows from z x0,σ1,d 1 = z x0,σ1,0 + z 0,σ1,d1 (17) = z x0,σ1,0 + z 0,σ1,d2 (3) = z x0,σ2,0 + z 0,σ2,d2 = z x0,σ2,d 2 where in the first and the last equalities we used the linearity properties of the SLS (1) for a fixed σ. Theorem III.6 The following statements are equivalent: 1) The SLS (1) is DD with respect to σ and d. 2) The conditions (i) H i = H j = H, (ii) N i = N j = N, (iii) im(a i A j ) N, and (iv) ime i N hold for all (i, j) {1,..., M} {1,..., M}. 3) There exists an {A 1,..., A M }-invariant subspace V such that (i) H i = H j = H, (ii) im(a i A j ) V ker H, and (iii) ime i V for all (i, j) {1,..., M} {1,..., M}. Proof: (1) (2): According to Lemma III.5, the hypotheses of Theorem III.2 and Theorem III.3 are necessarily true when the SLS (1) is DD with respect to σ and d. For all x V and for all i = 1,..., M one can write HA k i x = 0 for all k N. This shows that x N. Therefore V N. Combining the conditions of Theorem III.2 and Theorem III.3 gives (2). 8
11 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS (2) (3): Since N i is an A i -invariant subspace contained in ker H and N i = N j = N, one can write A i N N for all i = 1,..., M. Thus, it follows that N is an {A 1,..., A M }-invariant subspace contained in ker H. (3) (1): It follows from (3) that im E i i=1 V ker H. This recovers the condition of Theorem III.2. One can also recover the conditions of Theorem III.3 by following the steps shown in the sufficiency part of Corollary III.4. Based on Lemma III.5, (1) follows. D. Disturbance decoupling of piecewise linear systems Based on the above results we can show the importance of DD with respect to σ and d for disturbance decoupling of piecewise linear (PWL) systems of the form ẋ(t) = A i x(t) + E i d(t) if x(t) X i z(t) = Hx(t) (16a) (16b) in which X i R nx, i {1,..., M}, are polyhedral regions with non-empty interiors that form a partitioning of the state space R nx, i.e., M i=1 X i = R nx and the interiors of different regions have an empty intersection. Since the right-hand side of a PWL system can be discontinuous, solutions will be interpreted in the sense of Filippov [5], which includes possible sliding motions at the boundaries of the regions. See [5] for more details and exact definitions of Filippov solutions. To avoid any ambiguity in the definition of the output as in (16b) during sliding motions we assumed that the output matrix H is independent of i. Note that this is a necessary condition for the SLS (1) corresponding to (16) to be DD with respect to both σ and d. Definition III.7 The PWL system (16) is called disturbance decoupled (DD) with respect to d if for all x 0 R nx, d 1, d 2 L loc 1 (R +, R n d ), it holds that z 1 = z 2 (17) where z j = Hx j, j = 1, 2 and x j, j = 1, 2, is a Filippov solution to (16) for initial state x(0) = x 0 and disturbance input d j, j = 1, 2. Note that due to possible non-uniqueness of Filippov solutions multiple solutions might correspond to one initial condition and one disturbance input. Theorem III.8 The PWL (16) system is DD with respect to d, if the corresponding SLS (1) is DD with respect to σ and d. Proof: Let x j, j = 1, 2, be Filippov solutions to (16) for x 0 and d j, j = 1, 2, and z j = Hx j, j = 1, 2. Consider the absolutely continuous functions x = x 1 x 2 and z = z 1 z 2. Due to the definition of Filippov solutions we have that for almost all t R + there exist α i, β j depending on t such that α i = 1, β j = 1, α i, β j 0 for all i i=1 j=1 {1,..., M}, j {1,..., M} and x(t) = ẋ 1 (t) ẋ 2 (t) = α i (A i x 1 (t) + E i d 1 (t)) i=1 β j (A j x 2 (t) + E j d 2 (t)) j=1 Equation (18) can be rewritten as x(t) = β i A i (x 1 (t) x 2 (t)) + α i E i d 1 (t)+ with i=1 i=1 j=1 i=1 i=1 (18) β j E j d 2 (t) + δ ij (A i A j )x 1 (t) α i β i = (19) (δ ij δ ji ) (20) j=1 For convenience, we take δ ii = 0 for all i = 1,..., M. To show that (20) holds, we write (20) in vector notation using δ = ( δ δ 1M δ δ 2M... δ M1... ) 9
12 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS which results in the following system of linear equations. α 1 β 1 Q δ =. = v (21) α M β M where Q R M (M 11) is a suitably defined matrix. For a solution to exist to (21), it must hold that imv imq (imq) = ker Q (imv). 1 By construction of Q, ker Q = span{ 1. }. 1 1 Since (α i β i ) = 0, span{ 1. } (imv). i=1 1 Therefore a solution for δ always exists, which proves that equation (18) can always be written in the form of (19). Since the SLS (1) is DD with respect to d and σ, we have that A k l im(a i A j ) ker H ime i ker H HA k i = HA k j for all (i, j, l) {1,..., M} {1,..., M} {1,..., M} and for all k N. Therefore, multiplying (19) with H gives for almost all t R + z(t) = H x(t) = HA i x(t) (22) Differentiating (22) with respect to t and repeating the arguments above, we obtain z (k) (t) = HA k i x for all k N. Similar to the arguments used in the proof of Theorem III.3, one can conclude that z(t) = 0 for all t R +. This theorem demonstrates the relevance of DD with respect to σ and d for SLS in the context of DD to d for PWL systems. As such, when control inputs u are present, disturbance decoupling problems (DDPs), i.e., designing controllers that render the closed-loop SLS DD with respect to σ and d, can be used also for solving DDPs of PWL systems with respect to d. DDPs for SLSs will be considered in the next section. However, before doing so, we would like to show that although DD of the SLS with respect to σ and d is a sufficient condition for DD of a PWL system to d, it is not necessary. Example III.9 Consider the PWL system [ ] [ ẋ(t) = x(t) + d(t) 0 0 1] x 1 (t) 0 [ ] [ ẋ(t) = x(t) + d(t) 0 0 2] x 1 (t) < 0 z = [ 1 0 ] x It is clear that the corresponding SLS is not disturbance decoupled with respect to σ and d. Yet, the PWL system described above is disturbance decoupled with respect to d. IV. DDP BY STATE FEEDBACK In the previous section we provided full characterizations of DD properties. Now we will consider if and how we should choose control inputs in order to render a SLS disturbance decoupled in some sense. In order to do so, consider the SLS ẋ(t) = A σ(t) x(t) + B σ(t) u(t) + E σ(t) d(t) z(t) = H σ(t) x(t) + J σ(t) u(t) (23a) (23b) where we included now a control input u(t) R nu at time t R +. As before we denote the solution corresponding to x 0 R nx, σ S, d L loc 1 (R +, R n d ) and u L loc 1 (R +, R nu ) by x x0,σ,d,u and the corresponding output by z x0,σ,d,u. We are now interested in finding conditions under which controllers can be found such that the closed-loop system is DD with respect to d, to σ, or to both. We start with static state feedback controllers. A. Solution of DDP with respect to d by modedependent state feedback Problem IV.1 The disturbance decoupling problem with respect to d (DDPd) by mode-dependent state feedback for SLS (23) amounts to finding F i R nu nx, i = 1,..., M such that ẋ(t) = (A σ(t) + B σ(t) F σ(t) )x(t) + E σ(t) d(t) (24a) 10
13 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS z(t) = (H σ(t) + J σ(t) F σ(t) )x(t) is DD with respect to d. (24b) Note that the SLS (24) results from putting the system (23) in closed loop with u(t) = F σ(t) x(t), which requires knowledge of the active mode σ(t) at time t R +. Definition IV.2 Consider the SLS (23) with d = 0. A subspace V is called output-nulling {(A 1, B 1 ),..., (A M, B M )}-invariant if for any x 0 V and σ S there exists a control input u L loc 1 (R +, R nu ) such that x x0,σ,0,u(t) V and z x0,σ,0,u(t) = 0 for all t R +. Sometimes an output-nulling {(A 1, B 1 ),..., (A M, B M )}-invariant subspace is called a common output-nulling controlled invariant subspace for (23). Theorem IV.3 Consider the SLS (23) with d = 0. Let V be a subspace of R nx and V 0 R nx R nz denote the extended subspace V {0}. The following statements are equivalent. (i) V is common output-nulling controlled invariant. [ ] [ ] Aj (ii) V V H 0 Bj + im for all j = 1,..., M. j J j (iii) There exist F j R nu nx, j = 1,..., M, such that (A j + B j F j )V V ker (H j + J j F j ) for all j = 1,..., M. j J Proof: The proof is similar in nature to the (more complicated) proof of Theorem IV.9, which we will provide below, and is therefore omitted. Let {V j j J } be a collection of common output-nulling controlled invariant subspaces for the SLS (23). It follows from Definition IV.2 that V j is common output-nulling controlled invariant. Therefore, the set of all common output-nulling controlled invariant subspaces admits a largest element. The largest common output-nulling controlled invariant subspace for a given SLS plays a crucial role in the solution of DDPd by mode-dependent feedback. Definition IV.4 Consider the SLS (23) with d = 0. We define Vmd as the largest common output-nulling controlled invariant subspace for the SLS (23) that is (i) Vmd is common output-nulling controlled invariant; (ii) if V is a common output-nulling controlled invariant subspace for the SLS (23), then V Vmd. Theorem IV.5 Consider the SLS (23). DDPd by mode-dependent feedback is solvable if and only if im E i Vmd (25) i=1 Proof: The proof of the theorem follows directly from Theorem III.2, Theorem IV.3, and Definition IV.4. In Section V we will provide an algorithm to compute Vmd for a given SLS. Remark IV.6 For the special case that J i = 0, i = 1,..., M, this problem was solved also in [12]. In [12] the DDP with respect to d by modedependent state feedback was combined with the question of quadratic stability. Sufficient conditions were given exploiting known results for quadratic stabilization as in [4, 17]. These stability conditions can also be added to the theorems that we present here, but unfortunately, they are, just as in [12], not so trivial to verify, certainly for a high number of subsystems. Indeed, the sufficient conditions that guarantee solvability of DDP with quadratic stability (DDPQS) according to Theorem 3.2 in [12] are the existence of F j, j = 1,..., M, such that (A j + B j F j )Vmd V md ker (H j + J j F j ) for all j = 1,..., M and there exists a convex combination αj (A j + B j F j ) with M j=1 α j = 1 and α j 0, j = 1,..., M, being a Hurwitz matrix. Since a parameterization of all F j, j = 1,..., M, satisfying (A j + B j F j )Vmd V md ker (H j + J j F j ) is hard to come by in the first place, and one has to search for both α j and F j, j = 1,..., M, which is a nonconvex problem, these conditions are not easy to verify. Also for the satisfaction of the stabilization condition it is unclear if using Vmd instead of another common output-nulling controlled invariant subspace containing M i=1 im E i is introducing conservatism into the conditions. Another difference 11
14 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS with respect to [12], is that DDP with respect to d by mode-independent state feedback was not considered in [12], while we treat this problem in the next section. B. Solution of DDP with respect to d by modeindependent state feedback Problem IV.7 The disturbance decoupling problem with respect to d (DDPd) by mode-independent feedback for SLS (23) amounts to finding F R nu nx such that ẋ(t) = (A σ(t) + B σ(t) F )x(t) + E σ(t) d(t) z(t) = (H σ(t) + J σ(t) F )x(t) is DD with respect to d. (26a) (26b) Note that the SLS (26) results from putting the system (23) in closed loop with u(t) = F x(t). The latter state feedback controller does not require knowledge of the active mode σ(t) at time t R +. Definition IV.8 Consider the SLS (23) with d = 0. A subspace V is called output-nulling {(A 1, B 1 ),..., (A M, B M )}-invariant under modeindependent control if for any x 0 V there exists a control input u L loc 1 (R +, R nu ) such that x x0,σ,0,u(t) V and z x0,σ,0,u(t) = 0 for all σ S and for all t R +. Sometimes a subspace that is output-nulling {(A 1, B 1 ),..., (A M, B M )}-invariant under modeindependent control is called a common outputnulling controlled invariant subspace under modeindependent control for (23). (i) V is common output-nulling controlled invariant under mode-independent control. (ii) A s V V 0M + imb s. (iii) There exists F R nu nx such that (A j + B j F )V V ker (H j + J j F ) for all j = 1,..., M. Proof: : (i) (ii). Assume that σ(t) = σ j for some j {1,..., M}. Let x 0 V and u be a control input such that x x0,σ j,0,u(t) = x j (t) V and z x0,σ j,0,u(t) = z j (t) = 0 for all j = 1,..., M and t R +. Then one can write t 0 x x0,σ 1,0,u(t) x 0. =. + x x0,σ M,0,u(t) x 0 A 1 0 x 1 (s) B 1 ( u(s))ds 0 A M x M (s) B M (28) Furthermore, z x0,σ j,0,u(t) = H j x(t)+j j u(t) = 0 for all j = 1,..., M and for all t R +. Thus, one can also write t 0 z x0,σ 1,0,u(s). ds = 0 (29) z x0,σ M,0,u(s) Combining (28) with (29) we get Theorem IV.9 Consider the SLS (23) with d = 0. Let V be a subspace of R nx and V 0 R nx R nz denote the extended subspace V {0}. Define the matrices A s R M(nx+nz) nx and B s R M(nx+nz) nu A 1 H 1 A s =. A, B s = M H M B 1 J 1. B M J M (27) M times {}}{ and V 0M as V 0M = V 0 V 0... V 0. The following statements are equivalent. A 1 0 H 1... A M t 0 H M x x0,σ 1,0,u(t) x 0 0. x x0,σ M,0,u(t) x 0 } 0 {{ } V 0 M 0 x 1 (s). ds = x M (s) B 1 J 1. B M J M t 0 u(s)ds } {{ } imb s (30) 12
15 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS Now we divide the left-hand side of (30) by t and take the limit to obtain A 1 0 H 1 1 lim. t x 1 (s) t 0 t... ds = A 0 M x M (s) 0 H M A 1 0 A 1 H 1 x. 0 H 1... =. A M x 0 A x 0 (31) M 0 H M H M Equality (31) holds because x x0,σ j,0,u(t) is continuous for all j = 1,..., M. The rest of the proof is clear from here on. (ii) (iii). Choose a basis {q 1,..., q nv, q nv+1,..., q nx } for R nx such that {q 1,..., q nv } is a basis for V. For k = 1,..., n v there exist vectors q j,k V and u k R nu such that A j q k = q j,k + B j u k and H j q k = J j u k for all j = 1,..., M. For k = 1,..., n v define F q k = u k and for k = n v + 1,..., n x let F q k be arbitrary vectors in R nx. Then for (j, k) {1,..., M} {1,..., n v } we have (A j + B j F )q k = q j,k V and (H j + J j F )q k = 0. Hence (A j + B j F )V V ker (H j + J j F ) for all j = 1,..., M. (iii) (i). Let x 0 V and apply the feedback law u(t) = F x(t) to obtain the closed loop system ẋ(t) = (A σ(t) +B σ(t) F )x(t), z(t) = (H j +J j F )x(t). Clearly, x x0,σ,0,u(t) V and z x0,σ,0,u(t) = 0 for all t R +. Thus, (i) follows. Definition IV.10 Consider the SLS (23) with d = 0. We define V mi as the largest common outputnulling controlled invariant subspace under modeindependent control for the SLS (23), that is 1) V mi is common output-nulling controlled invariant under mode-independent control; 2) if V is common output-nulling controlled invariant under mode-independent control for the SLS (23), then V V mi. Theorem IV.11 Consider the SLS (23). DDPd by mode-independent feedback is solvable if and only if im E i Vmi (32) i=1 Proof: The proof of the theorem directly follows from Theorem III.2, Theorem IV.9 and Definition IV.10. In Section V we will present an algorithm to compute the largest common output-nulling controlled invariant subspace using mode-independent feedback for a given SLS. C. Solution of DDP with respect to σ by modedependent state feedback Consider the SLS (23). Problem IV.12 The disturbance decoupling problem with respect to σ (DDPσ) by mode-dependent state feedback amounts to finding F i R nu nx, i = 1,..., M such that the SLS (24) is DD with respect to σ. Before giving the theorem for the solvability of Problem IV.12 we need to introduce the following lemma. Lemma IV.13 Consider the SLS (23). DDPσ by mode-dependent feedback is solvable if and only if there exist a common output-nullling controlled invariant subspace V and F k R nu nx, k = 1,..., M, with (A k + B k F k )V V ker (H k + J k F k ), k = 1,..., M, such that the following three conditions hold for all (i, j) {1,..., M} {1,..., M}: (i) H i + J i F i = H j + J j F j, (ii) im (A i + B i F i A j B j F j ) V, (iii) im (E i E j ) V. Proof: The proof of the lemma directly follows from Corollary III.4 and Theorem IV.3. Theorem IV.14 Consider the SLS (23). DDPσ by mode-dependent feedback is solvable if and only if there exist G i R nu nx, i = 1,..., M, such that for all (i, j) {1,..., M} {1,..., M} it holds that (i) H i + J i G i = H j + J j G j, (ii) im (A i + B i G i A j B j G j ) V md, (iii) im (E i E j ) V md. 13
16 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS Proof: Necessity: For a subspace V we will use the notation F i (V) = {F (A i + B i F )V V ker (H i + J i F )} If DDPσ is solvable, then as a result of Lemma IV.13, there exists a common output-nulling controlled invariant subspace, V, such that H i + J i F i = H j + J j F j, F k F k(v) k = 1,..., M, for all (i, j) {1,..., M} {1,..., M}. It also holds that im (A i +B i F i A j B j F j) V ker (H i + J i F i ) im (E i E j ) V Let Fi F i (Vmd ) for all i = 1,..., M. Since V Vmd, one can choose a basis {v 1, v 2,..., v nx } for R nx such that {v 1,..., v p } is a basis for V and {v 1,..., v q } is a basis for Vmd. Define { Fi v k k {1, 2,..., q} G i v k = F i v k k {q + 1, q + 2,..., n x } Clearly, G i F i (Vmd ) and H i + J i G i = H j + J j G j for all i, j. We claim that im (A i + B i G i A j B j G j ) Vmd. To see this, note that [(A i + B i G i ) (A j + B j G j )]v k { V md k {1, 2,..., q} V k {q + 1, q + 2,..., n x } Since V Vmd, it immediately follows that im (A i + B i G i A j B j G j ) Vmd. Note that im (E i E j ) V V md and thus also (iii) holds. Sufficiency: Let {v 1, v 2,..., v nx } be a basis for R nx such that {v 1,..., v q } is a basis for Vmd. Furthermore, let Fi F i (Vmd ), i = 1,..., M. Define F i v k = { Fi v k k {1, 2,..., q} G i v k k {q + 1, q + 2,..., n x } Note that F i F i (Vmd ) for all i. It is easy to see that im (A i + B i F i A j B j F j ) Vmd and H i + J i F i = H j + J j F j for all i, j. Thus we recovered the conditions of Lemma IV.13, thereby completing the proof. D. Solution of DDP with respect to d and σ (DDPdσ) by mode-dependent state feedback Consider the SLS (23). Problem IV.15 The disturbance decoupling problem with respect to d and σ (DDPdσ) by modedependent state feedback amounts to finding F i R nu nx, i = 1,..., M such that the SLS (24) is DD with respect to d and σ. Theorem IV.16 Consider the SLS (23). DDPdσ by mode-dependent feedback is solvable if and only if there exist G i R nu nx, i = 1,..., M such that for all (i, j) {1,..., M} {1,..., M} it holds that (i) H i + J i G i = H j + J j G j, (ii) im (A i + B i G i A j B j G j ) V md, (iii) im E i V md. Proof: The proof of the theorem is obtained along similar lines as in the proof of Theorem IV.14. Remark IV.17 In Theorem IV.14 and Theorem IV.16, if Vmd is replaced with V mi and G i = G j for all (i, j) {1,..., M} {1,..., M}, then the solutions to DDPσ and DDPdσ by mode-independent feedback, respectively, are obtained. V. ALGORITHMS TO TEST THE HYPOTHESES OF THE SOLUTIONS TO THE DDP A. Algorithm for Theorem IV.5 In this subsection we will present an algorithm to find the largest common output-nulling controlled invariant subspace for the SLS (23). Algorithm V.1 V i+1 = V 0 = R nx ; (33a) M {x u A j x+b j u V i, H j x+j j u = 0} j=1 (33b) From this recurrence relation it follows that V i+1 V i for all i = 0, 1,..., and if V k = V k+1 for some k, then V i = V k for all i k. Let q be the smallest k N such that V k = V k+1. Obviously, q n x. We 14
17 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS claim that V q = Vmd. For space reasons we omit the proof. Theorem V.2 Consider the SLS (23) and Algorithm V.1. Then, V q = Vmd with q := min{k N V k = V k+1 } n x. Proof: We will first show V i+1 V i for i N by induction. It is obvious that V 1 V 0. Suppose now that V i+1 V i. V i+2 = M {x u A j x + B j u V i+1, H j x + J j u = 0} j=1 M {x u A j x + B j u V i, H j x + J j u = 0} = V i+1 j=1 from which V i+2 V i+1 follows. Therefore, V i+1 V i for i N. Suppose for some k, V k+1 = V k. Then V k+2 = M {x u A j x + B j u V k+1, H j x + J j u = 0} j=1 = M {x u A j x + B j u V k, H j x + J j u = 0} j=1 = V k+1 Hence, V i = V k for all i k. Since V k V k 1... V 0, we have V q = V q+1 for some q n x. V q = M {x u A j x + B j u V q, H j x + J j u = 0} j=1 This shows that [ ] [ ] Aj V H q Vq 0 Bj + im j J j for all j = 1,..., M. By Theorem IV.3, V q is indeed common output-nulling controlled invariant. To show that V q is the largest common outputnulling controlled invariant subspace, we consider a common output-nulling controlled invariant subspace Ṽ for the SLS (23). Ṽ = Ṽ V 0, thus the following: M {x W A j x Ṽ + im B j} j=1 M {x u A j x + B j u V 0, H j x + J j u = 0} = V 1 j=1 Hence, Ṽ V 1. Repeating the procedure above we arrive at the conclusion Ṽ V q. B. Algorithm for Theorem IV.11 In this subsection we will present the algorithm to find the largest common output-nulling controlled invariant under mode-independent control for the SLS (23). Algorithm V.3 Define the matrices A s and B s and the extended subspace V 0M in the same way as in Theorem IV.9. V 0 = R nx ; V i+1 = {x A s x V 0 i M + im B s } (34) As above, it holds that V i+1 V i for all i = 0, 1,... and if V k = V k+1 for some k, then V i = V k for all i k. Let q be the smallest k N such that V k = V k+1. Obviously, q n x. We claim that V q = V mi in the next theorem of which the proof is omitted due to space reasons. Theorem V.4 Consider the SLS (23) and Algorithm V.3. Then, V q = V mi with q := min{k N V k = V k+1 } n x. Note that by defining A s as in (27) and redefining B s R Mnx Mnu as B B s = B M algorithm V.3 yields the largest common outputnulling controlled invariant subspace (under modedependent control). Remark V.5 The algorithm of Section V-A to obtain the largest common controlled invariant subspace (with mode-dependent feedback) for a SLS 15
18 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS inside another subspace is related to the algorithm presented before in [1, 14] for LPV systems for the special case that J i = 0, i = 1,..., M. The algorithm in Section V-B for mode-independent feedback was not presented in the literature before. VI. DDP BY MEASUREMENT FEEDBACK Previously, we assumed that the full state feedback was available for feedback, which is hardly the case in practice. In this section we will therefore show how the DDP with respect to d can be solved using dynamic measurement feedback. A. Solution of DDP with respect to d by modedependent measurement feedback Consider the SLS ẋ(t) = A σ(t) x(t) + B σ(t) u(t) + E σ(t) d(t) y(t) = C σ(t) x(t) z(t) = H σ(t) x(t) + J σ(t) u(t) (35a) (35b) (35c) and the mode-dependent dynamic measurement feedback controller given by the mode-dependent controller ẇ(t) = K σ(t) w(t) + L σ(t) y(t) u(t) = M σ(t) w(t) + N σ(t) y(t) (36a) (36b) which results in the closed-loop system (ẋ(t) ) ( ) ( ) x(t) Eσ(t) = A ẇ(t) e,σ(t) + d(t) (37a) w(t) 0 z(t) = ( ) ( ) x(t) H σ(t) + J σ(t) N σ(t) C σ(t) J σ(t) M σ(t) w(t) ( ) (37b) Ai + B where A e,i = i N i C i B i M i, i = L i C i K i 1,..., M. The problem we would like to tackle in this section is formulated as follows. Problem VI.1 The disturbance decoupling problem with respect to d by mode-dependent measurement feedback amounts to finding K i R nw nw, L i R nw ny, M i R nu nw, N i R nu ny, i = 1,..., M such that (37) is DD with respect to d. Removing the output-nulling requirement in Definition IV.2 and using Theorem IV.3 lead to the following definition. Definition VI.2 A subspace V R nx is called {(A 1, B 1 ),..., (A M, B M )}-invariant, if there exist F j, j = 1,..., M such that (A j + B j F j )V V for all j = 1,..., M. To tackle the problem as introduced in this section we need the following concept that is the dual of common controlled invariant subspaces. Definition VI.3 A subspace Z R nx is called {(C 1, A 1 ),..., (C M, A M )}-invariant, if there exist G j, j = 1,..., M such that (A j + G j C j )Z Z for all j = 1,..., M. Sometimes a {(C 1, A 1 ),..., (C M, A M )}-invariant subspace is called a common conditioned invariant subspace for (35). Similarly, a {(A 1, B 1 ),..., (A M, B M )}-invariant subspace is sometimes called a common controlled invariant subspace. The collection of all sets {G 1,..., G M } that satisfies (A i + G i C i )Z Z, i = 1,..., M, is denoted by G md (Z). Likewise, the collection of all sets {F 1,..., F M } that satisfies (A i + B i F i )V V, i = 1,..., M, is denoted by F md (V). It is clear that (A i + B i F i )V V if and only if (A T i + Fi T Bi T )V V, i = 1,..., M. Here, V denotes the orthogonal complement of V, i.e., V = {w w v = 0 for all v V}. Thus, V is {(B1, A 1 ),..., (BM, A M )} invariant if and only if V is {(A 1, B 1 ),..., (A M, B M )}-invariant. This duality can be used to prove the following. Theorem VI.4 The following statements are equivalent. (i) Z is common conditioned invariant, (ii) A j (Z ker C j ) Z for all j = 1,..., M. We have the following corollary of Theorem III.2. Corollary VI.5 The SLS (37) is disturbance decoupled with respect to d if and only if there exists an {A e1,..., A em }-invariant subspace V e R nx R nw such that im i=1 [ ] Ei V 0 e H 1 + J 1 N 1 C 1 J 1 M 1 ker. H M + J M N M C M J M M M (38) 16
19 CHAPTER 2. DISTURBANCE DECOUPLING OF SWITCHED LINEAR SYSTEMS We are now interested in relating {A e1,..., A em }- invariance of a subspace to geometric properties of the original SLS (35). As an extension of the linear case [13], the concept of {(C 1, A 1, B 1 ),..., (C M, A M, B M )}-pairs will be of importance. Definition VI.6 Consider the SLS (35). A pair of subspaces (Z, V) is called a {(C 1, A 1, B 1 ),..., (C M, A M, B M )}-pair, if Z is a common conditioned invariant subspace for (35), V is a common controlled invariant subspace for (35) and Z V. Ceteris paribus, if V is a common output-nulling controlled invariant subspace then (Z, V) is called an output-nulling {(C 1, A 1, B 1 ),..., (C M, A M, B M )}-pair. Since V e as in Corollary VI.5 lies in the extended state space R nx R nw, it can be projected onto R nx by ( x p(v e ) = {x R nx w V w) e } We can also define the intersection of V e and R nx {0} as ( x i(v e ) = {x R nx V 0) e } Theorem VI.7 Consider the controlled SLS (37) and let V e denote an {A e1,..., A em }- invariant subspace. Then, (i(v e ), p(v e )) is a {(C 1, A 1, B 1 ),..., (C M, A M, B M )}-pair. If V e satisfies H 1 + J 1 N 1 C 1 J 1 M 1 V e ker. H M + J M N M C M J M M M (39) in addition, then (i(v e ), p(v e )) is an output-nulling {(C 1, A 1, B 1 ),..., (C M, A M, B M )}-pair. Proof: Taking σ = σ j, the proof follows along similar lines as the proof of Theorem 6.2 (making the necessary modifications to include the feedthrough terms J i, i = 1,..., M) in [6]. Vice versa we have the following result. Theorem VI.8 Consider the SLS (35). Let (Z, V) be an output-nulling {(C 1, A 1, B 1 ),..., (C M, A M, B M )}-pair. Then there exist a mode-dependent controller (36) and an {A e1,..., A em }-invariant subspace V e R nx R nw satisfying (39) such that i(v e ) = Z, p(v e ) = V. Proof: Let {F 1,..., F M } F md (V) and {G 1,..., G M } G md (Z). Construct N j such that (A j + B j N j C j )Z V by applying Lemma 6.3 in [6] for all j = 1,..., M. Take the mode-dependent controller and V e such that K j = A j + B j F j + G j C j B j N j C j, L j = B j N j G j, M j = F j N j C j, j = 1,..., M and V e = {( x1 0 ) + ( ) } x2 x x 1 Z, x 2 V 2 {A e1,..., A em }-invariance property of V e as constructed above can be proven mutatis mutandis as in the proof of Theorem 6.4 in [6]. Here we will only show that V e satisfies (39). If x 1 Z, (x 1, 0) V e. We claim that H j x 1 +J j N j C j x 1 = 0 for all j = 1,..., M. Since N j is chosen such that (A j + B j N j C j )Z V, our claim is true. If x 2 V, (x 2, x 2 ) V e. It must then hold that (H j + J j N j C j )x 2 +J j (F j N j C j )x 2 = (H j +J j F j )x 2 = 0 for all j = 1,..., M. Since x 2 V, this is also true. Thus we have shown that V e satisfies (39). The proof of the two remaining claims, i(v e ) = Z and p(v e ) = V, can also be obtained from the proof Theorem 6.4 in [6] with minor modifications. Theorem VI.9 Consider the SLS (35). The disturbance decoupling problem by mode-dependent measurement feedback is solvable if and only if there exists an output-nulling {(C 1, A 1, B 1 ),..., (C M, A M, B M )}-pair (Z, V) such that im E i Z i=1 Proof: The proof follows from Theorem VI.7, Theorem VI.8 and Corollary VI.5. Before concluding the paper we will show how a common conditioned invariant subspace that is of particular interest to us can be computed. Definition VI.10 Let W R nx be a subspace. Consider the SLS (35) with d = 0. We define Zmd (W) as the smallest common conditioned invariant subspace that contains W for the SLS (35) that is 17
Systems & Control Letters. controllability of a class of bimodal discrete-time piecewise linear systems including
Systems & Control Letters 6 (3) 338 344 Contents lists available at SciVerse ScienceDirect Systems & Control Letters journal homepage: wwwelseviercom/locate/sysconle Controllability of a class of bimodal
More informationGramians based model reduction for hybrid switched systems
Gramians based model reduction for hybrid switched systems Y. Chahlaoui Younes.Chahlaoui@manchester.ac.uk Centre for Interdisciplinary Computational and Dynamical Analysis (CICADA) School of Mathematics
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 informationDiscussion on: Measurable signal decoupling with dynamic feedforward compensation and unknown-input observation for systems with direct feedthrough
Discussion on: Measurable signal decoupling with dynamic feedforward compensation and unknown-input observation for systems with direct feedthrough H.L. Trentelman 1 The geometric approach In the last
More informationEquivalence of dynamical systems by bisimulation
Equivalence of dynamical systems by bisimulation Arjan van der Schaft Department of Applied Mathematics, University of Twente P.O. Box 217, 75 AE Enschede, The Netherlands Phone +31-53-4893449, Fax +31-53-48938
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 informationDisturbance Decoupling and Unknown-Input Observation Problems
Disturbance Decoupling and Unknown-Input Observation Problems Lorenzo Ntogramatzidis Curtin University of Technology, Australia MTNS - July 5-9, 2010 L. Ntogramatzidis (Curtin University) MTNS - July 5-9,
More informationThe norms can also be characterized in terms of Riccati inequalities.
9 Analysis of stability and H norms Consider the causal, linear, time-invariant system ẋ(t = Ax(t + Bu(t y(t = Cx(t Denote the transfer function G(s := C (si A 1 B. Theorem 85 The following statements
More informationGeometric Control of Patterned Linear Systems
Geometric Control of Patterned Linear Systems Sarah C Hamilton and Mireille E Broucke Abstract We introduce and study a new class of linear control systems called patterned systems Mathematically, this
More informationEvent-Triggered Decentralized Dynamic Output Feedback Control for LTI Systems
Event-Triggered Decentralized Dynamic Output Feedback Control for LTI Systems Pavankumar Tallapragada Nikhil Chopra Department of Mechanical Engineering, University of Maryland, College Park, 2742 MD,
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
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 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 informationV (v i + W i ) (v i + W i ) is path-connected and hence is connected.
Math 396. Connectedness of hyperplane complements Note that the complement of a point in R is disconnected and the complement of a (translated) line in R 2 is disconnected. Quite generally, we claim that
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 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 informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationNull Controllability of Discrete-time Linear Systems with Input and State Constraints
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 2008 Null Controllability of Discrete-time Linear Systems with Input and State Constraints W.P.M.H. Heemels and
More informationDisturbance Attenuation Properties for Discrete-Time Uncertain Switched Linear Systems
Disturbance Attenuation Properties for Discrete-Time Uncertain Switched Linear Systems Hai Lin Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556, USA Panos J. Antsaklis
More informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
More informationObservability and controllability analysis of. linear systems subject to data losses
Observability and controllability analysis of 1 linear systems subject to data losses Raphaël M. Jungers, Atreyee Kundu, W.P.M.H. (Maurice) Heemels arxiv:1609.05840v1 [math.oc] 19 Sep 2016 Abstract We
More informationLecture Note 7: Switching Stabilization via Control-Lyapunov Function
ECE7850: Hybrid Systems:Theory and Applications Lecture Note 7: Switching Stabilization via Control-Lyapunov Function Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio
More informationDisturbance Decoupling Problem
DISC Systems and Control Theory of Nonlinear Systems, 21 1 Disturbance Decoupling Problem Lecture 4 Nonlinear Dynamical Control Systems, Chapter 7 The disturbance decoupling problem is a typical example
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
More information3118 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 57, NO. 12, DECEMBER 2012
3118 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 57, NO 12, DECEMBER 2012 ASimultaneousBalancedTruncationApproachto Model Reduction of Switched Linear Systems Nima Monshizadeh, Harry L Trentelman, SeniorMember,IEEE,
More informationOn Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems
1 On Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems O. Mason and R. Shorten Abstract We consider the problem of common linear copositive function existence for
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 informationTopics in control Tracking and regulation A. Astolfi
Topics in control Tracking and regulation A. Astolfi Contents 1 Introduction 1 2 The full information regulator problem 3 3 The FBI equations 5 4 The error feedback regulator problem 5 5 The internal model
More informationGENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION
Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124
More informationRow and Column Representatives in Qualitative Analysis of Arbitrary Switching Positive Systems
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 19, Numbers 1-2, 2016, 127 136 Row and Column Representatives in Qualitative Analysis of Arbitrary Switching Positive Systems Octavian PASTRAVANU,
More informationRank Tests for the Observability of Discrete-Time Jump Linear Systems with Inputs
Rank Tests for the Observability of Discrete-Time Jump Linear Systems with Inputs Ehsan Elhamifar Mihály Petreczky René Vidal Center for Imaging Science, Johns Hopkins University, Baltimore MD 21218, USA
More informationThe servo problem for piecewise linear systems
The servo problem for piecewise linear systems Stefan Solyom and Anders Rantzer Department of Automatic Control Lund Institute of Technology Box 8, S-22 Lund Sweden {stefan rantzer}@control.lth.se Abstract
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May
More informationJORDAN NORMAL FORM. Contents Introduction 1 Jordan Normal Form 1 Conclusion 5 References 5
JORDAN NORMAL FORM KATAYUN KAMDIN Abstract. This paper outlines a proof of the Jordan Normal Form Theorem. First we show that a complex, finite dimensional vector space can be decomposed into a direct
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 informationDisturbance Attenuation for a Class of Nonlinear Systems by Output Feedback
Disturbance Attenuation for a Class of Nonlinear Systems by Output Feedback Wei in Chunjiang Qian and Xianqing Huang Submitted to Systems & Control etters /5/ Abstract This paper studies the problem of
More informationonly nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr
The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands
More informationL 2 -induced Gains of Switched Systems and Classes of Switching Signals
L 2 -induced Gains of Switched Systems and Classes of Switching Signals Kenji Hirata and João P. Hespanha Abstract This paper addresses the L 2-induced gain analysis for switched linear systems. We exploit
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 informationObservability. It was the property in Lyapunov stability which allowed us to resolve that
Observability We have seen observability twice already It was the property which permitted us to retrieve the initial state from the initial data {u(0),y(0),u(1),y(1),...,u(n 1),y(n 1)} It was the property
More informationGeometric Control Theory
1 Geometric Control Theory Lecture notes by Xiaoming Hu and Anders Lindquist in collaboration with Jorge Mari and Janne Sand 2012 Optimization and Systems Theory Royal institute of technology SE-100 44
More informationLinear Codes, Target Function Classes, and Network Computing Capacity
Linear Codes, Target Function Classes, and Network Computing Capacity Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, and Kenneth Zeger IEEE Transactions on Information Theory Submitted:
More informationLinear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013
Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013 Abstract As in optimal control theory, linear quadratic (LQ) differential games (DG) can be solved, even in high dimension,
More informationLecture 1: Basic Concepts
ENGG 5781: Matrix Analysis and Computations Lecture 1: Basic Concepts 2018-19 First Term Instructor: Wing-Kin Ma This note is not a supplementary material for the main slides. I will write notes such as
More informationAn Optimization-based Approach to Decentralized Assignability
2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016 Boston, MA, USA An Optimization-based Approach to Decentralized Assignability Alborz Alavian and Michael Rotkowitz Abstract
More informationOn the projection onto a finitely generated cone
Acta Cybernetica 00 (0000) 1 15. On the projection onto a finitely generated cone Miklós Ujvári Abstract In the paper we study the properties of the projection onto a finitely generated cone. We show for
More informationControllability of Linear Systems with Input and State Constraints
Proceedings of the 46th IEEE Conference on Decision and Control New Orleans, LA, USA, Dec. 12-14, 2007 Controllability of Linear Systems with Input and State Constraints W.P.M.H. Heemels and M.K. Camlibel
More informationImpulse free solutions for switched differential algebraic equations
Impulse free solutions for switched differential algebraic equations Stephan Trenn Institute of Mathematics, Ilmenau University of Technology, Weimerarer Str. 25, 98693 Ilmenau, Germany Abstract Linear
More informationPredictive control of hybrid systems: Input-to-state stability results for sub-optimal solutions
Predictive control of hybrid systems: Input-to-state stability results for sub-optimal solutions M. Lazar, W.P.M.H. Heemels a a Eindhoven Univ. of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
More informationConvergence Rate of Nonlinear Switched Systems
Convergence Rate of Nonlinear Switched Systems Philippe JOUAN and Saïd NACIRI arxiv:1511.01737v1 [math.oc] 5 Nov 2015 January 23, 2018 Abstract This paper is concerned with the convergence rate of the
More informationComputational Aspects of Aggregation in Biological Systems
Computational Aspects of Aggregation in Biological Systems Vladik Kreinovich and Max Shpak University of Texas at El Paso, El Paso, TX 79968, USA vladik@utep.edu, mshpak@utep.edu Summary. Many biologically
More informationDESIGN OF OBSERVERS FOR SYSTEMS WITH SLOW AND FAST MODES
DESIGN OF OBSERVERS FOR SYSTEMS WITH SLOW AND FAST MODES by HEONJONG YOO A thesis submitted to the Graduate School-New Brunswick Rutgers, The State University of New Jersey In partial fulfillment of the
More informationResearch Division. Computer and Automation Institute, Hungarian Academy of Sciences. H-1518 Budapest, P.O.Box 63. Ujvári, M. WP August, 2007
Computer and Automation Institute, Hungarian Academy of Sciences Research Division H-1518 Budapest, P.O.Box 63. ON THE PROJECTION ONTO A FINITELY GENERATED CONE Ujvári, M. WP 2007-5 August, 2007 Laboratory
More informationOutput Input Stability and Minimum-Phase Nonlinear Systems
422 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 47, NO. 3, MARCH 2002 Output Input Stability and Minimum-Phase Nonlinear Systems Daniel Liberzon, Member, IEEE, A. Stephen Morse, Fellow, IEEE, and Eduardo
More informationNetwork Reconstruction from Intrinsic Noise: Non-Minimum-Phase Systems
Preprints of the 19th World Congress he International Federation of Automatic Control Network Reconstruction from Intrinsic Noise: Non-Minimum-Phase Systems David Hayden, Ye Yuan Jorge Goncalves Department
More informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More informationObserver-based quantized output feedback control of nonlinear systems
Proceedings of the 17th World Congress The International Federation of Automatic Control Observer-based quantized output feedback control of nonlinear systems Daniel Liberzon Coordinated Science Laboratory,
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
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 informationLecture 9 Monotone VIs/CPs Properties of cones and some existence results. October 6, 2008
Lecture 9 Monotone VIs/CPs Properties of cones and some existence results October 6, 2008 Outline Properties of cones Existence results for monotone CPs/VIs Polyhedrality of solution sets Game theory:
More informationDecentralized control with input saturation
Decentralized control with input saturation Ciprian Deliu Faculty of Mathematics and Computer Science Technical University Eindhoven Eindhoven, The Netherlands November 2006 Decentralized control with
More informationGlobal stabilization of feedforward systems with exponentially unstable Jacobian linearization
Global stabilization of feedforward systems with exponentially unstable Jacobian linearization F Grognard, R Sepulchre, G Bastin Center for Systems Engineering and Applied Mechanics Université catholique
More informationTrajectory Tracking Control of Bimodal Piecewise Affine Systems
25 American Control Conference June 8-1, 25. Portland, OR, USA ThB17.4 Trajectory Tracking Control of Bimodal Piecewise Affine Systems Kazunori Sakurama, Toshiharu Sugie and Kazushi Nakano Abstract This
More informationAn introduction to Birkhoff normal form
An introduction to Birkhoff normal form Dario Bambusi Dipartimento di Matematica, Universitá di Milano via Saldini 50, 0133 Milano (Italy) 19.11.14 1 Introduction The aim of this note is to present an
More informationUnit 2, Section 3: Linear Combinations, Spanning, and Linear Independence Linear Combinations, Spanning, and Linear Independence
Linear Combinations Spanning and Linear Independence We have seen that there are two operations defined on a given vector space V :. vector addition of two vectors and. scalar multiplication of a vector
More informationTopic # Feedback Control
Topic #11 16.31 Feedback Control State-Space Systems State-space model features Observability Controllability Minimal Realizations Copyright 21 by Jonathan How. 1 Fall 21 16.31 11 1 State-Space Model Features
More informationNecessary and Sufficient Conditions for Reachability on a Simplex
Necessary and Sufficient Conditions for Reachability on a Simplex Bartek Roszak a, Mireille E. Broucke a a Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto,
More informationRobust Stability. Robust stability against time-invariant and time-varying uncertainties. Parameter dependent Lyapunov functions
Robust Stability Robust stability against time-invariant and time-varying uncertainties Parameter dependent Lyapunov functions Semi-infinite LMI problems From nominal to robust performance 1/24 Time-Invariant
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More informationMath 396. Quotient spaces
Math 396. Quotient spaces. Definition Let F be a field, V a vector space over F and W V a subspace of V. For v, v V, we say that v v mod W if and only if v v W. One can readily verify that with this definition
More informationNonlinear Control Design for Linear Differential Inclusions via Convex Hull Quadratic Lyapunov Functions
Nonlinear Control Design for Linear Differential Inclusions via Convex Hull Quadratic Lyapunov Functions Tingshu Hu Abstract This paper presents a nonlinear control design method for robust stabilization
More informationResearch Article An Equivalent LMI Representation of Bounded Real Lemma for Continuous-Time Systems
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 28, Article ID 67295, 8 pages doi:1.1155/28/67295 Research Article An Equivalent LMI Representation of Bounded Real Lemma
More informationDot Products, Transposes, and Orthogonal Projections
Dot Products, Transposes, and Orthogonal Projections David Jekel November 13, 2015 Properties of Dot Products Recall that the dot product or standard inner product on R n is given by x y = x 1 y 1 + +
More informationStabilization and Self bounded Subspaces
Stabilization and Self bounded Subspaces Lorenzo Ntogramatzidis Curtin University of Technology, Australia MTNS - July 5-9, 2010 L. Ntogramatzidis (Curtin University) MTNS - July 5-9, 2010 1 / 23 Geometric
More informationOutline. Linear Matrix Inequalities in Control. Outline. System Interconnection. j _jst. ]Bt Bjj. Generalized plant framework
Outline Linear Matrix Inequalities in Control Carsten Scherer and Siep Weiland 7th Elgersburg School on Mathematical Systems heory Class 3 1 Single-Objective Synthesis Setup State-Feedback Output-Feedback
More informationExercises * on Linear Algebra
Exercises * on Linear Algebra Laurenz Wiskott Institut für Neuroinformatik Ruhr-Universität Bochum, Germany, EU 4 February 7 Contents Vector spaces 4. Definition...............................................
More informationComputational Approaches to Finding Irreducible Representations
Computational Approaches to Finding Irreducible Representations Joseph Thomas Research Advisor: Klaus Lux May 16, 2008 Introduction Among the various branches of algebra, linear algebra has the distinctions
More information10 Transfer Matrix Models
MIT EECS 6.241 (FALL 26) LECTURE NOTES BY A. MEGRETSKI 1 Transfer Matrix Models So far, transfer matrices were introduced for finite order state space LTI models, in which case they serve as an important
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationNotes on the matrix exponential
Notes on the matrix exponential Erik Wahlén erik.wahlen@math.lu.se February 14, 212 1 Introduction The purpose of these notes is to describe how one can compute the matrix exponential e A when A is not
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 algebra 2. Yoav Zemel. March 1, 2012
Linear algebra 2 Yoav Zemel March 1, 2012 These notes were written by Yoav Zemel. The lecturer, Shmuel Berger, should not be held responsible for any mistake. Any comments are welcome at zamsh7@gmail.com.
More informationEE C128 / ME C134 Feedback Control Systems
EE C128 / ME C134 Feedback Control Systems Lecture Additional Material Introduction to Model Predictive Control Maximilian Balandat Department of Electrical Engineering & Computer Science University of
More information1 Shortest Vector Problem
Lattices in Cryptography University of Michigan, Fall 25 Lecture 2 SVP, Gram-Schmidt, LLL Instructor: Chris Peikert Scribe: Hank Carter Shortest Vector Problem Last time we defined the minimum distance
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 informationThe Cyclic Decomposition of a Nilpotent Operator
The Cyclic Decomposition of a Nilpotent Operator 1 Introduction. J.H. Shapiro Suppose T is a linear transformation on a vector space V. Recall Exercise #3 of Chapter 8 of our text, which we restate here
More informationQuadratic and Copositive Lyapunov Functions and the Stability of Positive Switched Linear Systems
Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007 WeA20.1 Quadratic and Copositive Lyapunov Functions and the Stability of
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationLQR and H 2 control problems
LQR and H 2 control problems Domenico Prattichizzo DII, University of Siena, Italy MTNS - July 5-9, 2010 D. Prattichizzo (Siena, Italy) MTNS - July 5-9, 2010 1 / 23 Geometric Control Theory for Linear
More informationChapter 2 Linear Transformations
Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more
More informationREPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
More informationarzelier
COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.1 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS STABILITY ANALYSIS Didier HENRION www.laas.fr/ henrion henrion@laas.fr Denis ARZELIER www.laas.fr/
More informationStability and Stabilizability of Switched Linear Systems: A Short Survey of Recent Results
Proceedings of the 2005 IEEE International Symposium on Intelligent Control Limassol, Cyprus, June 27-29, 2005 MoA01-5 Stability and Stabilizability of Switched Linear Systems: A Short Survey of Recent
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationAveraged dynamics of a coupled-inductor boost converter under sliding mode control using a piecewise linear complementarity model
IMA Journal of Applied Mathematics (5) Page of doi:.93/imamat/dri7 Averaged dynamics of a coupledinductor boost converter under sliding mode control using a piecewise linear complementarity model NILIANA
More informationNetwork Flows that Solve Linear Equations
Network Flows that Solve Linear Equations Guodong Shi, Brian D. O. Anderson and Uwe Helmke Abstract We study distributed network flows as solvers in continuous time for the linear algebraic equation arxiv:1510.05176v3
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
More informationThe Cayley-Hamilton Theorem and the Jordan Decomposition
LECTURE 19 The Cayley-Hamilton Theorem and the Jordan Decomposition Let me begin by summarizing the main results of the last lecture Suppose T is a endomorphism of a vector space V Then T has a minimal
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 information