The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Average Consensus with Packet Drop Communication
Abstract
Average consensus consists in the problem of determining the average of some quantities by means of a distributed algorithm. It is a simple instance of problems arising when designing estimation algorithms operating on data produced by sensor networks. Simple solutions based on linear estimation algorithms have already been proposed in the literature and their performance has been analyzed in detail. If the communication links which allow the data exchange between the sensors have some loss, then the estimation performance will degrade. In this contribution the performance degradation due to this data loss is evaluated.
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
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×
“INTRODUCTION Average consensus problem has been widely studied in the last years [1], [2], [3], [4], [5], [6], [7] both in the context of coordination of mobile autonomous vehicles and in the context of distributed estimation.”
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
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
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-citationAverage consensus on general strongly connected digraphs
Cai, K., & Ishii, H. (2012) · Automatica · doi:10.1016/j.automatica.2012.08.003 · Cited by 263
Average consensus on networks with quantized communication
Frasca, P., Carli, R., Fagnani, F., & Zampieri, S. (2009) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1396 · Cited by 256
Self-citation
Metadata
- Authors
- Fagnani, F., & Zampieri, S.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2009-01
- Volume
- 48
- Issue
- 1
- Pages
- 102-133
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2179660836
- Cited by
- 170
- References
- 3
- FWCI
- 25.70
- 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 with Packet Drop Communication. https://app.cochat.ai/papers/10.1137/060676866
- The paper
- Fagnani, F., & Zampieri, S. (2009). Average Consensus with Packet Drop Communication. SIAM Journal on Control and Optimization. https://doi.org/10.1137/060676866
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.