Abstract
This paper investigates controllability and observability of multi-agent systems, in which all the agents adopt identical general linear dynamics and the interconnection topologies are switching. For controllability, criteria are established by virtue of the switching sequence and the constructed subspace sequence, respectively. Furthermore, controllability is considered from the viewpoint of graph theory, and distance partition and almost equitable partition are introduced into switching topologies to quantitatively analyse the controllable state set of the system. For observability, sufficient and/or necessary conditions are presented in terms of the system matrices and the associated invariant subspace. Finally, some numerical simulations are worked out to illustrate the theoretical results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.