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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We address the consensus problem, with a guarantee of connectivity maintenance, for multiagent systems of first- and second-order, communicating over a connected, undirected graph with proximity constraints. Our approach relies on a so-called barrier Lyapunov functions, which encode the distance constraints between pairs of agents. Beyond the consensus algorithms, our primary contribution is to provide  strict  barrier Lyapunov functions, i.e. positive definite and with negative definite derivative in the agreement subspace. Thus, uniform asymptotic stability of the consensus manifold and the maintenance of the connectivity are guaranteed. Furthermore, with the said barrier functions, we demonstrate the robustness of consensus protocols by establishing global input-to-state stability.

Stability and robustness of edge-agreement-based consensus protocols for undirected proximity graphs