Open AccessDistributed adaptive consensus protocols for multiple Lur'e systems over directed graphs
Author(s) -
Lv Yuezu,
Li Zhongkui,
Duan Zhisheng
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.0682
Subject(s) - bounded function , consensus , computer science , upper and lower bounds , directed graph , multi agent system , adaptive control , protocol (science) , spanning tree , control theory (sociology) , graph , distributed computing , control (management) , mathematics , theoretical computer science , algorithm , discrete mathematics , artificial intelligence , medicine , mathematical analysis , alternative medicine , pathology
This study addresses the leader–follower consensus problem for multi‐agent systems with directed graphs where each agent is modelled as a non‐linear Lur'e system. Both the cases where the leader has zero or bounded control inputs are considered. For the case where the leader is of zero control input, a distributed adaptive protocol is designed, under which leader–follower consensus can be achieved for any directed graph containing a directed spanning tree with the leader as the root. For the case where the leader's control input is unknown, but bounded, a novel continuous distributed adaptive protocol is proposed to guarantee the uniform ultimate boundedness of the consensus error and the adaptive coupling gains. The upper bound of the consensus error is also explicitly derived. In comparison to the existing literature, the main contribution of this paper is that the adaptive protocols in this study are fully distributed and meanwhile applicable to a wide class of directed graphs.