Consensus on the average in arbitrary directed network topologies with time-delays

ZAREH ESHGHDOUST, MEHRAN;SEATZU, CARLA;FRANCESCHELLI, MAURO
2013-01-01

Abstract

In this preliminary paper we study the stability property of a consensus on the average algorithm in arbitrary directed graphs with respect to communication/sensing time-delays. The proposed algorithm adds a storage variable to the agents' states so that the information about the average of the states is preserved despite the algorithm iterations are performed in an arbitrary strongly connected directed graph. We prove that for any network topology and choice of design parameters the consensus on the average algorithm is stable for sufficiently small delays. We provide simulations and numerical results to estimate the maximum delay allowed by an arbitrary unbalanced directed network topology.
2013
4th IFAC Workshop on Distributed Estimation and Control in Networked Systems (NecSys)
978-390282355-7
342
347
6
http://www.ifac-papersonline.net/Detailed/62407.html
4th IFAC Workshop on Distributed Estimation and Control in Networked Systems (2013)
contributo
Esperti anonimi
25-26 September 2013
Koblenz, Germany
internazionale
4 Contributo in Atti di Convegno (Proceeding)::4.1 Contributo in Atti di convegno
ZAREH ESHGHDOUST, Mehran; Seatzu, Carla; Franceschelli, Mauro
273
3
4.1 Contributo in Atti di convegno
none
info:eu-repo/semantics/conferenceObject
Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie