Abstract
Group consensus problems in networks of dynamic agents are addressed for two cases: (i) communication topologies are switching and the switching occurs among finite topologies arbitrarily; (ii) communication topologies are switching and the switching occurs among finite topologies arbitrarily, and there exist communication delays. We introduce double-tree-form transformations under which dynamic equations of agents are transformed into reduced-order systems. Based on the reduced-order systems, we obtain some analysis results for the two cases. In addition, we further investigate multi-group consensus as an extension of the group consensus, and present some analysis results by similar techniques. Simulation results are presented to demonstrate the effectiveness of the theoretical results.
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.
