pith. sign in

arxiv: 1609.06984 · v1 · pith:I7SJGAFVnew · submitted 2016-09-22 · 🧮 math.OC

Event-Triggered Communication and Control for Multi-Agent Average Consensus

classification 🧮 math.OC
keywords averageconsensusagentscommunicationmulti-agentcontrolevent-triggerednetwork
0
0 comments X
read the original 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 event-triggered strategies that autonomously decide when communication and control updates should occur so that the resulting asynchronous network executions still achieve average consensus.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.