.png){kind=icon}
Return
Consensus Over Numerosity-Constrained Random Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2010.2092270.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We analyze the discrete-time consensus problem for a group of agents that communicate through a stochastic directed network with fixed out-degree. This network construction models the perceptual phenomenon of numerosity observed in animal groups exhibiting collective behavior. We find necessary and sufficient conditions for mean square consentability of the averaging protocol and we derive a closed form expression for the asymptotic convergence factor. Analytical results are illustrated through simulations.
Keywords:
Consensus
network analysis and control
random graphs
stability of linear systems
stochastic systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more