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 addresses the distributed consensus design problem for linearmulti-agent systems with directed communication graphs and externaldisturbances. Both the cases with strongly connected communication graphs andleader-follower graphs containing a directed spanning tree with the leader asthe root are discussed. Distributed adaptive consensus protocols based on therelative states of neighboring agents are designed, which can ensure theultimate boundedness of the consensus error and adaptive gains in the presenceof external disturbances. The upper bounds of the consensus error are furtherexplicitly given. Compared to the existing consensus protocols, the merit ofthe adaptive protocols proposed in this paper is that they can be computed andimplemented in a fully distributed fashion and meanwhile are robust withrespect to external disturbances.

Distributed Adaptive Consensus Protocols for Linear Multi-agent Systems with Directed Graphs and External Disturbances