Abstract
This paper addresses the controllability of a class of antagonistic multiagent networks with both positive and negative edges. All the agents of the multiagent network run a consensus algorithm using a signed Laplacian. Based on the generalized equitable partition, we propose a graph-theoretic characterization of an upper bound on the controllable subspace. Then, we provide a necessary condition for the controllability of the system and give an algorithm to compute the partition. Furthermore, we prove that for a structurally balanced network, the controllability is equivalent to that of the corresponding all-positive network, if the leaders are chosen from the same vertex set. Several examples are given to illustrate these results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
