Summary

Proceedings of the 2012 International Symposium on Nonlinear Theory and its Applications

2012

Session Number:A1L-C

Session:

Number:45

A New Continuous-Time Algorithm for Calculating Algebraic Connectivity of Multi-Agent Networks

Tatsuya Fukami,  Norikazu Takahashi,  

pp.45-48

Publication Date:

Online ISSN:2188-5079

DOI:10.15248/proc.1.45

PDF download (296.5KB)

How to maintain the connectivity is an important issue in mobile agent networks. In this paper, we propose a new continuous-time algorithm for calculating the algebraic connectivity of the graph representing the interaction between agents. This is simpler than the conventional algorithm in the sense that less multiplications are needed. We study the dynamical behavior of the proposed algorithm and prove that it can find the algebraic connectivity of the graph for almost all initial conditions.

[1] R. Olfati-Saber, J. A. Fax and R. M. Murray, “Consensus and cooperation in networked multi-agent systems,” Proc. IEEE, vol.95, no.1, pp.215-233, 2007.

[2] M. Fiedler, “Algebraic connectivity of graphs,” Czechoslovak Mathematical Journal, vol.23, no.98, pp.298-305, 1973.

[3] P. Yang, R. A. Freeman, G. J. Gordon, K. M. Lynch, S. S. Srinivasa and R. sukthankar, “Decentralized estimation and control of graph connectivity for mobile sensor networks,” Automatica, vol.46, pp.390-396, 2010.

[4] R. A. Freeman, P. Yang and K. M. Lynch, “Stability and convergence properties of dynamic consensus estimators,” Proc. 45th IEEE Conference on Decision and Control, pp.338-343, December 2006.

[5] H. K. Khalil, Nonlinear Systems, Second Edition, Prentice-Hall, 1996.