Authors: Evgeniy Grechnikov, Ricardo Vieira Godoy
In this paper, we study the linear distributed asymptotic consensus problem for a network of dynamic agents whose communication network is modeled by a randomly switching graph. A finite state Markov process dominates each topology corresponding to a state of the process. We address both the cases where the dynamics of the agents is expressed in continuous and discrete time. As long as the consensus matrices are doubly stochastic, convergence to average consensus can be shown to be achieved in the mean square and almost sure sense. A necessary and sufficient condition is the graph resulted from the union of graphs corresponding to the states of the Markov process contains a spanning tree.
Comments: 9 Pages.
Download: PDF
[v1] 2013-09-16 09:11:51
Unique-IP document downloads: 157 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.