Synchronous Distributed Consensus Algorithms for Extrema Finding with Imperfect Communication

摘要

Finding the extrema in a distributed fashion over multi-agent systems poses an important part of many real-life applications. In this paper, we analyze the robustness of synchronous distributed consensus algorithms for extrema finding to random communication breakdowns between entities forming multi-agent systems. We analyze the impact of communication breakdowns with a varying probability of the occurrence on the precision of the algorithms and the convergence rate expressed as the number of the iterations for the consensus.