Papers
Topics
Authors
Recent
Search
2000 character limit reached

Robust cooperative synchronization of homogeneous agents with delays on directed communication graphs

Published 23 Nov 2019 in eess.SY and cs.SY | (1911.10359v1)

Abstract: This study deals with analysis and control of cooperative synchronization for identical agents interacting on a directed graph topology. The agents are considered to have general continuous linear time-invariant dynamics with homogeneous communication and/or control delays. An LMI approach based on a Lyapunov-Krasovskii functional is proposed, together with the synchronizing region concept, which decouples the single-agent dynamics from the detailed graph topology. Moreover, the conventional notion of synchronizing region is here extended by an LMI relaxation utilizing quasi-convex characteristic of the problem. This leads to less conservative results for the region of graph matrix eigenvalues in the complex domain, where the synchronization is guaranteed. The proposed method to calculate the allowable delay bound for synchronization is also less conservative as compared to the results from the literature. Furthermore, two designs for distributed state-feedback control are suggested. The precise delay value and the detailed graph topology need not be known for their application; it suffices only to know the upper bound on the delay and the approximate region where the Laplacian eigenvalues lie. Specific improvements over the results existing in the literature are demonstrated by a numerical example, which validates the proposed approaches.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.