# Parameters Identification and Synchronization of Chaotic Delayed Systems Containing Uncertainties and Time-Varying Delay

Authors: Zhongkui Sun; Xiaoli Yang
Journal: Mathematical Problems in Engineering
 (2010)

---

## Abstract

Time delays are ubiquitous in real world and are often sources of complex behaviors of dynamical systems. This paper addresses the problem of parameters identification and synchronization of uncertain chaotic delayed systems subject to time-varying delay. Firstly, a novel and systematic adaptive scheme of synchronization is proposed for delayed dynamical systems containing uncertainties based on Razumikhin condition and extended invariance principle for functional differential equations. Then, the proposed adaptive scheme is used to estimate the unknown parameters of nonlinear delayed systems from time series, and a sufficient condition is given by virtue of this scheme. The delayed system under consideration is a very generic one that includes almost all well-known delayed systems (neural network, complex networks, etc.). Two classical examples are used to demonstrate the effectiveness of the proposed adaptive scheme.


---

## Body

## 1. Introduction

In recent years, delayed dynamical systems (so called, DDEs) have attracted lots of attention in the field of nonlinear dynamics, and the dynamical properties of DDEs have been extensively investigated. Strictly speaking, time delays are ubiquitous in real world due to the finite switching speed of amplifiers, finite signal propagation time in biological networks, finite chemical reaction times, memory effects, and so forth. Therefore, DDEs are used to model dynamical systems broadly in scientific and engineering areas, for instance, in population dynamics, biology, economy, neural networks, complex networks, and so on. It has been found that the presence of time delay(s) is often a source of complicated behaviors, for example, limit-cycle, loss of stability, bifurcation, and chaos [1–7]. Especially, one-dimensional delayed dynamical systems can generate high-dimensional chaos [8, 9]. Motivated by the study of chaotic phenomena, an increasing interest has been devoted to the study of chaos synchronization in delayed dynamical systems, for example, anticipating synchronization [10–15], generalized synchronization [16], phase synchronization [17], and complete synchronization [18–21]. Many applications of chaos synchronization in delayed dynamical systems have been found in many different areas including in secure communication, information science, optic systems, neural networks, and so forth. However, in most of the previous works, the considered systems are often specific, also the controllers are sometimes of limitation or too complicated to implement in nature; particularly, the controllers cannot be applied to delayed dynamical systems with time-varying time delay.Very recently, many research of chaos synchronization has been devoted to neural networks or complex networks with time delay(s) and some theoretical and numerical results are obtained [22–27]. In [22], the authors considered the synchronization of two kinds of dynamical complex networks utilizing special matrix measure with constant linear coupling delays in the nodes of the whole networks. In [23], mathematical analysis is presented on the synchronization phenomena of linearly coupled systems described by ordinary differential equations with a single linear coupling delay. Reference [24] presented several delay-dependent conditions for continuous- and discrete-time complex dynamical network model with a single linear coupling delay using linear matrix inequalities. In [25], a strategy for synchronization of complex dynamical networks with a single linear coupling time-delay is proposed based on linear state feedback controllers. In [26], the authors studied the synchronization of neural networks subject to time-varying delays and sector nonlinearity based on the drive-response concept, where a complicated controller was designed to achieve synchronization. Cao et al. considered the synchronization of coupled identical neural networks with time-varying delay using a simple adaptive feedback scheme based on the invariant principle of functional differential equations, and a good result was obtained in [27]. But, to design the adaptive scheme, a strict constraint is added to the time-varying delay, and the state equation under consideration must be of specific form. However, there have been no previous reports of adaptive chaos synchronization of delayed dynamical systems with uncertain parameters and nonlinear time-varying delay.An interesting application of chaos synchronization is to estimate parameters of a chaotic system from time series when partial information about the system is available [28–31]. In contrast to the large number of research papers on the parameter identification of chaotic systems without delay, only limited attention has been given to the parameter identification of delayed dynamical systems [32–38]. Among these works, most of them are limited to linear delayed system with constant delay. Actually, how to identify the unknown parameters from time series is still an open problem.Motivated by the above discussion, in the present paper, we study parameters identification and synchronization of uncertain chaotic delayed systems with time-varying delay based on the famous Razumikhin condition and invariance principle of functional differential equations in the framework of Krasovskii-Lyapunov theory [39]. The system under consideration is a very general one that includes almost all well-known delayed systems, for example, Ikeda system [40], Mackey-Glass system [1], delayed Duffing system [7], Hopfield neural network [27], BAM neural network [41], cellular neural network [42], complex networks [22–24], and so on. The adaptive feedback controller utilized here is very simple, which is constructed by combination of adaptive scheme and linear feedback with the updated feedback strength.This paper is organized as follows: problem statement and some preliminaries knowledge, including one lemma and two assumptions, are given in Section2. Our main theoretical result is described in Section 3. In Section 4, two numerical examples, the delayed Rössler model [43] and delayed Hopfield neural network system [27], are employed to illustrate the effectiveness of the proposed adaptive scheme. Finally, conclusions and remarks are drawn in Section 5.


