Referenced Items are not available for this document.
We consider the consensus problem for stochastic discrete-time linear dynamical systems. The underlying graph of such systems at a given time instance is derived from a random graph process, independent of other time instances. For such a framework, we present a necessary and sufficient condition for almost sure asymptotic consensus using simple ergodicity and probabilistic arguments. This easily verifiable condition uses the spectrum of the average weight matrix. Finally, we investigate a special case for which the linear dynamical system converges to a fixed vector with probability 1.
Published in:
Automatic Control, IEEE Transactions on
(Volume:53
,
Issue:
3
)
Date of Publication: April 2008
- Page(s):
- 791 - 795
- ISSN :
- 0018-9286
- INSPEC Accession Number:
- 9921166
- Digital Object Identifier :
- 10.1109/TAC.2008.917743
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 08 April 2008
- Issue Date :
- April 2008
- Sponsored by :
- IEEE Control Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
