The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Robust Consensus of Linear Feedback Protocols Over Uncertain Network Graphs
Abstract
In this paper, we study the robust consensus problem for a group of linear discrete-time or continuous-time agents to coordinate over an uncertain communication network, which is to achieve consensus against transmission errors and noises. We model the network by communication links subject to deterministic uncertainties, which can be additive perturbations described by either some unknown transfer functions or norm bounded matrices. We show that the robust consensus problem can generally be solved by solving a simultaneous H∞control problem for a set of low-dimensional subsystems. We also derive necessary conditions for the existence of a protocol achieving robust consensus. The results show that for discrete-time agents the uncertainty size must not exceed the inverse of the Mahler measure of the agents, while for continuous-time agents it must be less than the unity. Sufficient conditions in terms of linear matrix inequalities are further presented to design the robust consensus protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 2×
“Lemma 1 ([19]): For a weighted undirected graph L = DWDT , where W ∈ R ×M is a diagonal matrix, with positive aij [i.”
BackgroundDistributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
Cited by
Dong, X., Hua, Y., Zhou, Y., Ren, Z., & Zhong, Y. (2019) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2018.2792327 · Cited by 436
Metadata
- Authors
- Li, Z., & Chen, J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2017-08
- Volume
- 62
- Issue
- 8
- Pages
- 4251-4258
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2601452338
- Cited by
- 169
- References
- 2
- FWCI
- 11.37
- Type
- journal article
- Language
- en
- Open access
- closed
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: Robust Consensus of Linear Feedback Protocols Over Uncertain Network Graphs. https://app.cochat.ai/papers/10.1109/tac.2017.2685082
- The paper
- Li, Z., & Chen, J. (2017). Robust Consensus of Linear Feedback Protocols Over Uncertain Network Graphs. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2017.2685082
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.