## 2. Problem Statement and Preliminaries

In this paper, we consider the general continuous-time delayed dynamical system with time-varying delay described by the following delayed differential equation:(2.1)ẋ(t)=Ax(t)+Bx(t-τ)+Cf(x(t))+Dg(x(t-τ)),
where x(t)=(x1(t),x2(t),…,xn(t))T∈Rn is the state vector, A=(aij)n×n  and B=(bij)n×n are unknown constant matrices representing the linear parts of the system, C=(cij)n×n and D=(dij)n×n are unknown constant matrices representing the nonlinear parts of the system, τ=τ(t)≥0 is the time-varying delay, f(x(t))=[f1(x(t)),f2(x(t)),…,fn(x(t))]T denotes the nonlinear function without delay, and g(x(t))=[g1(x(t-τ)),g2(x(t-τ)),…,gn(x(t-τ))]T denotes the nonlinear function with delay. Without loss of generality, we assume that the structure of the nonlinear dynamical system (2.1) is known and, furthermore, time series for all variables are available as the output of system (2.1). Let Ω∈Rn be a chaotic bounded set.For the nonlinear vector functionsf(x) and g(x) and time-varying delay τ(t), we have the following two assumptions.Assumption.
For anyx=(x1,x2,…,xn)T and y=(y1,y2,…,yn)T∈Ω, there exist constants li1>0 and li2>0 (n=1,2,…,n) such that
(2.2)|fi(x)-fi(y)|≤li1max1≤j≤n{|xj-yj|},i=1,2,…,n,|gi(x)-gi(y)|≤li2max1≤j≤n{|xj-yj|},i=1,2,…,n.
The above condition is the so-called uniform Lipschitz condition;li1>0 and li2>0 (n=1,2,…,n) refer to the uniform Lipschitz constants.Assumption.
τ=τ(t)≥0 is the smooth function of time t, and its derivative is bounded, that is, there exists some positive number M>0 such that |τ̇(t)|≤M.
Clearly, this assumption is certainly ensured if the delayτ(t) is constant.Remark 2.3.
Assumption2.1 is a very loose constraint added to nonlinear vector functions f(x) and g(x). One can easily check that a wide variety of delayed dynamical systems satisfy the above condition; particularly, condition (2.2) will hold as long as the partial differential ∂fi/∂xjand ∂gi/∂xj(i,j=1,2,…,n) are bounded in Ω∈Rn. Therefore, the class of systems in the form of (2.1) includes almost all well-known delayed systems, for example, Ikeda system [40], Mackey and Glass system [1], delayed Duffing system [7], Hopfield neural network [27], BAM neural network [41], cellular neural network [42], complex networks [22–24], and so forth.Remark 2.4.
Assumption2.2 is a limitation of time-varying delay τ(t). Comparing to that of time-varying delay τ(t) in  [27], this limitation is very loose.We refer to system (2.1) as the drive system. An auxiliary system of variables y(t)=(y1(t),y2(t),…,yn(t))T∈Rn is introduced as the response system, whose evolution equations have identical form to system (2.1)
(2.3)ẏ(t)=A̅(t)y(t)+B̅(t)y(t-τ(t))+C̅(t)f(y(t))+D̅(t)g(y(t-τ))+u(t),
where A̅=(a̅ij)n×n, B̅=(b̅ij)n×n, C̅=(c̅ij)n×n, and D̅=(d̅ij)n×n are the estimates of the unknown parameters matrices A=(aij)n×n, B=(bij)n×n, C=(cij)n×n, and D=(dij)n×n, respectively; u(t) is a simple adaptive-feedback controller, u(t)=K(y(t)-x(t)) with K updated adaptively according to some updated law.Defining the synchronization error ase(t)=y(t)-x(t) and subtracting (2.1) from (2.3) yield the error system as follows:
(2.4)ė(t)=A̅(t)y(t)+B̅(t)y(t-τ)+C̅(t)f(y(t))+D̅(t)g(y(t-τ))+Ke(t)-Ay(t)-By(t-τ)-Cf(y(t))-Dg(y(t-τ)).
Therefore, the task of this paper is to design a suitable adaptive scheme
(2.5)A̅̇=A̅(x,y,A̅,B̅,C̅,D̅,t),B̅̇=B̅(x,y,A̅,B̅,C̅,D̅,t),C̅̇=C̅(x,y,A̅,B̅,C̅,D̅,t),D̅̇=D̅(x,y,A̅,B̅,C̅,D̅,t),K̇=K̅(x,y,A̅,B̅,C̅,D̅,t),
such that y(t) can track x(t), that is, ||e(t)||→0 as t→∞.Furthermore, we introduce a lemma [44], which is needed in the proof of the main results.Lemma 2.5.
For any vectorsx1,x2∈Rn and any positive definite matrix Q∈Rn×n, the following inequality holds:
(2.6)2x1Tx2≤x1TQx1+x2TQ-1x2.


