Multi-agent systems reaching optimal consensus with time-varying communication graphs

Guodong Shi*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

In this paper, an optimal consensus problem for continuous-time multi-agent systems is formulated and solved with time-varying interconnection topologies. Based on a sharp connectivity assumption, the considered multi-agent network with simple nonlinear distributed control rules achieves not only a consensus, but also an optimal one by agreeing within the global optimal solution set of a sum of objective functions corresponding to multiple agents. Convergence analysis is presented, by establishing several key properties of a class of distance functions and invariant sets with the help of convex analysis and non-smooth analysis.

Original languageEnglish
Title of host publicationProceedings of the 18th IFAC World Congress
PublisherIFAC Secretariat
Pages5693-5699
Number of pages7
Edition1 PART 1
ISBN (Print)9783902661937
DOIs
Publication statusPublished - 2011
Externally publishedYes

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number1 PART 1
Volume44
ISSN (Print)1474-6670

Fingerprint

Dive into the research topics of 'Multi-agent systems reaching optimal consensus with time-varying communication graphs'. Together they form a unique fingerprint.

Cite this