Exploiting the Superposition Property of Wireless Communication For Average Consensus Problems in Multi-Agent Systems

TL;DR

This paper introduces a novel consensus algorithm for multi-agent systems over wireless channels that leverages the superposition property to achieve fast, resource-efficient, and robust convergence despite channel variations.

Contribution

It proposes a new consensus algorithm exploiting wireless superposition, enhancing convergence speed and robustness in multi-agent systems over MAC channels.

Findings

Algorithm achieves robust consensus despite channel variations

Convergence is faster and more resource-efficient

Consensus value depends on channel conditions

Abstract

This paper studies system stability and performance of multi-agent systems in the context of consensus problems over wireless multiple-access channels (MAC). We propose a consensus algorithm that exploits the broadcast property of the wireless channel. Therefore, the algorithm is expected to exhibit fast convergence and high efficiency in terms of the usage of scarce wireless resources. The designed algorithm shows robustness against variations in the channel and consensus is always reached. However the consensus value will be depending on these variations.