Distributed event-triggered communication for dynamic average consensus in networked systems

From MaRDI portal
Publication:894344

DOI10.1016/J.AUTOMATICA.2015.06.011zbMATH Open1326.93007arXiv1404.7407OpenAlexW1897977512MaRDI QIDQ894344FDOQ894344


Authors: Solmaz S. Kia, J. Cortés, Sonia Martínez Edit this on Wikidata


Publication date: 30 November 2015

Published in: Automatica (Search for Journal in Brave)

Abstract: This paper presents distributed algorithmic solutions that employ opportunistic inter-agent communication to achieve dynamic average consensus. In our solutions each agent is endowed with a local criterion that enables it to determine whether to broadcast its state to its neighbors. Our starting point is a continuous-time distributed coordination strategy that, under continuous-time communication, achieves practical asymptotic tracking of the dynamic average of the time-varying agents' reference inputs. Then, for this algorithm, depending on the directed or undirected nature of the time-varying interactions and under suitable connectivity conditions, we propose two different distributed event-triggered communication laws that prescribe agent communications at discrete time instants in an opportunistic fashion. In both cases, we establish positive lower bounds on the inter-event times of each agent and characterize their dependence on the algorithm design parameters. This analysis allows us to rule out the presence of Zeno behavior and characterize the asymptotic correctness of the resulting implementations. Several simulations illustrate the results.


Full work available at URL: https://arxiv.org/abs/1404.7407




Recommendations




Cites Work


Cited In (34)





This page was built for publication: Distributed event-triggered communication for dynamic average consensus in networked systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894344)