Premium
Controllability of discrete‐time multiagent systems with switching topology
Author(s) -
Lu Zehuan,
Zhang Lin,
Wang Long
Publication year - 2018
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4035
Subject(s) - controllability , subspace topology , topology (electrical circuits) , multi agent system , extension topology , upper and lower bounds , linear subspace , dimension (graph theory) , graph , discrete time and continuous time , network topology , mathematics , computer science , network controllability , discrete mathematics , general topology , combinatorics , topological space , pure mathematics , artificial intelligence , mathematical analysis , statistics , centrality , operating system , betweenness centrality
Summary The current theoretical investigation on the controllability of switched multiagent systems mainly focuses on fixed connected topology or union graph without nonaccessible nodes. However, for discrete‐time multiagent systems with switching topology, it is still unknown whether the existing results are valid or not under the condition of arbitrary topology. Based on graph distance partitions and Wonham's geometric approach, we provide the lower and upper bounds for the dimension of controllable subspaces of discrete‐time multiagent systems. Unlike the existing results of controllability with switching topology, the proposed results have the advantage of being applicable to multiagent systems with arbitrary graphic topologies, union graph (strongly connected or not), and coupling weights. We also provide 2 algorithms for computing the lower and upper bounds for the dimension of controllable subspaces, respectively. Furthermore, as a remarkable application, we present how the proposed lower bound can be utilized for achieving the targeted controllability if the dimension of the controllable subspace of the switched system satisfies certain conditions.