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

In this paper, a containment problem is investigated for sampled-data agent networks subject to switching topologies and information delays. A nonlinear algorithm is introduced to ensure that the agents move into a convex area formed by some static leaders. The analytical approaches include the model transformation, the convexity analysis, and the Lyapunov approach. It proves that the containment problem can be achieved for sampled-data agent networks with bounded information delays and switching topologies if the union of the communication graphs has spanning trees. A numerical example is employed to demonstrate the validity of the theoretical results.

Containment Problem for Sampled-Data Agent Networks Subject to Information Delays and Switching Topologies