Distributed Strategies for Generating Weight-Balanced and Doubly Stochastic Digraphs

Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph as doubly stochasticable (weight-balanceable) if it admits a doubly stochastic (weight-balanced) adjacency matrix. This paper studies the characterization of both classes of digraphs, and introduces distributed algorithms to compute the appropriate set of weights in each case.

[1]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[2]  Mikael Johansson,et al.  A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems , 2009, SIAM J. Optim..

[3]  Chris Arney.  Sync: The Emerging Science of Spontaneous Order , 2007 .

[4]  M. Spong,et al.  Stable flocking of multiple inertial agents on balanced graphs , 2006, 2006 American Control Conference.

[5]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[6]  S. Strogatz.  From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillators , 2000 .

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

[8]  B. Anderson,et al.  The Contraction Coefficient of a Complete Gossip Sequence , 2010 .

[9]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[10]  Long Wang,et al.  Virtual Leader Approach to Coordinated Control of Multiple Mobile Agents with Asymmetric Interactions , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[12]  Loh Hooi-Tong,et al.  On a Class of Directed Graphs - With an Application to Traffic-Flow Problems , 1970, Oper. Res..

[13]  D. Sumpter.  Collective Animal Behavior , 2010 .

[14]  David G. Luenberger,et al.  Linear and Nonlinear Programming: Second Edition , 2003 .

[15]  Jorge Cortés,et al.  Distributed algorithms for reaching consensus on general functions , 2008, Autom..

[16]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[17]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[18]  Stephen P. Boyd,et al.  Upper bounds on algebraic connectivity via convex optimization , 2006 .

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

[20]  J. Cortés,et al.  When does a digraph admit a doubly stochastic adjacency matrix? , 2010, Proceedings of the 2010 American Control Conference.

[21]  A. Ōkubo.  Dynamical aspects of animal grouping: swarms, schools, flocks, and herds. , 1986, Advances in biophysics.

[22]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[23]  J. Cortés,et al.  Distributed strategies for making a digraph weight-balanced , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[24]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[25]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[26]  S. Gueron,et al.  Self-organization of front patterns in large wildebeest herds , 1993 .

[27]  Sonia Martínez,et al.  On Distributed Convex Optimization Under Inequality and Equality Constraints , 2010, IEEE Transactions on Automatic Control.

[28]  C. Wu.  Algebraic connectivity of directed graphs , 2005 .

[29]  Ming Cao,et al.  Topology design for fast convergence of network consensus algorithms , 2007, 2007 IEEE International Symposium on Circuits and Systems.

[30]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[31]  Steven V. Viscido,et al.  Self-Organized Fish Schools: An Examination of Emergent Properties , 2002, The Biological Bulletin.

[32]  Jiangping Hu,et al.  Leader-following coordination of multi-agent systems with coupling time delays , 2007, 0705.0401.

[33]  S. Gueron,et al.  The Dynamics of Herds: From Individuals to Aggregations , 1996 .

[34]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[35]  Guy Theraulaz,et al.  Self-Organization in Biological Systems , 2001, Princeton studies in complexity.

[36]  Ivan Lavallée,et al.  A Distributed Algorithm for the Maximum Flow Problem , 2005, The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05).

[37]  J. P. Lasalle.  Some Extensions of Liapunov's Second Method , 1960 .

[38]  Claudio T. Bornstein,et al.  Maximum flow problems under special nonnegative lower bounds on arc flows , 2001, Electron. Notes Discret. Math..

[39]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[40]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[41]  Norman Biggs.  Algebraic Graph Theory: Index , 1974 .