Almost equitable partitions and new necessary conditions for network controllability
| Autor: | Bahman Gharesifard, Cesar O. Aguilar |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
0209 industrial biotechnology 010102 general mathematics Structure (category theory) 02 engineering and technology Topology 01 natural sciences Network controllability Controllability 020901 industrial engineering & automation Control and Systems Engineering Control system Homogeneous space Graph (abstract data type) 0101 mathematics Electrical and Electronic Engineering Symmetry (geometry) Control (linguistics) Mathematics |
| Zdroj: | Automatica. 80:25-31 |
| ISSN: | 0005-1098 |
| DOI: | 10.1016/j.automatica.2017.01.018 |
| Popis: | In this paper, we consider the controllability problem for multi-agent networked control systems. The main results of the paper are new graph-theoretic necessary conditions for controllability involving almost equitable graph vertex partitions. We generalize the known results on the role of graph symmetries and uncontrollability to weighted digraphs with multiple-leaders and we also consider the broadcasted control scenario. Our results show that the internal structure of communities in a graph can induce obstructions to controllability that cannot be characterized by symmetry arguments alone and that in some cases depend on the number-theoretic properties of the communities. We show via examples that our results can be used to account for a large portion of uncontrollable inducing leader-selections that could not have otherwise been accounted for using symmetry results. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect