The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Distributed Consensus With Limited Communication Data Rate
Abstract
Communication data rate and energy constraints are important factors which have to be considered when investigating distributed coordination of multi-agent networks. Although many proposed average-consensus protocols are available, a fundamental theoretic problem remains open, namely, how many bits of information are necessary for each pair of adjacent agents to exchange at each time step to ensure average consensus? In this paper, we consider average-consensus control of undirected networks of discrete-time first-order agents under communication constraints. Each agent has a real-valued state but can only exchange symbolic data with its neighbors. A distributed protocol is proposed based on dynamic encoding and decoding. It is proved that under the protocol designed, for a connected network, average consensus can be achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. An explicit form of the asymptotic convergence rate is given. It is shown that as the number of agents increases, the asymptotic convergence rate is related to the scale of the network, the number of quantization levels and the ratio of the second smallest eigenvalue to the largest eigenvalue of the Laplacian of the communication graph. We also give a performance index to characterize the total communication energy to achieve average consensus and show that the minimization of the communication energy leads to a tradeoff between the convergence rate and the number of quantization levels.
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
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
Consensus 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 1×
“From then on, many valuable results ([6]–[10]) have appeared.”
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
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
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Distributed 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
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Cited by
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
Li, Z., Wen, G., Duan, Z., & Ren, W. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2350391 · Cited by 1,137
Li, Z., Ren, W., Liu, X., & Fu, M. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2235715 · Cited by 841
Self-citationDistributed networked control systems: A brief overview
Ge, X., Yang, F., & Han, Q.-L. (2017) · Information Sciences · doi:10.1016/j.ins.2015.07.047 · Cited by 679
Distributed consensus of linear multi-agent systems with adaptive dynamic protocols
Li, Z., Ren, W., Liu, X., & Xie, L. (2013) · Automatica · doi:10.1016/j.automatica.2013.03.015 · Cited by 672
Self-citationYou, K., & Xie, L. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2164017 · Cited by 622
Self-citationLi, Z., Duan, Z., & Lewis, F. L. (2014) · Automatica · doi:10.1016/j.automatica.2013.12.008 · Cited by 325
Discontinuities and hysteresis in quantized average consensus
Ceragioli, F., De Persis, C., & Frasca, P. (2011) · Automatica · doi:10.1016/j.automatica.2011.06.020 · Cited by 322
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
(2017) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 288
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
Average consensus on general strongly connected digraphs
Cai, K., & Ishii, H. (2012) · Automatica · doi:10.1016/j.automatica.2012.08.003 · Cited by 263
Metadata
- Authors
- Li, T., Fu, M., Xie, L., & Zhang, J.-F.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-02
- Volume
- 56
- Issue
- 2
- Pages
- 279-292
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2161874107
- Cited by
- 565
- References
- 39
- FWCI
- 51.16
- 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.