Using Hierarchical Decomposition to Speed Up Average Consensus

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. Consensus is performed within the individual subgraphs starting with those of the lowest layer of the hierarchy and moving upwards. Certain “leader” nodes bridge the layers of the hierarchy. By exploiting the increased convergence speed of the smaller subgraphs, we show 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 performance bounds are derived and simulations provided to illustrate the effectiveness of the scheme.

[1]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[2]  Richard M. Murray,et al.  INFORMATION FLOW AND COOPERATIVE CONTROL OF VEHICLE FORMATIONS , 2002 .

[3]  Randy A. Freeman,et al.  Optimal information propagation in sensor networks , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[4]  Xiaobo Tan,et al.  A Stochastic Algorithm for Self-Organization of Autonomous Swarms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[5]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[6]  Richard M. Murray,et al.  DISTRIBUTED SENSOR FUSION USING DYNAMIC CONSENSUS , 2005 .

[7]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[8]  R. Olfati-Saber.  Ultrafast consensus in small-world networks , 2005, Proceedings of the 2005, American Control Conference, 2005..

[9]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[10]  Michael S. Epstein,et al.  Managing information in networked and multi-agent control systems , 2008 .

[11]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.