OCDCSYSYPRMar 7, 2017

Scaling laws for consensus protocols subject to noise

arXiv:1508.0003628 citationsh-index: 67
Originality Incremental advance
AI Analysis

Provides a theoretical framework for analyzing noise robustness in consensus protocols, relevant to distributed control and multi-agent systems.

The paper derives an exact expression for steady-state disagreement in consensus protocols with additive noise, linking it to hitting times and the Kemeny constant, and applies this to formation control.

We study the performance of discrete-time consensus protocols in the presence of additive noise. When the consensus dynamic corresponds to a reversible Markov chain, we give an exact expression for a weighted version of steady-state disagreement in terms of the stationary distribution and hitting times in an underlying graph. We then show how this result can be used to characterize the noise robustness of a class of protocols for formation control in terms of the Kemeny constant of an underlying graph.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes