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
cacute, C., Vs, M., Doob, M., & Sachs, H. (1980) · Cited by 1,478
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
A scheme for robust distributed sensor fusion based on average consensus
Xiao, L., Boyd, S., & Lall, S. (2005) · doi:10.5555/1147685.1147698 · Cited by 1,170
Distributed average consensus with least-mean-square deviation
Xiao, L., Boyd, S., & Kim, S.-J. (2007) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2006.08.010 · Cited by 1,107
Feedback Control Under Data Rate Constraints: An Overview
Nair, G. N., Fagnani, F., Zampieri, S., & Evans, R. J. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887294 · Cited by 1,090
Self-citationDynamic load balancing for distributed memory multiprocessors
Cybenko, G. (1989) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(89)90021-x · Cited by 997
Kashyap, A., Başar, T., & Srikant, R. (2007) · Automatica · doi:10.1016/j.automatica.2007.01.002 · Cited by 749
Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
Cortes, J., Martinez, S., & Bullo, F. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.878713 · Cited by 695
On Distributed Averaging Algorithms and Quantization Effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031203 · Cited by 557
Global clock synchronization in sensor networks
Li, Q., & Rus, D. (2006) · IEEE Transactions on Computers · doi:10.1109/tc.2006.25 · Cited by 419
Randomized consensus algorithms over large scale networks
Fagnani, F., & Zampieri, S. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080506 · Cited by 350
Self-citationComputing aggregates for monitoring wireless sensor networks
Zhao, J., Govindan, R., & Estrin, D. L. (2003) · doi:10.1109/snpa.2003.1203364 · Cited by 325
Communication constraints in the average consensus problem
Carli, R., Fagnani, F., Speranzon, A., & Zampieri, S. (2008) · Automatica · doi:10.1016/j.automatica.2007.07.009 · Cited by 301
Self-citationBabai, L. (1979) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(79)90079-0 · Cited by 204
Average Consensus with Packet Drop Communication
Fagnani, F., & Zampieri, S. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/060676866 · Cited by 170
Self-citationDistributed Average Consensus using Probabilistic Quantization
Aysal, T. C., Coates, M., & Rabbat, M. (2007) · IEEE/SP Workshop on Statistical Signal Processing (SSP) · doi:10.1109/ssp.2007.4301337 · Cited by 137
A hierarchical cyclic pursuit scheme for vehicle networks
Smith, S. L., Broucke, M. E., & Francis, B. A. (2005) · Automatica · doi:10.1016/j.automatica.2005.01.001 · Cited by 120
Average consensus on networks with transmission noise or quantization
Ruggero Carli, A., Fagnani, F., Frasca, P., Taylor, T., & Zampieri, S. (2007) · European Control Conference (ECC) · doi:10.23919/ecc.2007.7068829 · Cited by 86
Self-citationOn distributed averaging algorithms and quantization effects
Nedić, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2008) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2008.4738891 · Cited by 63
Average consensus by gossip algorithms with quantized communication
Frasca, P., Carli, R., Fagnani, F., & Zampieri, S. (2008) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2008.4738921 · Cited by 48
Self-citationOptimal strategies in the average consensus problem
Delvenne, J., Carli, R., & Zampieri, S. (2007) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2007.4434483 · Cited by 36
Self-citationDistributed Consensus Algorithms in Sensor Networks: Quantized DataPreprint
Kar, S., & Moura, J. M. F. (2007) · arXiv (Cornell University) · Cited by 30
A probabilistic analysis of the average consensus algorithm with quantized communication
Carli, R., Fagnani, F., Frasca, P., et al. (2008) · IFAC Proceedings Volumes · doi:10.3182/20080706-5-kr-1001.01361 · Cited by 28
Self-citationOn Distributed Averaging Algorithms and Quantization EffectsPreprint
Nedić, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0711.4179 · Cited by 26
Average consensus with packet drop communication
Fagnani, F., & Zampieri, S. (2006) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2006.377319 · Cited by 21
Self-citationThe quantization error in the average consensus problem
Carli, R., Fagnani, F., Frasca, P., & Zampieri, S. (2008) · Mediterranean Conference on Control and Automation (MED) · doi:10.1109/med.2008.4602042 · Cited by 7
Self-citation
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
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.