A lower bound on convergence of a distributed network consensus algorithm

Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference, CDC-ECC '05

Volumn 2005, Issue , 2005, Pages 2356-2361

  Cao, M ^a   Spielman, D A ^b   Morse, A S ^a  

^a Yale University   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC NETWORKS; NETWORK CONSENSUS ALGORITHMS; RANDOM WALKS;

COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; GRAPH THEORY; MATRIX ALGEBRA; RANDOM PROCESSES;

ALGORITHMS;

EID: 33847184599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2005.1582514     Document Type: Conference Paper

References (14)

1. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentice Hall, 1989.
2. N. A. Lynch. Distributed algorithms. Morgan Kaufmann Publishers, San Francisco, 1996.
3. A. Jababaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control, 48:988-1001, 2003.
4. L. Moreau. Leaderless coordination via bidirectional and unidirectional time-dependent communication. In Proc. of the 42th IEEE Conference on Decision and control, pages 3070-3075, 2003.
5. V. Gazi and K. M. Passino. Stability analysis of swarms. IEEE Transactions on Automatic Control, 48:692-697, 2003.
6. J. Lin, A. S. Morse, and B. D. O. Anderson. The multi-agent rendezvous problem. In Proc. of the 42th IEEE Conference on Decision and control, pages 1508-1513, 2003.
7. S. Martinez, J. Cortes, and F. Bullo. On robust rendezvous for mobile autonomous agents. In Proc. of the IFAC world congress, Prague, Czech Republic, 2005.
8. T. Vicsek, A. Czirók, E. Ben-Jacob, I. Cohen, and O. Shochet. Novel type of phase transition in a system of self-driven particles. Physical Review Letters, 75:1226-1229, 1995.
9. R. Olfati-Saber and R. M. Murray. Consensus problems in networks of agents with swiching topology and time-delays. IEEE Transactions on Automatic Control, 49:101-115, 2004.
10. M. Cao, A. S. Morse, and B. D. O. Anderson. Coordination of an asynchronous multi-agent system via averaging. In Proc. of the IFAC world congress, Prague, Czech Republic, 2005.
11. E. Seneta. Non-negative matrices anil Markov chains. Springer-Verlag, New York, 1981.
12. J. L. Doob. Stochastic Processes, chapter 5: Markov Processes, Discrete Parameter. John Wiley & Sons, Inc., New York, 1953.
13. J. Hajnal. Weak ergodicity in nonhotnogeneous markov chains. Proc. Camb. Phil. Soc., 54:233-246, 1958.
14. L. Lovasz. Random walks on graphs: a survey. In Cominatorics, Paul Erdös is eighty, pages 353-397, Budapest, 1996. Janos Bolyai Math. Soc.