.png){kind=icon}
Return
Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2014.2350391.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This technical note addresses the distributed consensus protocol design problem for multi-agent systems with general linear dynamics and directed communication graphs. Existing works usually design consensus protocols using the smallest real part of the nonzero eigenvalues of the Laplacian matrix associated with the communication graph, which however is global information. In this technical note, based on only the agent dynamics and the relative states of neighboring agents, a distributed adaptive consensus protocol is designed to achieve leader-follower consensus in the presence of a leader with a zero input for any communication graph containing a directed spanning tree with the leader as the root node. The proposed adaptive protocol is independent of any global information of the communication graph and thereby is fully distributed. Extensions to the case with multiple leaders are further studied.
Keywords:
Adaptive control
consensus
directed graphs
distributed control
multi-agent system
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations
Cited Papers
Distributed consensus of linear multi-agent systems with adaptive dynamic protocols.png)
AUTOMATICAOAAI
AUTOMATICAIF5.9
OAAIShareSaveShareSaveShareSaveShareSaveL‐Cysteine Voltammetry at a Carbon Paste Electrode Bulk‐Modified with Ferrocenedicarboxylic Acid
PREAI
ShareSave
ShareSaveConsensus of high-order linear systems using dynamic output feedback compensator: Low gain approachAUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSave View more