NONSTATIONARY CONSENSUS PROBLEM IN NETWORKS WITH IMPERFECT INFORMATION AND DELAY
In this paper stochastic approximation algorithm in networks with incomplete information about the current state of nodes and changing set of communication links are presented. We consider consensus problem in noisy model with switching topology. For the case when the step size of the algorithm does not tend to zero it is proposed to analyze closed loop system by the method of continuous models (ODE approach or Derevitskii-Fradkov-Ljung (DFL) scheme). The simulation results for workload balancing system are presented.