Event-Triggered Communication and Control for Multi-Agent Average Consensus
Cameron Nowzari, Jorge Cortes, George J. Pappas

TL;DR
This paper explores event-triggered communication strategies for multi-agent systems to achieve average consensus efficiently, reducing unnecessary communication and energy use while maintaining correctness.
Contribution
It introduces provably correct distributed event-triggered algorithms that enable asynchronous consensus without continuous communication.
Findings
Event-triggered strategies reduce communication frequency.
Algorithms guarantee convergence to average consensus.
Approach improves energy efficiency in multi-agent networks.
Abstract
In this chapter we look at one of the canonical driving examples for multi-agent systems: average consensus. In this scenario, a group of agents seek to agree on the average of their initial states. Depending on the particular application, such states might correspond to sensor measurements, estimates about the position of a target, or some other data that needs to be fused. Due to its numerous applications in networked systems, many algorithmic solutions exist to the multi-agent average consensus problem; however, a majority of them rely on agents having continuous or periodic availability of information from other agents. Unfortunately, this assumption leads to inefficient implementations in terms of energy consumption, communication bandwidth, network congestion, and processor usage. Motivated by these observations, our main goal here is the design of provably correct distributed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Energy Efficient Wireless Sensor Networks · Distributed systems and fault tolerance
