Abstract

Admissible consensus problems for high-order linear time-invariant descriptor multi-agent systems with switching topologies are dealt with. Firstly, by the state projection on the consensus subspace and the complement consensus subspace, admissible consensus problems are converted into admissible problems of a reduced-order switching subsystem, and an explicit expression of the consensus function is presented based on the First Equivalent Form. Secondly, a necessary and sufficient condition for admissible consensualization is proposed, which can guarantee the scalability of descriptor multi-agent systems since it is independent of the number of agents. Finally, numerical simulations are presented to illustrate 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

Schedule a call

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.