Abstract
This paper studies a notion of topological entropy for switched systems, formulated in terms of the minimal number of trajectories needed to approximate all trajectories with a finite precision. For general switched linear systems, we prove that the topological entropy is independent of the set of initial states. We construct an upper bound for the topological entropy in terms of an average of the measures of system matrices of individual modes, weighted by their corresponding active times, and a lower bound in terms of an active-time-weighted average of their traces. For switched linear systems with scalar-valued state and those with pairwise commuting matrices, we establish formulae for the topological entropy in terms of active-time-weighted averages of the eigenvalues of system matrices of individual modes. For the more general case with simultaneously triangularizable matrices, we construct upper bounds for the topological entropy that only depend on the eigenvalues, their order in a simultaneous triangularization, and the active times. In each case above, we also establish upper bounds that are more conservative but require less information on the system matrices or on the switching, with their relations illustrated by numerical examples. Stability conditions inspired by the upper bounds for the topological entropy are presented as well.
Original language | English (US) |
---|---|
Pages (from-to) | 411-453 |
Number of pages | 43 |
Journal | Mathematics of Control, Signals, and Systems |
Volume | 32 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1 2020 |
Externally published | Yes |
Keywords
- Commutation relations
- Exponential stability
- Switched linear systems
- Topological entropy
ASJC Scopus subject areas
- Control and Systems Engineering
- Signal Processing
- Control and Optimization
- Applied Mathematics