The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems
Abstract
This paper investigates the joint effect of agent dynamic, network topology and communication data rate on consensusability of linear discrete-time multi-agent systems. Neglecting the finite communication data rate constraint and under undirected graphs, a necessary and sufficient condition for consensusability under a common control protocol is given, which explicitly reveals how the intrinsic entropy rate of the agent dynamic and the communication graph jointly affect consensusability. The result is established by solving a discrete-time simultaneous stabilization problem. A lower bound of the optimal convergence rate to consensus, which is shown to be tight for some special cases, is provided as well. Moreover, a necessary and sufficient condition for formationability of multi-agent systems is obtained. As a special case, the discrete-time second-order consensus is discussed where an optimal control gain is designed to achieve the fastest convergence. The effects of undirected graphs on consensability/formationability and optimal convergence rate are exactly quantified by the ratio of the second smallest to the largest eigenvalues of the graph Laplacian matrix. An extension to directed graphs is also made. The consensus problem under a finite communication data rate is finally investigated.
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 8×
“…agents to asymptotically converge to the average of their initial values, the communication graph must contain a spanning tree for a fi xed topology [33], [35] while for a switching topology, the union of the communication graphs should contain a spanning tree frequently enough as the system…”
BackgroundMethodResultInfluentialConsensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 2×
“In addition, the convergence rate to consensus directly relies on the second smallest eigenvalue of the graph Laplacian matrix [31], [33].”
BackgroundCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Cited by
Ding, D., Wang, Z., Ho, D. W. C., & Wei, G. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2582802 · Cited by 470
Global consensus for discrete-time multi-agent systems with input saturation constraints
Yang, T., Meng, Z., Dimarogonas, D. V., & Johansson, K. H. (2014) · Automatica · doi:10.1016/j.automatica.2013.11.008 · Cited by 346
Metadata
- Authors
- You, K., & Xie, L.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-10
- Volume
- 56
- Issue
- 10
- Pages
- 2262-2275
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2059529072
- Cited by
- 622
- References
- 3
- FWCI
- 57.80
- 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: Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems. https://app.cochat.ai/papers/10.1109/tac.2011.2164017
- The paper
- You, K., & Xie, L. (2011). Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2011.2164017
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.
