The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Consensus Seeking Over Random Weighted Directed Graphs
Abstract
We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication among agents is modeled as a weighted directed random graph that switches periodically. The existence of any edge is probabilistic and independent from the existence of any other edge. We further allow each edge to be weighted differently. Sufficient conditions for asymptotic almost sure consensus are presented for the case of positive weights and for the case of arbitrary weights.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
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
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
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
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Distributed 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
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
A survey of consensus problems in multi-agent coordination
Ren, W., Beard, R. W., & Atkins, E. M. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470239 · Cited by 1,344
Convergence in Multiagent Coordination, Consensus, and Flocking
Blondel, V. D., Hendrickx, J. M., Olshevsky, A., & Tsitsiklis, J. N. (2006) · Proceedings of the 44th IEEE Conference on Decision and Control · doi:10.1109/cdc.2005.1582620 · Cited by 859
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1430343 · Cited by 550
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.858670 · Cited by 503
Probability: A Graduate Course
(2005) · Springer Texts in Statistics · doi:10.1007/b138932 · Cited by 501
Sufficient Conditions for Fast Switching Synchronization in Time-Varying Network Topologies
Stilwell, D. J., Bollt, E. M., & Roberson, D. G. (2006) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/050625229 · Cited by 363
Self-citationAlgebraic connectivity of directed graphs
Wu, C. W. (2005) · Linear and Multilinear Algebra · doi:10.1080/03081080500054810 · Cited by 161
On Communication Requirements for Multi-agent Consensus Seeking
Fang, L., & Antsaklis, P. J. (2006) · Springer eBooks · doi:10.1007/11533382_4 · Cited by 48
Cited by
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
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
Han, Y., Zhang, K., Li, H., Coelho, E. A. A., & Guerrero, J. M. (2018) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2017.2761438 · Cited by 501
Group consensus in multi-agent systems with switching topologies and communication delays
Yu, J., & Wang, L. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.03.009 · Cited by 485
Cao, Y., Ren, W., & Meng, Z. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.06.002 · Cited by 405
Metadata
- Authors
- Porfiri, M., & Stilwell, D. J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2007-09
- Volume
- 52
- Issue
- 9
- Pages
- 1767-1773
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W1964647857
- Cited by
- 301
- References
- 17
- FWCI
- 36.37
- 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
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.