Abstract
We propose necessary and sufficient conditions for the synchronization of N identical single-input–single-output (SISO) systems, connected through a directed graph without imposing any assumption on the graph interconnection. We consider both the continuous-time and the discrete-time case, and we provide conditions that are equivalent to the uniform global exponential stability, with guaranteed convergence rate, of the closed and unbounded attractor that corresponds to the synchronization set.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call