Premium
Synchronization in a network of identical continuous‐ or discrete‐time agents with unknown nonuniform constant input delay
Author(s) -
Zhang Meirong,
Saberi Ali,
Stoorvogel Anton A.
Publication year - 2018
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4115
Subject(s) - upper and lower bounds , constant (computer programming) , synchronization (alternating current) , control theory (sociology) , topology (electrical circuits) , mathematics , multi agent system , discrete time and continuous time , eigenvalues and eigenvectors , network topology , graph , computer science , state (computer science) , algorithm , discrete mathematics , mathematical analysis , combinatorics , control (management) , statistics , physics , quantum mechanics , artificial intelligence , programming language , operating system
Summary This paper studies the synchronization problem for multiagent systems with identical continuous‐ or discrete‐time agents with unknown nonuniform constant input delays. The agents are connected via full‐ or partial‐state coupling. The agents are assumed to be asymptotically null controllable, ie, all eigenvalues are in the closed left‐half complex plane for continuous‐time agents or in the closed unit disc for discrete‐time agents. We derive an upper bound for the input delay tolerance, which explicitly depends on the agent dynamics. Moreover, for any unknown delay satisfying this upper bound, a low‐gain–based protocol design methodology is proposed without relying on exact knowledge of the network topology such that synchronization is achieved among agents for any network graph in a given set.