New Results of Multi-Agent Controllability Under Equitable Partitions
| Autor: | Jijun Qu, Zhijian Ji, Yanhong Lou |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
General Computer Science Computer science General Engineering Fixed topology Graph theory 02 engineering and technology equitable partition controllability matrix Network topology Topology Leader-follower multi-agent systems Partition (database) Quotient graph controllability Controllability eigenvector 020901 industrial engineering & automation 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing General Materials Science lcsh:Electrical engineering. Electronics. Nuclear engineering lcsh:TK1-9971 Eigenvalues and eigenvectors Subspace topology |
| Zdroj: | IEEE Access, Vol 8, Pp 73523-73535 (2020) |
| ISSN: | 2169-3536 |
| Popis: | This paper studies the controllability of leader-follower multi-agent systems under fixed topology. The relationship between controllability and information communication topologies is characterized by taking advantage of equitable partitions. Firstly, for one non-trivial cell taking leaders role, a graph theory method is proposed to determine the multi-agent controllability. Secondly, the controllability of undirected graphs consisting of four nodes is analyzed in detail, and the limitation of the equitable partition in controllability analysis is pointed out for the first time. Thirdly, the results of four-node graphs are extended to general topologies, by which, we reveal the relationship between the ranks of controllability matrix of the quotient graph and original graph. Finally, the effect of non-trivial cells on the controllable subspace is analyzed from the viewpoint of controllability matrix and eigenvector. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|