By Topic

Consensus Seeking Over Random Weighted Directed Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Maurizio Porfiri ; Polytech. Univ., Brooklyn ; Daniel J. Stilwell

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.

Published in:

IEEE Transactions on Automatic Control  (Volume:52 ,  Issue: 9 )