Improved multi-agent controllability processing technique based on equitable partition.

ABSTRACT

In this paper, we study the controllability of multi-agent systems by equitable partition and automorphism. For the case that cells are incompletely connected outside but completely connected inside, a necessary condition for controllability is given from the perspective of the rank of connection matrix. For the case of multiple cells being completely connected outside and incompletely connected inside, in terms of the eigenvalues and eigenvectors of L and Lπ, several sufficient and necessary conditions for controllability are presented. Once the quotient graph is controllable under single input or all nodes in nontrivial cells are leaders, the lower bound of controllable subspace is determined. Finally, we give the gap between the necessary condition and the sufficient condition for controllability from the aspect of equitable partition. One highlight of the results in this paper is that we show sufficient conditions to judge controllability by equitable partition and automorphism, which, for specific cases, provides one method that how to break through the defect that equitable partition can only obtain necessary conditions.