https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Consensus_Seeking_Using_Multi-Hop_Relay_Protocol 2026-05-09T21:02:11Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Consensus_Seeking_Using_Multi-Hop_Relay_Protocol&diff=19833&oldid=prev 2016-05-15T06:17:20Z

<p>htdb2wiki: creating page for 2007f_jm07-tac.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Zhipu Jin, Richard M Murray<br /> | title = Consensus Seeking Using Multi-Hop Relay Protocol<br /> | source = IEEE Transactions on Automatic Control, 2007 (submitted)<br /> | year = 2007<br /> | type = Preprint<br /> | funding = <br /> | url = http://www.cds.caltech.edu/~murray/preprints/jm07-tac_s.pdf<br /> | abstract = We consider the problem of average consensus seeking in networked multi-agent systems. Based <br /> on local information and a simple distributed algorithm, states of all agents automatically converge to <br /> the average value of the initial conditions, where the convergence speed is determined by the algebraic <br /> connectivity of the underlying communication network. In order to achieve an average consensus quickly, <br /> we propose a new type of consensus protocol, multi-hop relay protocol, in which each agent expands <br /> its knowledge by employing multi-hop communication links. We explicitly show that multi-hop relay <br /> protocol increases the convergence speed without physically changing the network topology. Moreover, <br /> accumulated delays along communication links are discussed. We show that, for multi-hop relay protocol, <br /> the faster the protocol converges, the more sensitive it is to the delay. This tradeoff is identified when <br /> we investigate the stable delay margin using frequency sweep method. <br /> <br /> | flags = <br /> | tag = jm07-tac<br /> | id = 2007f<br /> }}</div>

Murray