The DOI matches its Crossref record; 45 of the 45 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.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
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].”
BackgroundHorn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Coordination 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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Cited by
Dorri, A., Kanhere, S. S., & Jurdak, R. (2018) · IEEE Access · doi:10.1109/access.2018.2831228 · Cited by 1,043
Guo, G., Ding, L., & Han, Q.-L. (2014) · Automatica · doi:10.1016/j.automatica.2014.03.017 · Cited by 720
Dynamic Event-Triggered and Self-Triggered Control for Multi-agent Systems
Yi, X., Liu, K., Dimarogonas, D. V., & Johansson, K. H. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2874703 · Cited by 550
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
Li, Z., Duan, Z., & Lewis, F. L. (2014) · Automatica · doi:10.1016/j.automatica.2013.12.008 · Cited by 325
Robust Synchronization of Uncertain Linear Multi-Agent Systems
Trentelman, H. L., Takaba, K., & Monshizadeh, N. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2239011 · Cited by 315
Consensus of high-order multi-agent systems with large input and communication delays
Zhou, B., & Lin, Z. (2014) · Automatica · doi:10.1016/j.automatica.2013.12.006 · Cited by 309
Consensus condition for linear multi-agent systems over randomly switching topologies
You, K., Li, Z., & Xie, L. (2013) · Automatica · doi:10.1016/j.automatica.2013.07.024 · Cited by 308
Self-citationSemiglobal Observer-Based Leader-Following Consensus With Input Saturation
Su, H., Chen, M. Z. Q., Wang, X., & Lam, J. (2014) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2013.2275976 · Cited by 291
Overview: Collective Control of Multiagent Systems
Knorn, S., Chen, Z., & Middleton, R. H. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2468991 · Cited by 281
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
- 45
- 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
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.