Open AccessDistributed consensus protocol design for general linear multi‐agent systems: a consensus region approach
Author(s) -
Li Zhongkui,
Duan Zhisheng
Publication year - 2014
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.2014.0012
Subject(s) - consensus , robustness (evolution) , directed graph , computer science , laplacian matrix , bounded function , multi agent system , distributed computing , uniform consensus , decoupling (probability) , protocol (science) , control theory (sociology) , graph , eigenvalues and eigenvectors , distributed algorithm , graph theory , mathematics , theoretical computer science , control (management) , algorithm , control engineering , engineering , artificial intelligence , alternative medicine , mathematical analysis , pathology , medicine , quantum mechanics , physics , chemistry , biochemistry , combinatorics , gene
This study presents a consensus region approach to designing distributed consensus protocols for multi‐agent systems with general continuous‐time linear node dynamics. The consensus region approach has a favourable decoupling feature, which decouples the design of the feedback gain matrices of the consensus protocols from the communication graph. Multi‐step algorithms are presented to construct the fixed‐gain consensus protocols, which requires the smallest non‐zero eigenvalue of the Laplacian matrix. To remove this limitation, distributed adaptive protocols with time‐varying coupling weights are designed for the cases with undirected and directed graphs, which can be implemented in a fully distributed fashion. The robustness issue of the adaptive protocols in the presence of external disturbances is also discussed. For the case where there exists a leader of bounded unknown control input, distributed discontinuous and continuous controllers are designed to solve the distributed tracking problem.