## 3. Adaptive Synchronization Scheme

In this section, we investigate the adaptive synchronization between the drive system (2.1) and the response system (2.3) in the framework of Krasovskii-Lyapunov theory [39]. The main result is described in the following theorem.Theorem 3.1.
Under Assumption2.1 and Assumption 2.2, system (2.3) can synchronize with system (2.1) if one designs A̅, B̅, C̅, and D̅ as
(3.1)a̅̇ij(t)=-αijei(t)yj(t),b̅̇ij(t)=-βijei(t)yj(t-τ(t)),c̅̇ij(t)=-pijei(t)fj(y(t)),d̅̇ij(t)=-qijei(t)gj(y(t-τ(t))),
with the coupling strength K=diag(k1,k2,…,kn)T updated by
(3.2)k̇i=-γiei2,
where αij,βij,pij,qij, and γi (i,j=1,2,…,n) are arbitrary positive constants.Proof.
Construct a Lyapunov function of the form(3.3)V(e(t))=12eT(t)e(t)+12∫t-τ(t)teT(s)e(s)ds+12∫t-τ(t)tGT(e(s))G(e(s))ds+12∑i=1n1γi(ki+l)2+12∑i=1n∑j=1n1αij(a̅ij-aij)2+12∑i=1n∑j=1n1βij(b̅ij-bij)2+12∑i=1n∑j=1n1pij(c̅ij-cij)2+12∑i=1n∑j=1n1qij(d̅ij-dij)2,
where G(e)=g(y)-g(x)=g(e+x)-g(x).
By differentiating the functionV with respect to time along the trajectory of (2.4), one can obtain
(3.4)V̇(e(t))=eT(t)ė(t)+12eT(t)e(t)-12(1-τ̇(t))eT(t-τ(t))e(t-τ(t))+12GT(e(t))G(e(t))-12(1-τ̇(t))GT(e(t-τ(t)))G(e(t-τ(t)))-∑i=1n∑j=1n(a̅ij-aij)ei(t)yj(t)-∑i=1n∑j=1n(b̅ij-bij)ei(t)yj(t-τ(t))-∑i=1n∑j=1n(c̅ij-cij)ei(t)fj(y(t))-∑i=1n∑j=1n(d̅ij-dij)ei(t)gj(y(t-τ))-∑i=1n(ki+l)ei2=eT(t)A̅(t)y(t)+eT(t)B̅(t)y(t-τ(t))+eT(t)C̅(t)f(y(t))+eT(t)D̅(t)g(y(t-τ(t)))-eT(t)Ax(t)+eT(t)Bx(t-τ(t))+eT(t)Cf(x(t))+eT(t)Dg(x(t-τ(t)))+eT(t)u(t)-eT(t)A̅(t)y(t)+eT(t)Ay(t)-eT(t)B̅(t)y(t-τ(t))+eT(t)By(t-τ(t))-eT(t)C̅(t)f(y(t))+eT(t)Cf(y(t))-eT(t)D̅(t)g(y(t-τ(t)))+eT(t)Dg(y(t-τ(t)))-eT(t)Ke(t)-eT(t)Le(t)+12eT(t)e(t)-12(1-τ̇(t))eT(t-τ(t))e(t-τ(t))+12GT(e(t))G(e(t))-12(1-τ̇(t))GT(e(t-τ(t)))G(e(t-τ(t)))=eT(t)Ae(t)+eT(t)Be(t-τ(t))+eT(t)CF(e)+e(t)DG(e(t-τ(t)))-eT(t)Le(t)+12eT(t)e(t)-12(1-τ̇(t))eT(t-τ(t))e(t-τ(t))+12GT(e(t))G(e(t))-12(1-τ̇(t))GT(e(t-τ(t)))G(e(t-τ(t))),
where F(e)=f(y)-f(x)=f(e+x)-f(x).
Recalling Assumption2.1, we have the following two inequalities:
(3.5)FT(e(t))F(e(t))=∑i=1n(fi(y(t))-fi(y(t)))2≤nh1eT(t)e(t),GT(e(t))G(e(t))=∑i=1n(gi(x(t))-gi(y(t)))2≤nh2eT(t)e(t),
here h1=max{l11,l21,…,ln1} and h2=max{l12,l22,…,ln2}. Substituting inequalities (3.5) into the right side of the above equality and applying Lemma 2.5, one can obtain
(3.6)V̇(e(t))≤eT(t)[A+12BBT+12CCT+12DDT+(h1+h2+12-L)I]e(t)+M2eT(t-τ(t))e(t-τ(t))+Mh22eT(t-τ(t))e(t-τ(t)).
Applying the classical Razumikhin condition to inequality (3.6) and choosing
(3.7)L=λmax[A+12BBT+12CCT+12DDT]+h1+(M+1)h2+m+12+1,
one can obtain
(3.8)V̇(e(t))≤-eT(t)e(t).
Clearly, V̇(e(t))=0 if and only if e(t)=0. Therefore, E={e=0,A̅=A0,B̅=B0,C̅=C0,D̅=D0,K=K0∈Rn} is the largest invariant set containing in {(e(t),A̅,B̅,C̅,D̅,K)∣V̇=0}. According to the well-known invariant principle of functional differential equations [39], the trajectory of the argument system converges asymptotically to the largest invariant set E starting from any initial value as time tends to infinity, where the converged parameters A0,B0,C0,D0,andK0 depends on initial values. This completes the proof.Remark 3.2.
Note that this theorem only guarantees thate(t)→0, that is, y(t)→x(t), and a̅̇ij→0, b̅̇ij→0, c̅̇ij→0, d̅̇ij→0 as t→∞; therefore, it is not necessary that A0=A, B0=B, C0=C and D0=D since it is possible that Ax(t)+Bx(t-τ(t))+Cf(x(t))+Dg(x(t-τ))=A0x(t)+B0x(t-τ(t))+C0f(x(t))+D0g(x(t-τ)) when A0≠A, B0≠B, C0≠C, and D0≠D. Another possible reason is that several sets of parameters A,B,C,D generate the same trajectory in response system (2.3), and A̅,B̅,C̅,D̅ converge to only one such set. Both of the above two reasons will make A0,B0,C0,D0 in the largest invariant set E not  unique in general except for some special delayed systems.Therefore, we have the following corollary.Corollary 3.3.
The unknown parametersA,B,C,D of concerned delayed system are identifiable and A0=A, B0=B, C0=C, D0=D if A0,B0,C0,D0 unique in the largest invariant set E.
This corollary can be derived directly from Theorem3.1.


