Distributed Maximum Consensus over Noisy Links
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910489985941504 |
|---|---|
| author | Lari, Ehsan Arablouei, Reza Venkategowda, Naveen K. D. Werner, Stefan |
| author_facet | Lari, Ehsan Arablouei, Reza Venkategowda, Naveen K. D. Werner, Stefan |
| contents | 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 effects of link noise and improve robustness, we apply moving averaging to the local estimates. Through extensive simulations, we demonstrate that RD-MC is significantly more robust to communication link noise compared to existing maximum-consensus algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_18509 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Distributed Maximum Consensus over Noisy Links Lari, Ehsan Arablouei, Reza Venkategowda, Naveen K. D. Werner, Stefan Distributed, Parallel, and Cluster Computing Machine Learning Signal Processing 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 effects of link noise and improve robustness, we apply moving averaging to the local estimates. Through extensive simulations, we demonstrate that RD-MC is significantly more robust to communication link noise compared to existing maximum-consensus algorithms. |
| title | Distributed Maximum Consensus over Noisy Links |
| topic | Distributed, Parallel, and Cluster Computing Machine Learning Signal Processing |
| url | https://arxiv.org/abs/2403.18509 |