A sufficient condition for colored strong structural controllability of networks
| Autor: | Jia, Jiajia, Trentelman, Hendrikus, Baar, Wouter, Camlibel, Mehmet, Camlibel, Kanat, Shim, Hyungbo |
|---|---|
| Přispěvatelé: | Systems, Control and Applied Analysis |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
0209 industrial biotechnology Colored graph 010103 numerical & computational mathematics 02 engineering and technology 01 natural sciences Controllability 020901 industrial engineering & automation Colored Control and Systems Engineering Zero Forcing Equalizer Bipartite graph Graph (abstract data type) 0101 mathematics Mathematics |
| Zdroj: | Proceedings of the 7th IFAC Workshop on Distributed Estimation and Control in Networked Systems (NecSys18), August 27-28, Groningen, The Netherlands, 16-21 STARTPAGE=16;ENDPAGE=21;TITLE=Proceedings of the 7th IFAC Workshop on Distributed Estimation and Control in Networked Systems (NecSys18), August 27-28, Groningen, The Netherlands |
| Popis: | This paper deals with strong structural controllability of leader/follower networks. In the existing literature on structural controllability of networks, a basic assumption is that the nonzero off-diagonal entries in the matrices in the qualitative class associated with the network graph are completely independent. However, in real world networks, this assumption is not always satisfied. In this paper, we study the situation that some of these entries are constrained to take identical values. This will be formalized using the concept of colored graphs. Furthermore, we consider colored bipartite graphs and establish a necessary and sufficient graph-theoretic condition for the nonsingularity of all matrices in the associated pattern class. We then introduce a new coloring rule and a new concept of zero forcing set. Based on these concepts, we formulate a graph-theoretic condition for strong structural controllability of systems on colored graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|