The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Average consensus on networks with quantized communication
Abstract
This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well‐known linear diffusion algorithm, we propose a simple and effective adaptation that is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The properties of this algorithm are investigated both by a worst‐case analysis and by a probabilistic analysis, and are shown to depend on the spectral properties of the evolution matrix. A special attention is devoted to the issue of the dependence of the performance on the number of agents, and several examples are given. Copyright © 2008 John Wiley & Sons, Ltd.
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×
“This problem appears in a number of different contexts since the early 80’s (decentralized computation [37], load balancing [10], [13], [14]) and, more recently, has attracted much attention for possible applications to sensor networks (data fusion problems [22], [40], [39], clock synchronization [27]) and to coordina…”
BackgroundConsensus 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×
“It is well known in the literature [ 33 ], [4] that, if P is a doubly stochastic matrix with positive diagonal entries and such that GP strongly connected, then the algorithm with exchange of perfect information (1) solves the average consensus problem, namely”
BackgroundGantmacher, F. R. (1984) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 8,520
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
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
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
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Distributed multi‐vehicle coordinated control via local information exchange
Ren, W., & Atkins, E. (2007) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1147 · Cited by 1,484
Cited by
Distributed Consensus With Limited Communication Data Rate
Li, T., Fu, M., Xie, L., & Zhang, J.-F. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2052384 · Cited by 565
Kar, S., Moura, J. M. F., & Ramanan, K. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191450 · Cited by 476
Decentralized, Adaptive Coverage Control for Networked Robots
Schwager, M., Rus, D., & Slotine, J.-J. (2009) · The International Journal of Robotics Research · doi:10.1177/0278364908100177 · Cited by 455
Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
Kar, S., & Moura, J. M. F. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2036046 · Cited by 435
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
Self-citation
Metadata
- Authors
- Frasca, P., Carli, R., Fagnani, F., & Zampieri, S.
- Venue
- International Journal of Robust and Nonlinear Control
- Publisher
- Wiley
- Published
- 2008-11-12
- Volume
- 19
- Issue
- 16
- Pages
- 1787-1816
- ISSN
- 1049-8923 (ISSN-L)
- 1099-1239
- OpenAlex
- W1974291577
- Cited by
- 256
- References
- 36
- FWCI
- 36.76
- 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: Average consensus on networks with quantized communication. https://app.cochat.ai/papers/10.1002/rnc.1396
- The paper
- Frasca, P., Carli, R., Fagnani, F., & Zampieri, S. (2009). Average consensus on networks with quantized communication. International Journal of Robust and Nonlinear Control. https://doi.org/10.1002/rnc.1396
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.