Summary
This talk discusses the synchronization problem in time-varying networks of nonlinear QUAD systems. In particular, we attempt to derive a sufficient condition for synchronization without using information about the possible network structures in a case where at least one system is directly connected to all other systems in the network, even if not simultaneously. Defining one system that can connect with all other systems as the target system and focusing on the synchronization error between the system and other systems, we consider the synchronization problem as the stability problem of the origin of the synchronization error dynamics. Then, we derive a sufficient condition for synchronization in the form of linear matrix inequalities. The obtained condition uses information on only the possible degree of node corresponding to each system but does not require information about the entire graph structure. The validity of the obtained condition will be illustrated with a numerical example in this talk.
