On the consensus protocol of conspecific agents
Uloženo v:
| Název: | On the consensus protocol of conspecific agents |
|---|---|
| Autoři: | Nicole Abaid, Maurizio Porfiri, Irina Igel |
| Zdroj: | Linear Algebra and its Applications. 437:221-235 |
| Informace o vydavateli: | Elsevier BV, 2012. |
| Rok vydání: | 2012 |
| Témata: | Numerical Analysis, 0209 industrial biotechnology, Algebra and Number Theory, Convergence rate, Directed network, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, Random topology, Geometry and Topology, 02 engineering and technology, Consensus protocol, Stochastic stability |
| Popis: | We present a class of consensus protocols over groups of agents with stochastically switching, directed, and weighted communication topologies. In this protocol, an agent’s traits, that is, the cardinality of its neighbor set and the weight assigned to its neighbors in the updating process, are given by two jointly distributed random variables and the neighbors of an agent are selected with equal probability. We provide closed form results for the asymptotic convergence rate and for the steady state mean square deviation in the presence of additive noise. These results are specialized to consensus protocols based on Erdős–Rényi and numerosity-constrained networks. |
| Druh dokumentu: | Article |
| Jazyk: | English |
| ISSN: | 0024-3795 |
| DOI: | 10.1016/j.laa.2012.01.030 |
| Přístupová URL adresa: | https://www.sciencedirect.com/science/article/pii/S0024379512000948 https://core.ac.uk/display/82616577 https://nyuscholars.nyu.edu/en/publications/on-the-consensus-protocol-of-conspecific-agents https://www.sciencedirect.com/science/article/abs/pii/S0024379512000948 |
| Rights: | Elsevier Non-Commercial |
| Přístupové číslo: | edsair.doi.dedup.....5a4af5d6aef7b2c53133af7d0246561c |
| Databáze: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | We present a class of consensus protocols over groups of agents with stochastically switching, directed, and weighted communication topologies. In this protocol, an agent’s traits, that is, the cardinality of its neighbor set and the weight assigned to its neighbors in the updating process, are given by two jointly distributed random variables and the neighbors of an agent are selected with equal probability. We provide closed form results for the asymptotic convergence rate and for the steady state mean square deviation in the presence of additive noise. These results are specialized to consensus protocols based on Erdős–Rényi and numerosity-constrained networks. |
|---|---|
| ISSN: | 00243795 |
| DOI: | 10.1016/j.laa.2012.01.030 |