Strong excitability of discrete-time positive switched systems

In this paper, strong excitability of discrete-time positive switched systems is introduced and characterized in algebraic terms. Being a structural property, which only depends on the nonzero patterns of the matrices involved, strong excitability is investigated by resorting to a graph-theoretic approach, which allows to derive upper bounds on the strong excitability index.

[1]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[2]  S. Rinaldi,et al.  Positive Linear Systems: Theory and Applications , 2000 .

[3]  S. Rinaldi,et al.  Excitability, stability, and sign of equilibria in positive linear systems , 1991 .

[4]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[5]  D. Stanford,et al.  Controllability and Stabilizability in Multi-Pair Systems , 1980 .

[6]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[7]  David P. Stanford,et al.  The structure of the controllable set for multimodal systems , 1987 .

[8]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[9]  Shuzhi Sam Ge,et al.  Reachability and controllability of switched linear discrete-time systems , 2001, IEEE Trans. Autom. Control..

[10]  Guangming Xie,et al.  Reachability realization and stabilizability of switched linear discrete-time systems☆ , 2003 .

[11]  T. Kaczorek.  Positive 1D and 2D Systems , 2001 .

[12]  M. E. Valcher.  A note on the excitability properties of discrete-time positive switched systems , 2007, 2007 European Control Conference (ECC).

[13]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[14]  P. Santesso,et al.  Reachability properties of discrete-time positive switched systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.