Group consensus in multi-agent systems with switching topologies and time delays

0Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Xia, H., Shao, J., & Huang, T. (2015). Group consensus in multi-agent systems with switching topologies and time delays. IFAC-PapersOnLine, 48(28), 444–448. https://doi.org/10.1016/j.ifacol.2015.12.168

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free