Yuan, Y and Liu, J and Murray, RM and Goncalves, J (2012) Decentralised minimal-time dynamic consensus. Proceedings of the American Control Conference. pp. 800-805. ISSN 0743-1619Full text not available from this repository.
This paper considers a group of agents that aim to reach an agreement on individually received time-varying signals by local communication. In contrast to static network averaging problem, the consensus considered 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 a minimal number of local observations of a 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 as suggested by Olshevsky and Tsitsiklis. © 2012 AACC American Automatic Control Council).
|Divisions:||Div F > Control|
|Depositing User:||Cron Job|
|Date Deposited:||18 May 2016 17:51|
|Last Modified:||25 Jul 2016 07:42|