A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Multi-agent systems over noisy networks with linear symmetric agents are considered. The topology of the network which defines the availability of communication among the agents is assumed to be a directed, weakly connected and balanced graph or an undirected and connected one. Furthermore, the communication graph is allowed to be time varying. The aim of this study is to establish a stochastic averaging consensus algorithm under a noisy environment for each time-varying network. Thedoi:10.5687/iscie.31.28 fatcat:wvg5x4g5d5ayjjmd3ewzqmstuq