Show simple item record

dc.contributor.authorManitara, N. E.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorManitara, N. E.en
dc.creatorHadjicostis, Christoforos N.en
dc.description.abstractWe consider how double linear iterative strategies for asymptotic average consensus can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate (in finite time) the execution of the iterations when approximate average consensus has been reached. The nodes are said to have reached approximate average consensus when each of them has a value that is close to the desirable average (in a way that we precisely define). We consider both undirected and directed graphs, and compare the number of iterations and transmissions required by the proposed protocols against previously proposed stopping protocols for approximate average consensus. © 2014 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en
dc.source2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014en
dc.source2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014en
dc.subjectComputer programmingen
dc.subjectDirected graphsen
dc.subjectNumber of iterationsen
dc.subjectFinite timeen
dc.subjectAverage consensusen
dc.subjectIterative strategyen
dc.subjectStopping criteriaen
dc.titleDistributed stopping for average consensus using double linear iterative strategiesen
dc.description.endingpage746Πολυτεχνική Σχολή / Faculty of EngineeringΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeConference Objecten
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record