Consensus seeking over random weighted directed graphs

Maurizio Porfiri, Daniel L. Stilwell

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)1767-1773
Number of pages7
JournalIEEE Transactions on Automatic Control
Volume52
Issue number9
DOIs
StatePublished - Sep 2007

Fingerprint

Directed graphs
Switches
Communication

Keywords

  • Consensus problem
  • Directed graphs
  • Fast switching
  • Random graphs
  • Weighted graphs

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Consensus seeking over random weighted directed graphs. / Porfiri, Maurizio; Stilwell, Daniel L.

In: IEEE Transactions on Automatic Control, Vol. 52, No. 9, 09.2007, p. 1767-1773.

Research output: Contribution to journalArticle

@article{96b513bbba9043f295783365b59efbc0,
title = "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.",
keywords = "Consensus problem, Directed graphs, Fast switching, Random graphs, Weighted graphs",
author = "Maurizio Porfiri and Stilwell, {Daniel L.}",
year = "2007",
month = "9",
doi = "10.1109/TAC.2007.904603",
language = "English (US)",
volume = "52",
pages = "1767--1773",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Consensus seeking over random weighted directed graphs

AU - Porfiri, Maurizio

AU - Stilwell, Daniel L.

PY - 2007/9

Y1 - 2007/9

N2 - 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.

AB - 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.

KW - Consensus problem

KW - Directed graphs

KW - Fast switching

KW - Random graphs

KW - Weighted graphs

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

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

U2 - 10.1109/TAC.2007.904603

DO - 10.1109/TAC.2007.904603

M3 - Article

VL - 52

SP - 1767

EP - 1773

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 9

ER -