https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Using_Hierarchical_Decomposition_to_Speed_Up_Average_Consensus 2026-06-29T00:40:57Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Using_Hierarchical_Decomposition_to_Speed_Up_Average_Consensus&diff=19826&oldid=prev 2016-05-15T06:17:12Z

<p>htdb2wiki: creating page for 2007p_eljm08-ifac.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Michael Epstein, Kevin Lynch, Karl Henrik Johansson, Richard M Murray<br /> | title = Using Hierarchical Decomposition to Speed Up Average Consensus<br /> | source = International Federation of Automatic Control (IFAC) World Congress, 2008 (to appear)<br /> | year = 2007<br /> | type = Preprint<br /> | funding = <br /> | url = http://www.cds.caltech.edu/~murray/preprints/eljm08-ifac.pdf<br /> | abstract = We study the continuous-time consensus problem where nodes on a graph attempt to reach average consensus. We consider communication graphs that can be decomposed into a hierarchical structure and present a consensus scheme that exploits this hierarchical topology. The scheme consists of splitting the overall graph into layers of smaller connected subgraphs. <br /> Consensus is performed within the individual subgraphs starting with those of the lowest layer of the hierarchy and moving upwards. Certain ``leader&#039;&#039; nodes bridge the layers of the hierarchy. By exploiting the increased convergence speed of the smaller subgraphs, we show <br /> how this scheme can achieve faster overall convergence than the standard single-stage consensus algorithm running on the full graph topology. The result presents some fundamentals on how the communication architecture influences the global performance of a networked system. Analytical <br /> performance bounds are derived and simulations provided to illustrate the effectiveness of the scheme. <br /> | flags = <br /> | tag = eljm08-ifac<br /> | id = 2007p<br /> }}</div>

Murray