Distributed Design of Finite-time Average Consensus Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Distributed Design of Finite-time Average Consensus Protocols

Thi-Minh-Dung Tran
  • Fonction : Auteur
  • PersonId : 777514
  • IdRef : 188555870
Alain Kibangou

Résumé

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.
Fichier principal
Vignette du fichier
Necpaper_final.pdf (141.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00863676 , version 1 (19-09-2013)

Identifiants

Citer

Thi-Minh-Dung Tran, Alain Kibangou. Distributed Design of Finite-time Average Consensus Protocols. NecSys 2013 - 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, Sep 2013, Koblenz, Germany. ⟨10.3182/20130925-2-DE-4044.00057⟩. ⟨hal-00863676⟩
399 Consultations
677 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More