Abstract
In this paper, we investigate the group consensus problem for discrete-time multiagent systems with switching topologies and bounded time delays. The analysis in this paper is based on nonnegative matrix theory and graph theory. Under the assumption of common inter-group influence, the group consensus problem is proved to be solvable, if the union of the communication topology across any time interval with some given length contains group spanning trees. It is also shown that the nonzero in-degree groups finally converge to convex combination of the consensus states of the zero in-degree groups. The effectiveness of the theoretical results is finally demonstrated by the simulation example.
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.
