Abstract
In this paper, synchronization of continuous dynamical networks with discrete-time communications is studied. Though the dynamical behavior of each node is continuous-time, the communications between every two different nodes are discrete-time, i.e., they are active only at some discrete time instants. Moreover, the communication intervals between every two communication instants can be uncertain and variable. By choosing a piecewise Lyapunov-Krasovskii functional to govern the characteristics of the discrete communication instants and by utilizing a convex combination technique, a synchronization criterion is derived in terms of linear matrix inequalities with an upper bound for the communication intervals obtained. The results extend and improve upon earlier work. Simulation results show the effectiveness of the proposed communication scheme. Some relationships between the allowable upper bound of communication intervals and the coupling strength of the network are illustrated through simulations on a fully connected network, a star-like network, and a nearest neighbor network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.