Stochastic consensus over weighted directed networks

Maurizio Porfiri, Daniel J. Stilwell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication between 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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 American Control Conference, ACC
Pages1425-1430
Number of pages6
DOIs
StatePublished - 2007
Event2007 American Control Conference, ACC - New York, NY, United States
Duration: Jul 9 2007Jul 13 2007

Other

Other2007 American Control Conference, ACC
CountryUnited States
CityNew York, NY
Period7/9/077/13/07

Fingerprint

Switches
Communication

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Porfiri, M., & Stilwell, D. J. (2007). Stochastic consensus over weighted directed networks. In Proceedings of the 2007 American Control Conference, ACC (pp. 1425-1430). [4282571] https://doi.org/10.1109/ACC.2007.4282571

Stochastic consensus over weighted directed networks. / Porfiri, Maurizio; Stilwell, Daniel J.

Proceedings of the 2007 American Control Conference, ACC. 2007. p. 1425-1430 4282571.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Porfiri, M & Stilwell, DJ 2007, Stochastic consensus over weighted directed networks. in Proceedings of the 2007 American Control Conference, ACC., 4282571, pp. 1425-1430, 2007 American Control Conference, ACC, New York, NY, United States, 7/9/07. https://doi.org/10.1109/ACC.2007.4282571
Porfiri M, Stilwell DJ. Stochastic consensus over weighted directed networks. In Proceedings of the 2007 American Control Conference, ACC. 2007. p. 1425-1430. 4282571 https://doi.org/10.1109/ACC.2007.4282571
Porfiri, Maurizio ; Stilwell, Daniel J. / Stochastic consensus over weighted directed networks. Proceedings of the 2007 American Control Conference, ACC. 2007. pp. 1425-1430
@inproceedings{91df4d159212434e9666ed87eaf6a5b5,
title = "Stochastic consensus over weighted directed networks",
abstract = "We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication between 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.",
author = "Maurizio Porfiri and Stilwell, {Daniel J.}",
year = "2007",
doi = "10.1109/ACC.2007.4282571",
language = "English (US)",
isbn = "1424409888",
pages = "1425--1430",
booktitle = "Proceedings of the 2007 American Control Conference, ACC",

}

TY - GEN

T1 - Stochastic consensus over weighted directed networks

AU - Porfiri, Maurizio

AU - Stilwell, Daniel J.

PY - 2007

Y1 - 2007

N2 - We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication between 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.

AB - We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication between 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.

UR - http://www.scopus.com/inward/record.url?scp=46449100636&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46449100636&partnerID=8YFLogxK

U2 - 10.1109/ACC.2007.4282571

DO - 10.1109/ACC.2007.4282571

M3 - Conference contribution

SN - 1424409888

SN - 9781424409884

SP - 1425

EP - 1430

BT - Proceedings of the 2007 American Control Conference, ACC

ER -