Distributed Design of Finite-time Average Consensus Protocols

Thi-Minh Dung Tran 1 Alain Y. Kibangou 1
1 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
Abstract : In this paper, we are interested in the finite-time average consensus problem for multi-agent systems or wireless sensor networks. This issue is formulated in a discrete-time framework by utilizing a linear iteration scheme, where each node repeatedly updates its value as a weighted linear combination of its own value and those of its neighbors. Unlike most of research in literature, this work deals with the foremost step, called configuration step, during which the consensus protocol is to be set up in each agent. Designing consensus protocols can be viewed as a matrix factorization problem. For connected undirected graphs, we propose a learning method for solving such matrix factorization problem in a distributed way.More precisely,we first show how solving this problemfor the particular case of strongly regular graphs. Then, a distributed gradient back-propagation algorithm is derived for the general case. The performance of the proposed algorithm is evaluated by means of simulation results.
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00863676
Contributor : Alain Kibangou <>
Submitted on : Thursday, September 19, 2013 - 1:23:58 PM
Last modification on : Tuesday, April 24, 2018 - 1:48:01 PM
Document(s) archivé(s) le : Friday, December 20, 2013 - 3:11:04 PM

File

Necpaper_final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00863676, version 1

Citation

Thi-Minh Dung Tran, Alain Y. Kibangou. Distributed Design of Finite-time Average Consensus Protocols. 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems (NecSys), Sep 2013, Koblenz, Germany. ⟨hal-00863676⟩

Share

Metrics

Record views

689

Files downloads

522