DocumentCode
3536856
Title
Consensus with ternary messages
Author
Olshevsky, Alex
Author_Institution
Dept. of Ind. & Enterprise Syst. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
fYear
2013
fDate
10-13 Dec. 2013
Firstpage
6213
Lastpage
6217
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.
Keywords
convergence; graphs; network theory (graphs); polynomials; agents networks; connectivity condition; initial values; neighbor degree upper bound; polynomial time; protocol; real-valued average consensus; ternary alphabet; ternary messages consensus; time-varying undirected graphs; worst-case convergence time; Algorithm design and analysis; Convergence; Protocols; Sensors; Synchronization; Transient analysis; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control (CDC), 2013 IEEE 52nd Annual Conference on
Conference_Location
Firenze
ISSN
0743-1546
Print_ISBN
978-1-4673-5714-2
Type
conf
DOI
10.1109/CDC.2013.6760871
Filename
6760871
Link To Document