English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper proposes a novel distributed event-triggered algorithmic solutionto the multi-agent average consensus problem for networks whose communicationtopology is described by weight-balanced, strongly connected digraphs. Theproposed event-triggered communication and control strategy does not rely onindividual agents having continuous or periodic access to information about thestate of their neighbors. In addition, it does not require the agents to have apriori 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 provablyconverge to the average of the initial agents' states exponentially fast. Wealso provide weaker conditions on connectivity under which convergence isguaranteed when the communication topology is switching. Simulations illustrateour results.

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