A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
The geometry of a probabilistic consensus of opinion algorithm
2011
Proceedings of the 2011 American Control Conference
We consider the problem of a group of agents whose objective is to asymptotically reach agreement of opinion. The agents exchange information subject to a communication topology modeled by a time varying graph. The agents use a probabilistic algorithm under which at each time instant an agent updates its state by probabilistically choosing from its current state/opinion and the ones of its neighbors. We show that under some minimal assumptions on the communication topology (infinitely often
doi:10.1109/acc.2011.5991448
fatcat:2yzmdmysrnbohdbggqaiq74vre