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

Jie Mei, Wei Ren, Jie Chen, Brian Anderson

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

    27 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.

    Original languageEnglish
    Title of host publication53rd IEEE Conference on Decision and Control,CDC 2014
    Place of PublicationPiscataway, New Jersey, US
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages2993-2998
    Number of pages6
    EditionPeer Reviewed
    ISBN (Electronic)9781479977468
    ISBN (Print)9781479977451
    DOIs
    Publication statusPublished - 2014
    Event53rd IEEE Conference on Decision and Control - Los Angeles, USA, United States
    Duration: 1 Jan 2014 → …

    Publication series

    NameProceedings of the IEEE Conference on Decision and Control
    NumberFebruary
    Volume2015-February
    ISSN (Print)0743-1546
    ISSN (Electronic)2576-2370

    Conference

    Conference53rd IEEE Conference on Decision and Control
    Country/TerritoryUnited States
    Period1/01/14 → …
    OtherDecember 15-17 2014

    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