## 4. Numerical Illustrations

In this section, two chaotic nonlinear systems with time-varying delay, that is, delayed Rössler system [43] and delayed Hopfield neural networks system [27], are employed to demonstrate the effectiveness of the proposed adaptive synchronization scheme.


### 4.1. Delayed Rössler System

A delayed Rössler system is studied in [43] whose evolution equation is as follows (when τ1=τ2 in  [43]):
(4.1)ẋ1=-y1-z1+αx1(t-τ),ẏ1=x1+ay1,ż1=b+z1(x1-c).
When α=0.5,a=b=0.2,c=5.7, and τ=τ0+AsinΩt, the delayed Rössler system is chaotic; see Figure 1.Figure 1
Chaotic attractor of delayed Rössler system forA=1,Ω=1,τ0=1.Here we refer to system (4.1) with the parameters a,b,c being unknown as the drive system. The response system can be described as
(4.2)ẋ2=-y2-z2+αx2(t-τ)+u1(t),ẏ2=x2+a̅y2+u2(t),ż2=b̅+z2(x2-c̅)+u3(t).
Clearly Assumption 2.1 and Assumption 2.2 are satisfied.Defining the error statee=[e1,e2,e3]T=[x2-x1,y2-y1,z2-z1]T and following the procedure proposed in the Section 2, we can design the adaptive scheme as follows:
(4.3)u1(t)=k1(x2-x1),u2(t)=k2(y2-y1),u3(t)=k3(z2-z1),
with the feedback strength K=diag(k1,k2,k3) updated by
(4.4)k̇1=-γ1e12,k̇2=-γ2e22,k̇3=-γ3e32,a̅̇(t)=-α22e2y2,b̅̇(t)=-p32e3,c̅̇(t)=-α33e3z2,
where γ1,γ2,γ3,α22,α33, and p32 are arbitrary positive constants.In the following numerical simulations, we take[x1(t),y1(t),z1(t)]T=[5,5,5]T, [x2(t),y2(t),z2(t)]T=[-5,-5,-5]T, [k1(t),k2(t),k3(t)]T=[0,0,0]T, and [a̅(t),b̅(t),c̅(t)]T=[0,0,0]T for t∈[-2,0]. The results are shown in Figures 2, 3, 4, 5, and 6.Numerically simulated time seriesx1,y1,z1 (dotted line) and x2,y2,z2 (black line).
(a)(b)(c)Numerically simulated errore(t).
(a)(b)(c)The temporal trajectory ofa̅(t),b̅(t), and c̅(t).
(a)(b)(c)The evolution of feedback strengthk.
(a)(b)(c)The evolution of adaptive controlleru(t).
(a)(b)(c)


