Exploiting the Superposition Property of Wireless Communication For Average Consensus Problems in Multi-Agent Systems
For multi-agent systems requiring consensus over wireless networks, this work offers a resource-efficient algorithm with fast convergence, but the dependency of the consensus value on channel variations limits its applicability.
This paper proposes a consensus algorithm for multi-agent systems that leverages the broadcast property of wireless multiple-access channels, achieving fast convergence and efficient resource usage while maintaining robustness to channel variations, though the consensus value depends on these variations.
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.