DocumentCode
1123318
Title
Consensus Seeking Over Random Weighted Directed Graphs
Author
Porfiri, Maurizio ; Stilwell, Daniel J.
Author_Institution
Polytech. Univ., Brooklyn
Volume
52
Issue
9
fYear
2007
Firstpage
1767
Lastpage
1773
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
directed graphs; distributed algorithms; stochastic systems; agent communication modeling; agent consensus problem; arbitrary weight; consensus seeking; random weighted directed graphs; stochastic information network; Aerodynamics; Aerospace engineering; Communication switching; Distributed decision making; Graph theory; Manufacturing; Stochastic processes; Sufficient conditions; Switches; Topology; Consensus problem; directed graphs; fast switching; random graphs; weighted graphs;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.2007.904603
Filename
4303240
Link To Document