Consensus of linear multi-agent systems with fully distributed control gains under a general directed graph

Jie Mei, Wei Ren, Jie Chen, Brian D. O. Anderson

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

30 Citations (Scopus)

Abstract

In this paper, we study the leaderless consensus problem for general linear multi-agent systems under a general directed graph. A distributed consensus algorithm with gain adaption is proposed. A novel integral-type Lyapunov function is constructed to study the consensus convergence. The control gains are varying and updated adaptively by distributed adaptive laws. The proposed algorithms require no global information and thus can be implemented in a fully distributed manner. © 2014 IEEE
Original languageEnglish
Title of host publication53rd IEEE Conference on Decision and Control
PublisherIEEE
Pages2993-2998
ISBN (Electronic)978-1-4673-6090-6, 978-1-4799-7745-1
ISBN (Print)978-1-4799-7746-8
DOIs
Publication statusPublished - Dec 2014
Event53rd IEEE Annual Conference on Decision and Control (CDC 2014) - J.W. Marriott Hotel, Los Angeles, United States
Duration: 15 Dec 201417 Dec 2014
http://cdc2014.ieeecss.org/

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Conference

Conference53rd IEEE Annual Conference on Decision and Control (CDC 2014)
PlaceUnited States
CityLos Angeles
Period15/12/1417/12/14
Internet address

Fingerprint

Dive into the research topics of 'Consensus of linear multi-agent systems with fully distributed control gains under a general directed graph'. Together they form a unique fingerprint.

Cite this