Reference : Decentralised minimal-time dynamic consensus
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Multidisciplinary, general & others
http://hdl.handle.net/10993/20345
Decentralised minimal-time dynamic consensus
English
Yuan, Y. [> >]
Liu, J. [> >]
Murray, R. M. [> >]
Goncalves, Jorge mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
2012
The proceedings of the 2012 American Control Conference (ACC)
800-805
Yes
2012 American Control Conference (ACC)
June 27-29 2012
Montreal
Canada
[en] This paper considers a group of agents that aim to reach an agreement on individually measured time-varying signals by local communication. In contrast to static network
averaging problem, the consensus we mean in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents
tracking the average of their reference inputs asymptotically.
We propose a minimal-time dynamic consensus algorithm, which only utilises minimal number of local observations of randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically using local information as suggested by Olshevsky and Tsitsiklis.
http://hdl.handle.net/10993/20345

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
Decentralised minimal-time dynamic consensus.pdfPublisher postprint583.2 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.