Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems

We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, strongly connected communication topology (digraph). Both distributed algorithms achieve their goal asymptotically and operate iteratively by having each node adapt the (nonnegative) weights on its outgoing edges based on the weights of its incoming links.The weight-balancing algorithm is shown to admit geometric convergence rate, whereas the second algorithm, which is a modification of the weight-balancing algorithm, leads asymptotically to a bistochastic digraph with geometric convergence rate for a certain set of initial values. The two algorithms perform better than existing approaches, as illustrated by the examples we provide.

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

[2]  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).

[3]  John N. Tsitsiklis,et al.  On Distributed Averaging Algorithms and Quantization Effects , 2008, IEEE Trans. Autom. Control..

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

[5]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[6]  C. N. Hadjicostis,et al.  Distributed strategies for balancing a weighted digraph , 2012, 2012 20th Mediterranean Conference on Control & Automation (MED).

[7]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Damiano Varagnolo,et al.  Distributed parametric and nonparametric regression with on-line performance bounds computation , 2012, Autom..

[9]  Christoforos N. Hadjicostis,et al.  Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs , 2013, IEEE Transactions on Automatic Control.

[10]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[11]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

[13]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[14]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[15]  Christoforos N. Hadjicostis,et al.  Asynchronous coordination of distributed energy resources for the provisioning of ancillary services , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[17]  David Angeli,et al.  Stability of leaderless discrete-time multi-agent systems , 2006, Math. Control. Signals Syst..

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

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

[20]  Joe Michael Kniss,et al.  Satisficing the Masses: Applying Game Theory to Large-Scale, Democratic Decision Problems , 2009, 2009 International Conference on Computational Science and Engineering.

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