A quantized event-triggered mass-splitting algorithm achieves finite-time consensus to the quantized average on any time-invariant strongly connected digraph.
Problems in decentralized decision making and com- putation,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
eess.SY 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
The algorithm converges to integer weights satisfying the balancing condition with probability one in finite iterations despite delays and drops, if circulation conditions hold.
citing papers explorer
-
Distributed Average Consensus under Quantized Communication via Event-Triggered Mass Splitting
A quantized event-triggered mass-splitting algorithm achieves finite-time consensus to the quantized average on any time-invariant strongly connected digraph.
-
Distributed Integer Balancing under Weight Constraints in the Presence of Transmission Delays and Packet Drops
The algorithm converges to integer weights satisfying the balancing condition with probability one in finite iterations despite delays and drops, if circulation conditions hold.