### 4.2. Hopfield Neural Network Model

This subsection considers a typical delayed Hopfield neural network system [27]
(4.5)ẋ=Ax+Bx(t-τ)+Cf(x)+Dg(x(t-τ)),
where x=[x1,x2]T and τ=et/(1+et). When A=(-100-1), B=(0000), C=(2.0-0.1-5.03.2), and D=(-1.6-0.1-0.18-2.4), the delayed Hopfield neural network system (4.5) is chaotic.We refer to system (4.5) with
(4.6)A=(a00-1),B=(0000),C=(2.0c-5.03.2),D=(-1.6-0.1-0.18d),
as the drive system, where parameters a,c,d are unknown. The response system has the following form:
(4.7)ẏ=A̅y+B̅y(t-τ)+C̅f(y)+D̅g(y(t-τ))+u(t),
where y=[y1,y2]T, u=[u1,u2]T, and A=(a̅00-1), B=(0000), C=(2.0c̅-5.03.2), and D=(-1.6-0.1-0.18d̅).It is easy to verify that Assumption2.1 and Assumption 2.2 are satisfied. Defining e=[e1,e2]T=[y1-x1,y2-x1]Tand following the procedure proposed in the Section 2, the adaptive scheme can be designed as follows:
(4.8)u1(t)=k1(y1-x1),u2(t)=k2(y2-x2),
with
(4.9)k̇1=-γ1e12,k̇2=-γ2e22,a̅̇=-α11e1y1,c̅̇=-p12e1tanhy2,d̅̇=-q22e2tanh(y2(t-τ)).The initial values are chosen as[x1(t),x2(t)]T=[0.2,0.5]T, [y1(t),y2(t)]T=[-1.3,2.1]T, [k1(t),k2(t)]T=[0,0]T and [a̅(t),c̅(t),d̅(t)]T=[0,0,0]T. The results are depicted in Figures 7–9.Numerically simulated time seriesx1,x2 (dotted line) and y1,y2 (black line) and error e=[e1,e2]T.
(a)(b)(c)(d)The temporal trajectory ofa̅(t),c̅(t), and d̅(t).
(a)(b)(c)The evolution of feedback strengthk and adaptive controller u(t).
(a)(b)(c)(d)By comparing Figures4 and 8, one can see that in Figure 8 the estimates of the unknown parameters, a̅,c̅,d̅, converge to the true value of a=-1,c=-0.1,andd=-2.4; however, for the delayed Rössler system, the estimates of unknown parameters, a̅,b̅,c̅, converge to a0=-1.85,b0=1.4559, andc0=1.3655 which are not equal to the true value of a,b,c. It is reasonable because for Hopfield neural network system, a̅,c̅,d̅ in the largest invariant set unique, which is equal to the true value of a,c,d; but for delayed Rössler system, a̅,b̅,c̅ in the largest invariant set cannot be proven to be unique, which means what values a̅,b̅,c̅ do converge to depend on the initial value of a̅,b̅,c̅.


