Abstract
In this paper, structural controllability of a leader–follower multi-agent system with multiple leaders is studied. A graphical condition for structural controllability based on the information flow graph of the system is provided. The notions of p -link and q -agent controllability in a multi-leader setting are then introduced, which provide quantitative measures for the controllability of a system subject to failure in the agents and communication links. The problem of leader localization is introduced, which is concerned with finding the minimum number of agents whose selection as leaders results in a p -link or q -agent controllable network. Polynomial-time algorithms are subsequently presented to solve the problem for both cases of undirected and directed information flow graphs.
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.
