Algebraic and Graph-Theoretic Conditions for the Herdability of Linear Time-Invariant Systems

In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the (interior of the) positive orthant. Specifically, we investigate herdability for linear time-invariant systems, both from an algebraic perspective and based on the graph representing the systems interactions. In addition, we focus on linear state-space models corresponding to matrix pairs (A,B) in which the matrix B is a selection matrix that determines the leaders in the network, and we show that the weights that followers give to the leaders do not affect the herdability of the system. We then focus on the herdability problem for systems with a single leader in which interactions are symmetric and the network topology is acyclic, in which case an algorithm for the leader selection is provided. In this context, under some additional conditions on the mutual distances, necessary and sufficient conditions for the herdability of the overall system are given.

[1]  Magnus Egerstedt,et al.  Herdability of Linear Systems Based on Sign Patterns and Graph Structures , 2019, ArXiv.

[2]  Zhen Kan,et al.  Characterizing controllable subspace and herdability of signed weighted networks via graph partition , 2020, Autom..

[3]  Maria Elena Valcher,et al.  Reachability Properties of Single-Input Continuous-Time Positive Switched Systems , 2010, IEEE Transactions on Automatic Control.

[4]  James M. Bower,et al.  Computational modeling of genetic and biochemical networks , 2001 .

[5]  Panos J. Antsaklis,et al.  Special Issue on Technology of Networked Control Systems , 2007 .

[6]  S. Brahmachari,et al.  Boolean network analysis of a neurotransmitter signaling pathway. , 2007, Journal of theoretical biology.

[7]  J. Jacquez.  Compartmental analysis in biology and medicine , 1985 .

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

[9]  Giuseppe Notarstefano,et al.  On the Reachability and Observability of Path and Cycle Graphs , 2011, IEEE Transactions on Automatic Control.

[10]  Mohammad Haeri,et al.  Strong Structural Controllability of Signed Networks , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[11]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

[12]  Tom A. B. Snijders,et al.  Social Network Analysis , 2011, International Encyclopedia of Statistical Science.

[13]  Magnus Egerstedt,et al.  Herdable Systems Over Signed, Directed Graphs , 2018, 2018 Annual American Control Conference (ACC).

[14]  Mingyu Cai,et al.  Characterizing Herdability of Signed Networks via Graph Walks , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[15]  B. She,et al.  Leader Group Selection for Herdability of Structurally Balanced Signed Networks , 2020, 2020 59th IEEE Conference on Decision and Control (CDC).

[16]  M. SIAMJ.,et al.  Sign Controllability: Sign Patterns That Require Complete Controllability , 1998, SIAM J. Matrix Anal. Appl..

[17]  Wei Li,et al.  On Fault Detection Design for Networked Control Systems , 2009 .