2019 年 32 巻 2 号 p. 55-62
Multi-agent systems over noisy networks with multi-input/multi-output linear symmetric agents are considered. The information is assumed to be sent from an agent to its neighbors via multi-channels. The communication graph of each channel is allowed to be time varying and a different topology. The entire network which is defined by the union of all graph is assumed to be connected in an undirected graph case or weakly connected and balanced in a directed one. The aim of this study is to establish a stopping rule of a stochastic averaging consensus under a noisy and time-varying network. The convergence analysis reveals an explicit relation between the number of iterations and the closeness of the consensus. The results are illustrated through numerical examples.