The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 1×
“To illustrate Theorem 1, let the initial states ci(0) and ρi(0) be randomly chosen within the interval [1, 3].”
Background
Cited by
Secure Cooperative Event-Triggered Control of Linear Multiagent Systems Under DoS Attacks
Feng, Z., & Hu, G. (2020) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2892032 · Cited by 407
On constructing Lyapunov functions for multi-agent systems
Zhang, H., Li, Z., Qu, Z., & Lewis, F. L. (2015) · Automatica · doi:10.1016/j.automatica.2015.05.006 · Cited by 282
Self-citationWang, Y.-W., Lei, Y., Bian, T., & Guan, Z.-H. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2908874 · Cited by 258
Observer-Based Event-Triggered Containment Control for MASs Under DoS Attacks
Ma, Y.-S., Che, W.-W., Deng, C., & Wu, Z.-G. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3104178 · Cited by 205
Metadata
- Authors
- Li, Z., Wen, G., Duan, Z., & Ren, W.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2015-04
- Volume
- 60
- Issue
- 4
- Pages
- 1152-1157
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2000806524
- Cited by
- 1,137
- References
- 1
- FWCI
- 71.66
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs. https://app.cochat.ai/papers/10.1109/tac.2014.2350391
- The paper
- Li, Z., Wen, G., Duan, Z., & Ren, W. (2015). Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2014.2350391
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
