Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts.

In the presence of probabilistic communication networks between agents, the convergence analysis of max-consensus algorithm (MCA) is addressed in this paper. It is considered that at each iteration of MCA, all agents share their measurements with adjacent agents via local communication networks which is applicable in many multi-agent systems (MASs). It is assumed that the communication networks have Bernoulli dropouts, i.e. the information exchanged between agents may be lost with Bernoulli distribution. In the proposed method, the information topology of MAS is modelled as a dynamic graph with the Bernoulli adjacency matrix. It is proved that in the presence of Bernoulli dropouts and under non-restrictive assumptions concerning the MAS features and communication topology, the MCA converges with a probability one in the finite time. Furthermore, the upper bounds are provided by means of deterministic and probabilistic expressions for the expectation and dispersion of convergence time, respectively. It is shown that the proposed upper bounds are asymptotic, i.e. there are specific conditions of MAS in which the convergence time of MCA tends to the proposed upper bounds. The convergence accuracy of MCA is discussed in terms of probabilistic equations. The validity of the proposed theorems is illustrated by means of simulation results. [ABSTRACT FROM AUTHOR]