Rearranging trees for robust consensus

In this paper, we use the ℋ2 norm associated with a communication graph to characterize the robustness of consensus to noise. In particular, we restrict our attention to trees, and by systematic attention to the effect of local changes in topology, we derive a partial ordering for undirected trees according to the ℋ2 norm. Our approach for undirected trees provides a constructive method for deriving an ordering for directed trees. Further, our approach suggests a decentralized manner in which trees can be rearranged in order to improve their robustness.

[1]  Zhi-Hong Guan,et al.  Consensus problem in multi-agent systems with physical position neighbourhood evolving network☆ , 2007 .

[2]  Han-Yuan Deng.  The trees on n ‚ 9 vertices with the flrst to seventeenth greatest Wiener indices are chemical trees 1 , 2007 .

[3]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[4]  Li Zhang,et al.  The six classes of trees with the largest algebraic connectivity , 2008, Discret. Appl. Math..

[5]  Naomi Ehrich Leonard,et al.  Robustness of aggregation in networked dynamical systems , 2009, 2009 Second International Conference on Robot Communication and Coordination.

[6]  Mihailo R. Jovanovic,et al.  Effect of topological dimension on rigidity of vehicle formations: Fundamental limitations of local feedback , 2008, 2008 47th IEEE Conference on Decision and Control.

[7]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[8]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

[9]  I. Gutman,et al.  Wiener Index of Trees: Theory and Applications , 2001 .

[10]  D. Sumpter,et al.  Consensus Decision Making by Fish , 2008, Current Biology.

[11]  Mehran Mesbahi,et al.  H2 performance of agreement protocol with noise: An edge based approach , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[12]  Dennis H. Rouvray,et al.  The modeling of chemical phenomena using topological indices , 1987 .

[13]  Roger C. Entringer,et al.  On the Wiener index of trees from certain families , 1994, Australas. J Comb..

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

[15]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[16]  R. Olfati-Saber,et al.  Consensus Filters for Sensor Networks and Distributed Sensor Fusion , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[17]  M. Randic,et al.  Resistance distance , 1993 .

[18]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[19]  Russell Merris,et al.  Ordering trees by algebraic connectivity , 1990, Graphs Comb..

[20]  Naomi Ehrich Leonard,et al.  Robustness of noisy consensus dynamics with directed communication , 2010, Proceedings of the 2010 American Control Conference.

[21]  I. Gutman,et al.  Resistance distance and Laplacian spectrum , 2003 .

[22]  Hawei Dong,et al.  Ordering Trees by Their Wiener Indices , 2006 .

[23]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[24]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[25]  Bo Zhou,et al.  Indices of trees with a prescribed diameter , 2007 .

[26]  郭晓峰,et al.  Trees with extremal Wiener indices , 2008 .