Journal article icon

Journal article

Finite time distributed averaging over gossip-constrained ring networks

Abstract:

We consider a multi-agent system where each agent has its own estimate of a given quantity and the goal is to reach consensus on the average. To this purpose, we propose a distributed consensus algorithm that guarantees convergence to the average in a finite number of communication rounds. The algorithm is tailored to ring networks subject to a gossip constraint. If the number of agents m is even, say m = 2n, then, the number of communication rounds needed is equal to n, which in this case is...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1109/TCNS.2017.2653418

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
Publisher:
IEEE Publisher's website
Journal:
IEEE Transactions on Control of Network Systems Journal website
Volume:
5
Issue:
3
Pages:
879-887
Publication date:
2017-01-16
Acceptance date:
2017-01-01
DOI:
ISSN:
2325-5870
Source identifiers:
667984
Keywords:
Pubs id:
pubs:667984
UUID:
uuid:6ed763ba-e9b1-4c2c-b812-c1aed36f3be0
Local pid:
pubs:667984
Deposit date:
2017-01-04

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP