Graph Laplacian based Matrix Design for Finite-Time Distributed Average Consensus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

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

Alain Kibangou

Abstract

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.
Fichier principal
Vignette du fichier
acc_2012.pdf (194.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00680344 , version 1 (19-03-2012)

Identifiers

  • HAL Id : hal-00680344 , version 1

Cite

Alain Kibangou. Graph Laplacian based Matrix Design for Finite-Time Distributed Average Consensus. ACC 2012 - American Control Conference, Jun 2012, Montréal, Canada. pp.n/a. ⟨hal-00680344⟩
376 View
1512 Download

Share

Gmail Facebook X LinkedIn More