Distributed Maximum Consensus over Noisy Links

arXiv:2403.18509v1 Announce Type: cross
Abstract: We introduce a distributed algorithm, termed noise-robust distributed maximum consensus (RD-MC), for estimating the maximum value within a multi-agent network in the presence of noisy communication links. Our approach entails redefining the maximum consensus problem as a distributed optimization problem, allowing a solution using the alternating direction method of multipliers. Unlike existing algorithms that rely on multiple sets of noise-corrupted estimates, RD-MC employs a single set, enhancing both robustness and efficiency. To further mitigate the …

abstract agent algorithm arxiv communication consensus cs.dc cs.lg distributed eess.sp multi-agent network noise optimization robust solution type value