Abstract

Group consensus problems in networks of dynamic agents are addressed. We consider the case that communication topologies in a network are switching and the switching occurs among finite topologies. By using double-tree-form transformations, the group consensus is proved to be equivalent to the asymptotical stability of a class of switched linear systems under arbitrary switching signal. Moreover, we study the group consensus problem for the networks of dynamic agents with both switching topologies and transmission delays, some analysis results are derived by the similar technique. Simulation results are worked out to demonstrate the effectiveness of 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

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.