HAL : hal-00680344, version 1

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

2012 American Control Conference (ACC 2012), Montréal : Canada (2012)

Graph Laplacian based Matrix Design for Finite-Time Distributed Average Consensus

Alain Y. Kibangou 1, 2

(25/06/2012)

In this paper, we consider the problem of finding a linear iteration scheme that yields distributed average consensus in a finite number of steps D. By modeling interactions between the nodes in the network by means of a time-invariant undirected graph, the problem is solved by deriving a set of D Laplacian based consensus matrices. We show that the number of steps is given by the number of nonzero distinct eigenvalues of the graph Laplacian matrix. Moreover the inverse of these eigenvalues constitute the step-sizes of the involved Laplacian based consensus matrices. When communications are made through an additive white Gaussian noise channel, based on an ensemble averaging method, we show how average consensus can be asymptotically reached. Performance analysis of the suggested protocol is given along with comparisons with other methods in the literature.

1 :	NeCS (INRIA Grenoble Rhône-Alpes / Gipsa-lab)
	CNRS : UMR5216 – INRIA – Gipsa-lab – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG)
2 :	Grenoble Images Parole Signal Automatique (GIPSA-lab)
	CNRS : UMR5216 – Université Joseph Fourier - Grenoble I – Université Pierre-Mendès-France - Grenoble II – Université Stendhal - Grenoble III – Institut Polytechnique de Grenoble - Grenoble Institute of Technology

Équipe de recherche : NECS

Domaine

:

Informatique/Traitement du signal et de l'image Sciences de l'ingénieur/Traitement du signal et de l'image

hal-00680344, version 1

http://hal.archives-ouvertes.fr/hal-00680344

oai:hal.archives-ouvertes.fr:hal-00680344

Contributeur : Alain Kibangou <>

Soumis le : Lundi 19 Mars 2012, 11:34:44

Dernière modification le : Mercredi 21 Mars 2012, 11:51:27