pith. sign in

arxiv: 1809.06910 · v1 · pith:FRU432GDnew · submitted 2018-09-18 · 🧮 math.OC

Distributed Robust Dynamic Average Consensus with Dynamic Event-Triggered Communication

classification 🧮 math.OC
keywords dynamicaveragealgorithmcommunicationconsensusevent-triggeredrobustagents
0
0 comments X
read the original abstract

This paper presents the formulation and analysis of a fully distributed dynamic event-triggered communication based robust dynamic average consensus algorithm. Dynamic average consensus problem involves a networked set of agents estimating the time-varying average of dynamic reference signals locally available to individual agents. We propose an asymptotically stable solution to the dynamic average consensus problem that is robust to network disruptions. Since this robust algorithm requires continuous communication among agents, we introduce a novel dynamic event-triggered communication scheme to reduce the overall inter-agent communications. It is shown that the event-triggered algorithm is asymptotically stable and free of Zeno behavior. Numerical simulations are provided to illustrate the effectiveness of the proposed algorithm.

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.