https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Decentralised_minimal-time_dynamic_consensus 2026-07-25T11:46:11Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Decentralised_minimal-time_dynamic_consensus&diff=19751&oldid=prev 2016-05-15T06:16:00Z

<p>htdb2wiki: creating page for 2011k_ylmg12-acc.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Ye Yuan, Jun Liu, Richard M. Murray and Jorge Gonçalves<br /> | title = Decentralised minimal-time dynamic consensus<br /> | source = Submitted, 2012 American Control Conference (ACC)<br /> | year = 2011<br /> | type = Conference Paper<br /> | funding = <br /> | url = http://www.cds.caltech.edu/~murray/preprints/ylmg12-acc_s.pdf<br /> | abstract = <br /> 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.<br /> | flags = <br /> | tag = ylmg12-acc<br /> | id = 2011k<br /> }}</div>

Murray