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...