Event-Triggered Quantized Average Consensus via Ratios of Accumulated Values

We study the distributed average consensus problem in multiagent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 66; číslo 3; s. 1293 - 1300
Hlavní autoři: Rikos, Apostolos I., Hadjicostis, Christoforos N.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.03.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Convergence
Digraphs
Distributed algorithms
Energy consumption
event-triggered distributed algorithms
Graph theory
Information flow
Microprocessors
Multiagent systems
Network topology
Probabilistic logic
Protocols
quantization
Quantization (signal)
quantized average consensus
Topology
ISSN:0018-9286, 1558-2523, 1558-2523
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study the distributed average consensus problem in multiagent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this article, we present and analyze a novel distributed averaging algorithm that operates exclusively on quantized values (specifically, the information stored, processed, and exchanged between neighboring agents is subject to deterministic uniform quantization) and relies on event-driven updates (e.g., to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage). We characterize the properties of the proposed distributed averaging protocol on quantized values and show that its execution, on any time-invariant and strongly connected digraph, will allow all agents to reach, in finite time, a common consensus value (represented as the ratio of two quantized values) that is equal to the exact average.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
1558-2523
DOI:10.1109/TAC.2020.2989764