Randomized DDA average-consensus conjecture under condition (C)
Randomized DDA average-consensus conjecture under condition (C)
Let be a communication sequence, and let the condition be defined by condition (C) of the cited theorem. Upon reception of each signal, choose the normal consensus-estimate update with probability and the alternative update with probability . Randomized DDA conjecture. Under these assumptions, average-consensus holds at time almost surely for every communication sequence satisfying the condition. The conjecture proposes that random switching between the two global updates restores finite-time average consensus under the broader condition (C); the supplied text gives no resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Kevin Topley and Vikram Krishnamurthy, “Average-Consensus Algorithms in a Deterministic Framework”, arXiv:1106.4346 (2011).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.