Journal
NONLINEAR DYNAMICS
Volume 106, Issue 1, Pages 543-564Publisher
SPRINGER
DOI: 10.1007/s11071-021-06858-6
Keywords
Complex dynamic networks; Fixed time; Preassigned time; Quantized event-triggered control; Stochastic synchronization
Categories
Funding
- National Natural Science Foundation of China [61273004]
- Natural Science Foundation of Hebei Province [F2018203099]
Ask authors/readers for more resources
This paper explores fixed-time (FXT) and preassigned-time (PAT) stochastic synchronization of complex dynamic networks (CDN) based on the quantized event-triggered strategy. It introduces more relaxed criteria for FXT stability and designs effective control schemes to achieve PAT synchronization. The strategies can save resources and the settling time is independent of the parameters and initial values of CDN in stochastic synchronization.
This paper considers the fixed-time (FXT) and preassigned-time (PAT) stochastic synchronization of complex dynamic networks (CDN) based on the quantized event-triggered strategy. First, by applying some constructing comparison systems, more relaxed criteria are proposed for FXT stability and the estimated settling time is more accurate. Second, the FXT quantized event-triggered control schemes with sign or saturation function are designed, in which Zeno behavior is excluded and chattering phenomenon is reduced under the control strategies with saturation function. Besides, the quantized event-triggered control schemes can more effectively save resources of communication and computation. Third, several novel quantized event-triggered strategies are designed to achieve PAT synchronization, where the settling time can be preassigned according to realistic situation and is irrelevant with parameters and initial values of CDN. Finally, numerical example proves the rationality of the theories for the FXT and PAT stochastic synchronization of CDN.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available