## 4.1. Delayed Rössler System

A delayed Rössler system is studied in [43] whose evolution equation is as follows (when τ1=τ2 in  [43]):
(4.1)ẋ1=-y1-z1+αx1(t-τ),ẏ1=x1+ay1,ż1=b+z1(x1-c).
When α=0.5,a=b=0.2,c=5.7, and τ=τ0+AsinΩt, the delayed Rössler system is chaotic; see Figure 1.Figure 1
Chaotic attractor of delayed Rössler system forA=1,Ω=1,τ0=1.Here we refer to system (4.1) with the parameters a,b,c being unknown as the drive system. The response system can be described as
(4.2)ẋ2=-y2-z2+αx2(t-τ)+u1(t),ẏ2=x2+a̅y2+u2(t),ż2=b̅+z2(x2-c̅)+u3(t).
Clearly Assumption 2.1 and Assumption 2.2 are satisfied.Defining the error statee=[e1,e2,e3]T=[x2-x1,y2-y1,z2-z1]T and following the procedure proposed in the Section 2, we can design the adaptive scheme as follows:
(4.3)u1(t)=k1(x2-x1),u2(t)=k2(y2-y1),u3(t)=k3(z2-z1),
with the feedback strength K=diag(k1,k2,k3) updated by
(4.4)k̇1=-γ1e12,k̇2=-γ2e22,k̇3=-γ3e32,a̅̇(t)=-α22e2y2,b̅̇(t)=-p32e3,c̅̇(t)=-α33e3z2,
where γ1,γ2,γ3,α22,α33, and p32 are arbitrary positive constants.In the following numerical simulations, we take[x1(t),y1(t),z1(t)]T=[5,5,5]T, [x2(t),y2(t),z2(t)]T=[-5,-5,-5]T, [k1(t),k2(t),k3(t)]T=[0,0,0]T, and [a̅(t),b̅(t),c̅(t)]T=[0,0,0]T for t∈[-2,0]. The results are shown in Figures 2, 3, 4, 5, and 6.Numerically simulated time seriesx1,y1,z1 (dotted line) and x2,y2,z2 (black line).
(a)(b)(c)Numerically simulated errore(t).
(a)(b)(c)The temporal trajectory ofa̅(t),b̅(t), and c̅(t).
(a)(b)(c)The evolution of feedback strengthk.
(a)(b)(c)The evolution of adaptive controlleru(t).
(a)(b)(c)


## 4.2. Hopfield Neural Network Model

