摘要：AbstractIn this work the load balancing problem is studied for decentralized stochastic network withunknown but boundednoise in measurements and varying productivities of agents. The load balancing problem is formulated as a consensus problem in a stochastic network. Consideration of Laplasian potential function corresponded to the network graph allows to introduce a new randomized local voting protocol with constant step-size which is based on simultaneous perturbation stochastic approximation algorithm. The conditions are formulated for the approximate consensus achievement which corresponds to achieving of a suboptimal level of agents' load. The new algorithm is illustrated by simulations.
关键词：KeywordsSimultaneous perturbation stochastic approximationrandomized algorithmsmultiagent systemsconsensus problem
