scholarly journals Fast fixed-time synchronization of T–S fuzzy complex networks

2021 ◽  
Vol 26 (4) ◽  
pp. 597-609
Author(s):  
Shuai Liu ◽  
Lingli Zhao ◽  
Wanli Zhang ◽  
Xinsong Yang ◽  
Fuad E. Alsaadi

In this paper, fast fixed-time (FDT) synchronization of T–S fuzzy (TSF) complex networks (CNs) is considered. The given control schemes can make the CNs synchronize with the given isolated system more fleetly than the most of existing results. By constructing comparison system and applying new analytical techniques, sufficient conditions are established to derive fast FDT synchronization speedily. In order to give some comparisons, FDT synchronization of the considered CNs is also presented by designing FDT fuzzy controller. Numerical examples are given to illustrate our new results.

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Bin Yang ◽  
Xin Wang ◽  
Yongju Zhang ◽  
Yuhua Xu ◽  
Wuneng Zhou

This paper is mainly concerned with how nonlinear coupled one impacts synchronization dynamics of a class of nonlinear coupled Markovian switching multiweighted complex networks (NCMSMWCNs). Firstly, sufficient conditions of finite-time synchronization for a class of NCMSMWCNs and a class of linear coupled Markovian switching multiweighted complex networks (LCMSMWCNs) are investigated. Secondly, based on the derived results, how nonlinear coupled one affects synchronization dynamics of the NCMSMWCNs is analyzed from synchronization control rule. Thirdly, in order to further explore how nonlinear coupled one affects synchronization dynamics of the NCMSMWCNs, synchronization dynamics relationship of the NCMSMWCNs and the LCMSMWCNs is built. Furthermore, this relationship can also show how linear coupled one affects synchronization dynamics of the LCMSMWCNs. At last, numerical examples are provided to demonstrate the effectiveness of the obtained theory.


2012 ◽  
Vol 2012 ◽  
pp. 1-17
Author(s):  
Yi Zhao ◽  
Jianwen Feng ◽  
Jingyi Wang

The cluster synchronization of linearly coupled complex networks with identical and nonidentical nodes is studied. Without assuming symmetry, we proved that these linearly coupled complex networks could achieve cluster synchronization under certain pinning control schemes. Sufficient conditions guaranteeing cluster synchronization for any initial values are derived by using Lyapunov function methods. Moreover, the adaptive feedback algorithms are proposed to adjust the control strength. Several numerical examples are given to illustrate our theoretical results.


2018 ◽  
Vol 32 (01) ◽  
pp. 1850002 ◽  
Author(s):  
Wanli Zhang ◽  
Chuandong Li ◽  
Xing He ◽  
Hongfei Li

This paper investigates the finite-time synchronization of complex networks (CNs) with non-identical nodes and impulsive disturbances. By utilizing stability theories, new 1-norm-based analytical techniques and suitable comparison, systems, several sufficient conditions are obtained to realize the synchronization goal in finite time. State feedback controllers with and without the sign function are designed. Results show that the controllers with sign function can reduce the conservativeness of control gains and the controllers without sign function can overcome the chattering phenomenon. Numerical simulations are offered to verify the effectiveness of the theoretical analysis.


2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Ahmadjan Muhammadhaji ◽  
Abdujelil Abdurahman ◽  
Haijun Jiang

In this paper, we investigated the finite-time synchronization (FTS) problem for a class of time-delayed complex networks with nonidentical nodes onto any uniformly smooth state. By employing the finite-time stability theorem and designing two types of novel controllers, we obtained some simple sufficient conditions for the FTS of addressed complex networks. Furthermore, we also analyzed the effects of control variables on synchronization performance. Finally, we showed the effectiveness and feasibility of our methods by giving two numerical examples.


Entropy ◽  
2019 ◽  
Vol 21 (8) ◽  
pp. 779
Author(s):  
Tao Chen ◽  
Shiguo Peng ◽  
Zhenhua Zhang

In this paper, we investigate the finite-time synchronization problem for a class of Markovian jumping complex networks (MJCNs) with non-identical nodes and impulsive effects. Sufficient conditions for the MJCNs are presented based on an M-matrix technique, Lyapunov function method, stochastic analysis technique, and suitable comparison systems to guarantee finite-time synchronization. At last, numerical examples are exploited to illustrate our theoretical results, and they testify the effectiveness of our results for complex dynamic systems.


2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
Yuhua Xu ◽  
Jincheng Zhang ◽  
Wuneng Zhou ◽  
Dongbing Tong

The objective of this paper is to discuss finite-time bounded synchronization for a class of the growing complex network with nondelayed and delayed coupling. In order to realize finite-time synchronization of complex networks, a new finite-time stable theory is proposed; effective criteria are developed to realize synchronization of the growing complex dynamical network in finite time. Moreover, the error of two growing networks is bounded simultaneously in the process of finite-time synchronization. Finally, some numerical examples are provided to verify the theoretical results established in this paper.


2021 ◽  
Author(s):  
Shiju Yang ◽  
Chuandong Li ◽  
Yu Li ◽  
Ting Yang ◽  
Bo Li

Abstract In this paper, the fixed-time bipartite synchronization problem for coupled delayed neural networks with signed graphs is discussed. Different from traditional neural networks, the interactions between nodes of delayed neural networks can be either collaborative or antagonistic. Furthermore, compared with the initial-condition based finite-time synchronization, the settling time is bounded by a constant within fixedtime regardless of the initial condition. It is worth noting that the fixed-time stable network for bipartite synchronization in this paper achieves more faster convergence than most existing publications. By applying constructing comparison system method, Lyapunov stability theory and inequality techniques, some sufficient criteria for fixed-time bipartite synchronization are obtained. Finally, two numerical examples are granted to display the performance of the obtained results.


2019 ◽  
Vol 29 ◽  
pp. 01006
Author(s):  
Camelia Pop ◽  
Ioana Iosif

The purpose of our paper is to study a class of left-invariant, drift-free optimal control problem on the Lie group ISO(3,1). The left-invariant, drift-free optimal control problems involves finding a trajectory-control pair on ISO(3,1), which minimize a cost function and satisfies the given dynamical constrains and boundary conditions in a fixed time. The problem is lifted to the cotangent bundle T*G using the optimal Hamiltonian on G*, where the maximum principle yields the optimal control. We use energy methods (Arnold’s method, in this case) to give sufficient conditions fornonlinear stability of the equilibrium states. Around this equilibrium states we might be able to find the periodical orbits using Moser's theorem, as future work. For the some unstable equilibrium states, a quadratic control is considered in order to stabilize the dynamics.


Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Yude Ji ◽  
Yunli Gong ◽  
Shan Su ◽  
Xiaoxue Bai

This article is related to the issue of fixed-time synchronization of different dimensional complex network systems with unknown parameters. Two suitable adaptive controllers and dynamic parameter estimations are proposed such that the complex network driving and response systems can be synchronized in the settling time. Based on fixed-time control theory and Lyapunov functional method, novel sufficient conditions are provided to guarantee the synchronization within the fixed times, and the settling times are explicitly evaluated, which are independent of the initial synchronization errors. Finally, a numerical example is given to illustrate the effectiveness of the proposed control algorithms.


Sign in / Sign up

Export Citation Format

Share Document