This subsection considers a typical delayed Hopfield neural network system [27]
(4.5)ẋ=Ax+Bx(t-τ)+Cf(x)+Dg(x(t-τ)),
where x=[x1,x2]T and τ=et/(1+et). When A=(-100-1), B=(0000), C=(2.0-0.1-5.03.2), and D=(-1.6-0.1-0.18-2.4), the delayed Hopfield neural network system (4.5) is chaotic.We refer to system (4.5) with
(4.6)A=(a00-1),B=(0000),C=(2.0c-5.03.2),D=(-1.6-0.1-0.18d),
as the drive system, where parameters a,c,d are unknown. The response system has the following form:
(4.7)ẏ=A̅y+B̅y(t-τ)+C̅f(y)+D̅g(y(t-τ))+u(t),
where y=[y1,y2]T, u=[u1,u2]T, and A=(a̅00-1), B=(0000), C=(2.0c̅-5.03.2), and D=(-1.6-0.1-0.18d̅).It is easy to verify that Assumption2.1 and Assumption 2.2 are satisfied. Defining e=[e1,e2]T=[y1-x1,y2-x1]Tand following the procedure proposed in the Section 2, the adaptive scheme can be designed as follows:
(4.8)u1(t)=k1(y1-x1),u2(t)=k2(y2-x2),
with
(4.9)k̇1=-γ1e12,k̇2=-γ2e22,a̅̇=-α11e1y1,c̅̇=-p12e1tanhy2,d̅̇=-q22e2tanh(y2(t-τ)).The initial values are chosen as[x1(t),x2(t)]T=[0.2,0.5]T, [y1(t),y2(t)]T=[-1.3,2.1]T, [k1(t),k2(t)]T=[0,0]T and [a̅(t),c̅(t),d̅(t)]T=[0,0,0]T. The results are depicted in Figures 7–9.Numerically simulated time seriesx1,x2 (dotted line) and y1,y2 (black line) and error e=[e1,e2]T.
(a)(b)(c)(d)The temporal trajectory ofa̅(t),c̅(t), and d̅(t).
(a)(b)(c)The evolution of feedback strengthk and adaptive controller u(t).
(a)(b)(c)(d)By comparing Figures4 and 8, one can see that in Figure 8 the estimates of the unknown parameters, a̅,c̅,d̅, converge to the true value of a=-1,c=-0.1,andd=-2.4; however, for the delayed Rössler system, the estimates of unknown parameters, a̅,b̅,c̅, converge to a0=-1.85,b0=1.4559, andc0=1.3655 which are not equal to the true value of a,b,c. It is reasonable because for Hopfield neural network system, a̅,c̅,d̅ in the largest invariant set unique, which is equal to the true value of a,c,d; but for delayed Rössler system, a̅,b̅,c̅ in the largest invariant set cannot be proven to be unique, which means what values a̅,b̅,c̅ do converge to depend on the initial value of a̅,b̅,c̅.


## 5. Concluding Remarks

The present paper dealt with the problem of parameters identification and synchronization of chaotic delayed systems containing uncertainties and time-varying delay. A simple but efficient adaptive regime was designed firstly to synchronize the chaotic dynamics between two coupled identical time-varying delayed chaotic systems, which is seriously proved in the framework of Krasovskii-Lyapunov theory [39] based on the famous Razumikhin condition and extended invariance principle for functional differential equations. Then, the proposed technique was utilized to estimate the unknown parameters containing in model. By virtue of the synchronization-based method, the unknown parameters of Rössler system were estimated exactly. But, because of the limitation of invariant principle, that is, it only guarantees the estimates of the unknown parameters to converge to the largest invariant set containing in {V̇=0}, hence, the synchronization-based adaptive schemes may fail if the largest invariant set containing in {(e(t),A̅,B̅,C̅,D̅,K)∣V̇=0} has more than one element. It is worth emphasizing that the largest invariant set depends tightly on the configuration of the system under consideration, which can be calculated by following some classical steps as given in [39] (or other literatures related to invariant principle theorem). The regime proposed here is rigorous and global. The effectiveness of the proposed scheme on synchronization and parameters identification is well demonstrated by the numerical examples.



---

*Source: 105309-2010-05-26.xml*