Consensus for Networks with Unknown but Bounded Disturbances
By D. Bauso, L. Giarré, R. Pesenti. 2009
85 citations recorded by the source corpus.
We consider stationary consensus protocols for networks of dynamic agents. The measure of the neighbors' states is affected by unknown but bounded disturbances. Here the main contribution is the formulation and solution of what we call the $\epsilon$-consensus problem, where the states are required to converge in a target set of radius $\epsilon$ asymptotically or in finite time. We introduce as a solution a dead-zone policy that we denote as the lazy rule.
Subfields: Computer Networks and Communications, Molecular Biology
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Molecular Biology
Citations in the corpus
- Finite-Time Consensus for Switching Network Topologies with Disturbances (2013, background): “In [17] the authors suggest a class of non-linear continuous protocols that achieve the so-called ‘‘ε-consensus’’, namely an approximate agreement conditionwhere all agents converge towards a set, in spite of the presence of additive disturbances.”
- Analysis of consensus protocols with bounded measurement errors (2011, background): “A different description of the uncertainty is adopted in [13] and [14], where the measurement noise is only assumed to be bounded.”