Decentralized laplacian eigenvalues estimation for networked multi-agent systems

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2009, Pages 2717-2722

  Franceschelli, Mauro ^a   Gasparri, Andrea ^b   Giua, Alessandro ^a   Seatzu, Carla ^a  

^a UNIVERSITY OF CAGLIARI   (Italy)

^b ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FAST FOURIER TRANSFORMS; LAPLACE TRANSFORMS; SIGNAL PROCESSING; TOPOLOGY;

DECENTRALIZED ALGORITHMS; EIGENVALUE ESTIMATIONS; EIGENVALUES; LAPLACIAN EIGENVALUES; LAPLACIANS; LOCAL INTERACTIONS; NETWORK TOPOLOGY; NETWORKED MULTI-AGENT SYSTEMS;

MULTI AGENT SYSTEMS;

EID: 77950790304     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2009.5400723     Document Type: Conference Paper

References (20)

1. V. Blondel, J. Hendrickx, A. Olshevsky, and J. Tsitsiklis, "Convergence in multiagent coordination, consensus, and flocking," in CDC05, Seville, Spain, Dec. 2005, pp. 2996-3000.
2. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE TAC, vol.49, pp. 1520-1533, 2004.
3. R. Olfati-Saber, "Flocking for multi-agent dynamic system: Algorithms and theory," IEEE TAC, vol.51, pp. 401-420, 2006.
4. A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE TAC, vol.48, pp. 988-1001, 2003.
5. C. Godsil and G. Royle., "Algebraic graph theory," Springer, 2001.
6. J. Cortes, S. Martinez, and F. Bullo, "Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions," IEEE TAC, vol.51, no.8, pp. 1289-1298, 2006.
7. A. Muhammad and M. Egerstedt, "Connectivity graphs as models of local interactions," CDC04, vol.1, pp. 124-129, 2004.
8. X. Lin and S. Boyd, "Fast linear iterations for distributed averaging," Systems and Control Letters, vol.53, pp. 65-78, 2004.
9. P. Yang, R. A. Freeman, G. Gordon, K. Lynch, S. Srinivasa, and R. Sukthankar, "Decentralized estimation and control of graph connectivity in mobile sensor networks," in American Control Conference, June 2008.
10. B. Mohar, "The laplacian spectrum of graphs," in Graph Theory, Combinatorics, and Applications. Wiley, 1991, pp. 871-898.
11. R. Grone, R. Merris, and V. S. Sunder, "The laplacian spectrum of a graph," SIAM Journal on Matrix Analysis and Applications, vol.11, no.2, pp. 218-238, 1990.
12. R. Grone and R. Merris, "The laplacian spectrum of a graph ii," SIAM J. Discret. Math., vol.7, no.2, pp. 221-229, 1994.
13. J. V. D. Heuvel and S. Peji?, "Using laplacian eigenvalues and eigenvectors in the analysis of frequency assignment problems," Annals of Operations Research, vol.107, no.1, pp. 349-368, 2001.
14. J.-M. Guo, "The laplacian spectral radius of a graph under perturbation," Comput. Math. Appl., vol.54, no.5, pp. 709-720, 2007.
15. M. Ji and M. Egerstedt, "Observability and estimation in distributed sensor networks," CDC07, pp. 4221-4226, 2007.
16. S. Martini, M. Egerstedt, and A. Bicchi, "Controllability decompositions of networked systems through quotient graphs," CDC08, 2008.
17. J. C. Butcher, The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods. New York, NY, USA: Wiley-Interscience, 1987.
18. P. B. Hansen, "An evaluation of the message-passing interface," SIGPLAN Not., vol.33, no.3, pp. 65-72, 1998.
19. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE TAC, vol.49, no.9, pp. 1520-1533, 2004.
20. A. Oppenheim and R. Schafer, Discrete-Time Signal Processing. Prentice-Hall, 1989, pp. 447-448.