The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Abstract
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, strongly rooted, and neighbor-shared are defined, and conditions are derived for compositions of sequences of directed graphs to be of these types. The graph of a stochastic matrix is defined, and it is shown that under certain conditions the graph of a Sarymsakov matrix and a rooted graph are one and the same. As an illustration of the use of the concepts developed in this paper, graph-theoretic conditions are obtained which address the convergence question for the leaderless version of the widely studied Vicsek 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
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
Self-citationDistributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Cited by
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Yu, W., Chen, G., Cao, M., & Kurths, J. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2031624 · Cited by 1,120
Self-citationA tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
Second-order consensus in multi-agent dynamical systems with sampled position data
Yu, W., Zheng, W. X., Chen, G., Ren, W., & Cao, J. (2011) · Automatica · doi:10.1016/j.automatica.2011.02.027 · Cited by 526
Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
Meng, D., Du, M., & Jia, Y. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2528539 · Cited by 401
Zhang, H., Dong, Y., Chiclana, F., & Yu, S. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.11.052 · Cited by 339
Metadata
- Authors
- Cao, M., Morse, A. S., & Anderson, B. D. O.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2008-01
- Volume
- 47
- Issue
- 2
- Pages
- 575-600
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2019312235
- Cited by
- 563
- References
- 2
- FWCI
- 45.54
- 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: Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach. https://app.cochat.ai/papers/10.1137/060657005
- The paper
- Cao, M., Morse, A. S., & Anderson, B. D. O. (2008). Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach. SIAM Journal on Control and Optimization. https://doi.org/10.1137/060657005
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.
