The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Communication constraints in the average consensus problem
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 3×
“Notice that, in the special case when the graph G is undirected, namely (i, j) ∈ E if and only if (j, i) ∈ E , we can find solutions K to the consensus problem that are symmetric and that therefore are automatically doubly stochastic, see [33] for details.”
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
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
Diestel, R. (1997) · Cited by 5,082
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
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
Strogatz, S. H. (2000) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(00)00094-4 · Cited by 3,051
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
You, K., & Xie, L. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2164017 · Cited by 622
Distributed Kalman filtering based on consensus strategies
Carli, R., Chiuso, A., Schenato, L., & Zampieri, S. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080505 · Cited by 511
Self-citation
Metadata
- Authors
- Carli, R., Fagnani, F., Speranzon, A., & Zampieri, S.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2008-03
- Volume
- 44
- Issue
- 3
- Pages
- 671-684
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2093356327
- Cited by
- 301
- References
- 39
- FWCI
- 41.15
- 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: Communication constraints in the average consensus problem. https://app.cochat.ai/papers/10.1016/j.automatica.2007.07.009
- The paper
- Carli, R., Fagnani, F., Speranzon, A., & Zampieri, S. (2008). Communication constraints in the average consensus problem. Automatica. https://doi.org/10.1016/j.automatica.2007.07.009
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.
