# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Design of switching sequences for controllability realization of switched linear systems. (English) Zbl 1114.93019
Summary: We study the problem of designing switching sequences for controllability of switched linear systems. Each controllable state set of designed switching sequences coincides with the controllable subspace. Both aperiodic and periodic switching sequences are considered. For the aperiodic case, a new approach is proposed to construct switching sequences, and the number of switchings involved in each designed switching sequence is shown to be upper bounded by $d\left(d-{d}_{1}+1\right)$. Here $d$ is the dimension of the controllable subspace, ${d}_{1}=dim{\sum }_{i=1}^{m}〈{A}_{i}|{B}_{i}〉$, where $\left({A}_{i},{B}_{i}\right)$ are subsystems. For the periodic case, we show that the controllable subspace can be realized within $d$ switching periods.
##### MSC:
 93B05 Controllability 93C05 Linear control systems 93C15 Control systems governed by ODE 34H05 ODE in connection with control problems