Communication constraints in coordinated consensus problems
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems. Particular examples are systems comprised of multiple agents. When it comes to coordinately control a group of autonomous mobile agents in order to achieve a common task, communications constraints impose limits on the achievable control performance. Starting from an emerging problem, studied in the robotics and control communities, called consensus or state agreement problem, we characterize the relationship between the amount of information exchanged by the agents and the rate of convergence to the agreement. In particular we show that communication networks that exhibit particular symmetries yield slow convergence, if the amount of information exchanged does not scale with the number of agents. On the other hand, if we allow exchange of logarithmic quantized data, the control performance significantly improves with little growth of the required communication effort
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
Cited by
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
“[6]).”
Kashyap, A., Başar, T., & Srikant, R. (2007) · Automatica · doi:10.1016/j.automatica.2007.01.002 · Cited by 749
Li, T., & Zhang, J.-F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2042982 · Cited by 606
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
Huang, M., & Manton, J. H. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/06067359x · Cited by 401
Metadata
- Authors
- Carli, R., Fagnani, F., Speranzon, A., & Zampieri, S.
- Venue
- 2006 American Control Conference
- Publisher
- IEEE
- Published
- 2006
- Pages
- 6 pp.
- ISSN
- 0743-1619 (ISSN-L)
- OpenAlex
- W2122552472
- Cited by
- 46
- References
- 1
- FWCI
- 6.06
- Type
- conference paper
- 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.