Abstract
In this article, the structural controllability of multiagent networks defined over directed signed graphs is investigated, where the agents are divided into leaders and followers, and only leaders are manipulated by the external control input directly. The communication digraph contains positive and negative edges, which represent cooperative and antagonistic interactions between agents, respectively. First, a graph-theoretic necessary and sufficient condition for structural controllability of multiagent networks is derived, that is, a multiagent network is structurally controllable if and only if the communication digraph is leader–follower connected. Next, the minimal controllability problem is studied. It is shown that the minimal controllability problem is solvable, and a method of polynomial complexity to accomplish minimal structural controllability is developed. In addition, the structural controllability of specified Cartesian product networks is discussed and a necessary and sufficient condition concerning the factor networks for the structural controllability is established. The application of the theoretical results is demonstrated by several practical examples.
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.
