Convergence speed in distributed consensus and averaging

SIAM Journal on Control and Optimization

Volumn 48, Issue 1, 2009, Pages 33-55

  Olshevsky, Alex ^a   Tsitsiklis, John N ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Consensus algorithms; Cooperative control; Distributed averaging

Indexed keywords

POLYNOMIAL APPROXIMATION; TOPOLOGY;

CO-OPERATIVE CONTROL; COMMUNICATION TOPOLOGIES; CONSENSUS ALGORITHMS; CONVERGENCE SPEED; DISTRIBUTED AVERAGING; DISTRIBUTED CONSENSUS; ITERATIVE ALGORITHM; TIME VARYING TOPOLOGY;

ITERATIVE METHODS;

EID: 60349098442     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/060678324     Document Type: Conference Paper

References (33)

1. P.-A. BLIMAN AND D. ANGELI, Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees, http://arxiv.org/abs/math.OC/0610854 (2007).
2. S. BOYD, A. GHOSH, B. PRABHAKAR, AND D. SHAH, Randomized gossip algorithms, IEEE Trans. Inform. Theory, 52 (2006), pp. 2508-2530.
3. D. BERTSEKAS AND J. N. TSITSIKLIS, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.
4. V. D. BLONDEL, J. M. HENDRICKX, A. OLSHEVSKY, AND J. N. TSITSIKLIS, Convergence in multiagent coordination, consensus, and flocking, in Proceedings of the Joint 44th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC'05), Seville, Spain, 2005, pp. 2996-3000.
5. J. CORTES, Finite-time convergent gradient flows with applications to network consensus, Automatica, 42 (2006), pp. 1993-2000.
6. M. CAO, A. S. MORSE, AND B. D. O. ANDERSON, Coordination of an asynchronous, multi-agent system via averaging, in Proceedings of the 16th International Federation of Automatic Control World Congress (IFAC), Prague, Czech Republic, 2005.
7. M. CAO, D. A. SPIELMAN, AND A. S. MORSE, A lower bound on convergence of a distributed network consensus algorithm, in Proceedings of the Joint 44th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC'05), Seville, Spain, 2005, pp. 2356-2361.
8. C. GAO, J. CORTES, AND F. BULLO, Notes on averaging over acyclic digraphs and discrete coverage control, Automatica, 44 (2008), pp. 2120-2127.
9. G. CYBENKO, Dynamic load balancing for distributed memory multiprocessors, J. Parallel Distribut. Comput., 7 (1989), pp. 279-301.
10. M. H. DEGROOT, Reaching a Consensus, J. Amer. Statist. Assoc, 69 (1974), pp. 118-121.
11. A. G. DIMAKIS, A. D. SARWATE, AND M. J. WAINWRIGHT, Geographic gossip: Efficient aggregation for sensor networks, in Proceedings of the Fifth International Conference on Information Processing in Sensor Networks (IPSN), Nashville, TN, 2006, pp. 69-76.
12. P. ERDÖS AND A. RENYI, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl., 5 (1960), pp. 17-61.
13. L. FANG AND P. ANTSAKLIS, On communication requirements for multi-agent consensus seeking, in Proceedings of the Workshop on Networked Embedded Sensing and Control, Lecture Notes in Control and Inform. Sci. 331, Springer, Berlin, 2006, pp. 53-67.
14. A. GANGULI, S. SUSCA, S. MARTINEZ, F. BULLO, AND J. CORTES, On collective motion in sensor networks: Sample problems and distributed algorithms, in Proceedings of the Joint 44th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC'05), Seville, Spain, 2005, pp. 4239-4244.
15. D. GRÜNBAUM, S. VISCIDO, AND J. K. PARRISH, Extracting interactive control algorithms from group dynamics of schooling fish, in Cooperative Control, V. Kumar, N. Leonard, and A. S. Morse, eds., Lecture Notes in Control and Inform. Sci. 309, Springer, New York, 2005, pp. 103-117.
16. N. HIGHAM, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
17. J. M. HENDRICKX AND V. D. BLONDEL, Convergence of linear and non-linear versions of Vicsek model, in Proceedings of 17th International Symposium on Mathematical Theory of Networks and Systems (MTNS'06), Kyoto, Japan, pp. 1229-1240. Available online at http://www-ics.acs. i.kyoto-u.ac.jp/mtns06/papers/0156.pdf.
18. A. JADBABAIE, J. LIN, AND A. S. MORSE, Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Trans. Automat. Control, 48 (2003), pp. 988-1001.
19. Y. KIM AND M. MESBAHI, On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian, IEEE Trans. Automat. Control, 51 (2006), pp. 116-120.
20. S. LI AND H. WANG, Multi-Agent Coordination Using Nearest-Neighbor Rules: Revisiting the Vicsek Model, http://arxiv.org/abs/ cs.MA/0407021 (2004).
21. L. LOVÁSZ, Random walks on graphs: A survey, in Combinatorics, Paul Erdös is Eighty, Vol. 2, D. Miklós, V. T. Sós, and T. Szõnyi, eds., János Bolyai Mathematical Society, Budapest, 1996, pp. 353-398.
22. Y. LIU AND Y. R. YANG, Reputation propagation and agreement in mobile ad hoc networks, in Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC), 2003, pp. 1510-1515.
23. H. J. LANDAU AND A. M. ODLYZKO, Bounds for eigenvalues of certain stochastic matrices, Linear Algebra Appl., 38 (1981), pp. 5-15.
24. M. MEHYAR, D. SPANOS, J. PONGSAJAPAN, S. H. LOW, AND R. M. MURRAY, Distributed averaging on asynchronous communication networks, in Proceedings of the Joint 44th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC'05), Seville, Spain, 2005, pp. 7446-7451.
25. L. MOREAU, Consensus seeking in multi-agent systems using dynamically changing interaction topologies, IEEE Trans. Automat. Control, 50 (2005), pp. 169-182.
26. C. MOALLEMI AND B. VAN ROY, Consensus propagation, IEEE Trans. Inform. Theory, 52 (2006), pp. 4753-4766.
27. R. OLFATI-SABER AND R. M. MURRAY, Consensus problems in networks of agents with switching topology and time-delays, IEEE Trans. Automat. Control, 49 (2004), pp. 1520-1533.
28. R. OLFATI-SABER, J. A. FAX, AND R. M. MURRAY, Consensus and cooperation in networked multi-agent systems, in Proc. IEEE, 95 (2007), pp. 215-233.
29. S. TREIL, Linear Algebra Done Wrong, http://www.math. brown.edu/~treil/papers/LADW/LADW.html.
30. J. N. TSITSIKLIS, Problems in Decentralized Decision Making and Computation, Ph.D. Thesis, Department of EECS, MIT, Cambridge, MA, 1984.
31. J. N. TSITSIKLIS, D. P. BERTSEKAS, AND M. ATHANS, Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Trans. Automat. Control, 31 (1986), pp. 803-812.
32. T. VICSEK, E. CZIROK, E. BEN-JACOB, I. COHEN, AND O. SHOCHET, Novel type of phase transitions in a system of self-driven particles, Phys. Rev. Lett., 75 (1995), pp. 1226-1229.
33. L. XIAO AND S. BOYD, Fast linear iterations for distributed averaging, Systems Control Lett., 53 (2004), pp. 65-78.