Abstract
For a multi-agent system with each agent having general linear dynamics, necessary and sufficient algebraic conditions are proposed for controllability. Then the difference in algebraic controllability conditions between single-integrator and generic multi-agent systems is pointed out. Based on these conditions and the identified indecisive graph node, a method is finally developed for the design of controllable topologies. The result also indicates the importance of recognition of uncontrollable topology structures.
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.
