# Distributed event-triggered coordination for average consensus on weight-balanced digraphs

arXiv: https://arxiv.org/abs/1407.7921 · HTML: https://mlsanity.com/paper/1407.7921/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Jul 2014.

## Built on by (most cited first, 1 of 1)

- [Logarithmically Quantized Distributed Optimization over Dynamic Multi-Agent Networks](https://mlsanity.com/paper/2410.20345/) (2024)

## Abstract (arXiv)

This paper proposes a novel distributed event-triggered algorithmic solution to the multi-agent average consensus problem for networks whose communication topology is described by weight-balanced, strongly connected digraphs. The proposed event-triggered communication and control strategy does not rely on individual agents having continuous or periodic access to information about the state of their neighbors. In addition, it does not require the agents to have a priori knowledge of any global parameter. We show that, under the proposed law, events cannot be triggered an infinite number of times in any finite period (i.e., no Zeno behavior), and that the resulting network executions provably converge to the average of the initial agents' states exponentially fast. We also provide weaker conditions on connectivity under which convergence is guaranteed when the communication topology is switching. Simulations illustrate our results.