Consensus with ternary messages

Alexander Olshevsky

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We provide a protocol for real-valued average consensus by networks of agents which exchange only a single message from the ternary alphabet {-1; 0; 1} between neighbors at each step. Our protocol works on time-varying undirected graphs subject to a connectivity condition, has a worst-case convergence time which is polynomial in the number of agents and the initial values, and requires no global knowledge about the graph topologies on the part of each node to implement except for knowing an upper bound on the degrees of its neighbors.

Original languageEnglish (US)
Title of host publication2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages6213-6217
Number of pages5
ISBN (Print)9781467357173
DOIs
StatePublished - Jan 1 2013
Event52nd IEEE Conference on Decision and Control, CDC 2013 - Florence, Italy
Duration: Dec 10 2013Dec 13 2013

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other52nd IEEE Conference on Decision and Control, CDC 2013
CountryItaly
CityFlorence
Period12/10/1312/13/13

    Fingerprint

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Olshevsky, A. (2013). Consensus with ternary messages. In 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013 (pp. 6213-6217). [6760871] (Proceedings of the IEEE Conference on Decision and Control). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CDC.2013.6760871