The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Agreement problems in networks with directed graphs and switching topology
Abstract
In this paper, we provide tools for convergence and performance analysis of an agreement protocol for a network of integrator agents with directed information flow. We also analyze algorithmic robustness of this consensus protocol for networks with mobile nodes and switching topology. A connection is established between the Fiedler eigenvalue of the graph Laplacian and the performance of this agreement protocol. We demonstrate that a class of directed graphs, called balanced graphs, have a crucial role in solving average-consensus problems. Based on the properties of balanced graphs, a group disagreement function (i.e. Lyapunov function) is proposed for convergence analysis of this agreement protocol for networks with directed graphs and switching topology.
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
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
Consensus protocols for networks of dynamic agents
Saber, R. O., & Murray, R. M. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1239709 · Cited by 901
Self-citation
Cited by
Average consensus problems in networks of agents with delayed communications
Bliman, P.-A., & Ferrari-Trecate, G. (2008) · Automatica · doi:10.1016/j.automatica.2007.12.010 · Cited by 429
Distributed strategies for average consensus in directed graphs
Domínguez-García, A. D., & Hadjicostis, C. N. (2011) · 2011 50th IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6160462 · Cited by 75
Veerman, J. J. P., Lafferriere, G., Caughman, J. S., & Williams, A. (2005) · Journal of Statistical Physics · doi:10.1007/s10955-005-6999-9 · Cited by 61
Metadata
- Authors
- Saber, R. O., & Murray, R. M.
- Venue
- 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
- Publisher
- IEEE
- Published
- 2004-04-23
- Pages
- 4126-4132
- OpenAlex
- W1563233701
- Cited by
- 211
- References
- 2
- FWCI
- 11.58
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Agreement problems in networks with directed graphs and switching topology. https://app.cochat.ai/papers/10.1109/cdc.2003.1271796
- The paper
- Saber, R. O., & Murray, R. M. (2004). Agreement problems in networks with directed graphs and switching topology. 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475). https://doi.org/10.1109/cdc.2003.1271796
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.
