Decentralized laplacian eigenvalues estimation and collaborative network topology identification

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 45, Issue 26, 2012, Pages 7-12

  Kibangou, Alain Y ^a   Commault, Christian ^a  

^a GIPSA LAB   (France)

Author keywords

Consensus; Laplacian eigenvalues; Network topology identification; Observability

Indexed keywords

GRAPH THEORY; LAPLACE TRANSFORMS; LEAST SQUARES APPROXIMATIONS; MATRIX ALGEBRA; NETWORKED CONTROL SYSTEMS; OBSERVABILITY;

COLLABORATIVE NETWORK; CONSENSUS; CONSTRUCTED MATRICES; EIGENVALUE DECOMPOSITION; EIGENVALUES AND EIGENVECTORS; LAPLACIAN EIGENVALUES; LEAST SQUARES METHODS; NETWORK TOPOLOGY;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84880988488     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20120914-2-US-4030.00039     Document Type: Conference Paper

References (16)

1. A.E. Brouwer, A.M. Cohen, and A. Neumaier. Distance-regular graphs. Springer, 1989.
2. J.D. Caroll and J.J. Chang. Analysis of individual differences in multidimensional scaling via an N-way generalization of "Eckart-Young" decomposition. Psychometrika, 35:283-319, 1970.
3. F.R.K. Chung. Spectral graph theory. American Mathematical Society, Providence, RI.
4. M. Franceschelli, A. Gasparri, A. Giua, and C. Seatzu. Decentralized Laplacian eigenvalues estimation for networked multi-agent systems. In Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, pages 2717-2722, Shanghai, P.R. China, 2009.
5. C. Godsil and G. Royle. Algebraic graph theory. Springer, 2001.
6. M. Ji and M. Egerstedt. Observability and estimation in distributed sensor networks. In Proc. IEEE Conf. Decision Control (CDC), pages 4221-4226, 2007.
7. A.Y. Kibangou. Finite-time average consensus based protocol for distributed estimation over awgn channels. In Proc. of the 50th IEEE Conference on Decision and Control (CDC), Orlando, Fl, USA, 2011a.
8. A.Y. Kibangou. Graph laplacian based matrix design for finite-time distributed average consensus. In Proc. of the American Conference on Control(ACC), Montréal, Canada, 2012b.
9. J.B. Kruskal. Three-way arrays: rank and uniqueness of trilin-ear decompositions, with application to arithmetic complexity and statistics. Linear Algebra Applicat., 18:95-138, 1977.
10. R. Merris. Laplacian matrices of graphs: a survey. Linear algebra and its applications, 197:143-176, 1994.
11. G. Parlangeli and G. Notarstefano. On the reachability and observability of path and cycle graphs. IEEE Trans. on Automatic Control, 57(3):743-748, march 2012.
12. T. Sahai, A. Speranzon, and A. Banaszuk. Wave equation based algorithm for distributed eigenvector computation. In 49th IEEE Conference on Decision and Control, pages 7308-7315, Atlanta, GA, USA, 2010.
13. N.D. Sidiropoulos and G.Z Dimic. Blind multiuser detection in WCDMA systems with large delay spread. IEEE Signal Processing Letters, 8(3):87-89, March 2001.
14. N.D. Sidiropoulos, R. Bro, and G.B. Giannakis. Parallel factor analysis in sensor array processing. IEEE Trans. on Signal Processing, 48(8):2377-2388, August 2000.
15. S. Sundaram and C. Hadjicostis. Distributed function calculation and consensus using linear iterative strategies. IEEE Journal on Selected Areas in Communications, 26(4):650-660, May 2008.
16. 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 2008 American Control Conference, 2008.