z-logo
open-access-imgOpen Access
Event‐triggered cooperative compensation control for consensus of heterogeneous multi‐agent systems
Author(s) -
Cui Yanliang,
Fei Minrui,
Du Dajun
Publication year - 2016
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2015.1301
Subject(s) - computer science , trajectory , compensation (psychology) , control theory (sociology) , event (particle physics) , consensus , control (management) , controller (irrigation) , multi agent system , state (computer science) , distributed computing , algorithm , artificial intelligence , psychology , physics , quantum mechanics , psychoanalysis , astronomy , agronomy , biology
This paper addresses the event‐triggered consensus for heterogeneous multi‐agent systems (He‐MASs) via a distributed cooperative compensation control (D3C) strategy. The proposed D3C law involves two dynamics: (i) a pre‐given virtual leader, which specifies the synchronisation trajectory for whole He‐MASs; (ii) two intermediate compensation system, whose system state is broadcasted to neighbour agents through communication network for facilitating the consensus. To further reduce data exchanging frequency so as to alleviate communication burden, an exponential event‐trigger is employed to determine whether the current sampled data need to be broadcasted or suspended. By two concise algebraic Riccati inequalities and some supplement conditions, a sufficient collaborative design method is presented for obtaining the values of D3C gains and the thresholds of event‐trigger, while the Zeno phenomena is also excluded. The proposed strategy guarantees the consensus of He‐MASs and significantly reduces data exchanging amounts. Finally, some illustrative examples are given to validate effectiveness of the proposed results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here