Consensus seeking over random weighted directed graphs

Maurizio Porfiri; Daniel L. Stilwell

doi:10.1109/TAC.2007.904603

Consensus seeking over random weighted directed graphs

Maurizio Porfiri, Daniel L. Stilwell

Mechanical and Aerospace Engineering

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	1767-1773
Number of pages	7
Journal	IEEE Transactions on Automatic Control
Volume	52
Issue number	9
DOIs	https://doi.org/10.1109/TAC.2007.904603
State	Published - Sep 2007

Keywords

Consensus problem
Directed graphs
Fast switching
Random graphs
Weighted graphs

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/TAC.2007.904603

Cite this

@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 = sep,

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

AN - SCOPUS:34648837204

SN - 0018-9286

VL - 52

SP - 1767

EP - 1773

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 9

ER -

Consensus seeking over random weighted directed graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this