# Observer-Based Adaptive Iterative Learning Control for a Class of Nonlinear Time Delay Systems with Input Saturation

Authors: Jian-ming Wei; Yun-an Hu; Mei-mei Sun
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

This paper presents an adaptive iterative learning control scheme for the output tracking of a class of nonlinear systems with unknown time-varying delays and input saturation nonlinearity. An observer is presented to estimate the states and linear matrix inequality (LMI) method is employed for observer design. The assumption of identical initial condition for ILC is relaxed by introducing boundary layer function. The possible singularity problem is avoided by introducing hyperbolic tangent function. The uncertainties with time-varying delays are compensated for by the combination of appropriate Lyapunov-Krasovskii functional and Young’s inequality. Both time-varying and time-invariant radial basis function neural networks are employed to deal with system uncertainties. On the basis of a property of hyperbolic tangent function, the system output is proved to converge to a small neighborhood of the desired trajectory by constructing Lyapunov-like composite energy function in two cases, while keeping all the closed-loop signals bounded. Finally, a simulation example is presented to verify the effectiveness of the proposed approach.


---

## Body

## 1. Introduction

Over the past decades, tremendous research efforts have been made aiming at the development of systematic design methods for the iterative learning control (ILC) of nonlinear systems performing control task over a finite interval repeatedly. ILC has become the most suitable and effective control scheme for such repeatable control tasks because of its capacity of achieving perfect tracking by learning mechanism along iteration. Generally, according to the stability analysis tool, ILC can be classified into two categories: traditional ILC [1–4] and adaptive ILC (AILC) [5–10]. The basic principle of traditional ILC is to use information collected from previous execution to form the control action for current operation by a learning mechanism for purpose of improving performances from iteration to iteration. Furthermore, the stability conclusion of traditional ILC is usually obtained by using contraction mapping theorem and fixed point theorem. However, traditional ILC requires for the global Lipschitz continuous condition, which makes it difficult to apply it to certain nonlinear systems. Besides, traditional ILC uses contraction mapping theorem rather than Lyapunov method as the key principle of stability analysis, which makes it difficult to relax the global Lipschitz condition to local Lipschitz or even non-Lipschitz condition and cooperate with the mainstream methods of nonlinear control theory, such as adaptive control and neural control. To relax the constraints of traditional ILC and extend it to a broader range, some researchers tried to introduce the idea of adaptive control into ILC and proposed adaptive iterative learning control (AILC). AILC takes advantage of both adaptive control and ILC, which successfully overcomes the restriction of global Lipschitz condition; thus it enables us to use fuzzy logic systems or neural networks as approximators to deal with nonlinear uncertainties. In general, the control parameters of AILC methods are tuned along the iteration axis, and the so-called composite energy function (CEF) [5] is usually constructed to analyze the stability and convergence property of the closed-loop systems. The past decade has witnessed great progress in AILC of uncertain nonlinear systems [6–10].In practice, control of systems with time delays has always been a meaning research, since time delay can be often encountered in a wide range of physical systems and devices, such as turbojet engines, aircraft systems, microwave oscillators, nuclear reactors, and chemical processes [11, 12]. The existence of time delays in a system may degrade the control performance and even at worst may become a source of instability. Thus, the investigation of time delay in systems has always been an active topic for control engineers. Consequently, stabilization problem of control systems with time delay has received much attention for several decades and a large number of research results have been reported in the literature that deal with various analysis and design problems [11–16]. However, in the field of AILC, only a few results are available for nonlinear systems with time delays [17–19]. In [17], an AILC strategy was developed for a class of scalar systems with unknown time-varying delay and then extended to a class of high-order systems with both time-varying and time-invariant parameters, where the unknown time-varying parameter was estimated in the iterative learning process. However, the proposed controller in [17] requires that the uncertainties in the system satisfy local Lipschitz condition and nonlinear parameterized condition such that adaptive learning laws can be used to estimate the unknown time-varying parameters. In [18, 19], we designed an AILC scheme for a class of nonlinearly parameterized systems and an RBF NN-based AILC for class of unparameterized systems, respectively, where the systems in two papers are with both unknown time-varying delays and unknown dead zone input. However, all of the aforementioned results are on systems with time delay states. As for systems with time delay outputs, to the best of our knowledge, there are no works reported in the literature.Other than time delay, another challenging problem in control of nonlinear systems lies in the existence of nonsmooth and nonlinear characteristics such as dead zone, hysteresis, saturation, and backlash. Among them, the significance of controller design for systems with saturation can be overemphasized, as any control systems depending on actuators have physical limitations, for example, mechanical actuators and aircraft. The existence of saturation can severely limit system performances and usually leads to undesirable inaccuracies and even instability [20]. Therefore, the control design for nonlinear systems preceded by input saturation is a challenging but worthwhile and necessary issue. For control systems with input saturation, many results have been published in the past several decades [20–26]. To address such a problem, the principal work is to model the input saturation nonlinearity for controller design. Generally, saturation is modeled as u
=
sat
⁡
⁡
v
=
v
+
Δ
u, where v and u are the input and output of saturation nonlinearity, respectively, and Δ
u denotes the difference between the actual control effect u and input v. In [20], the hyperbolic tangent function is employed in the model of input saturation. Like control design for systems with time delays, only a few results are available at present stage from the viewpoint of ILC. In [7], an iterative learning control scheme is designed for a class of nonlinear uncertain systems with input saturation and the analysis of convergence in the iteration domain was presented on the basis of composite energy function consisting of both input and output information. In [27] an adaptive iterative learning control strategy for high-speed trains with unknown speed delays and control input saturation is designed to address speed trajectory tracking problem. It turns out that control design in the presence of both input saturation and time delays is even more difficult. As far as we know, there are few works reported from the viewpoint of AILC to deal with nonlinear systems with saturation nonlinearity and time delays in the literature at present stage.In the control community, state feedback control is very powerful for nonlinear systems as the full information of the state vectors is assumed to be accessible for feedback. However, in many real world control systems, only the measured output information, rather than the full state information, is available for feedback. For systems with only output measurable, observer-based output feedback controller has been proven to be the most effective scheme, which is a dynamic output feedback controller that estimates the system states online. Over the past decades, there has been a considerable development in various observer design methodologies using different approaches [28–35]. Although so many results have been developed, only a few results are available from the point of AILC [36–42]. How to design an AILC for nonlinear systems using only output measurement is an interesting and challenging issue. Tayebi and Xu proposed an observer-based iterative learning control scheme for the tracking problem of a class of time-varying nonlinear systems and gave the sufficient conditions for the boundedness and the convergence to zero of the estimation error by using contraction mapping method [36]. In [37], a learning control approach combined with an observer was developed for output tracking of a class of nonlinear systems with time-varying parametric uncertainties and the Lyapunov-like energy function was employed to facilitate convergence analysis. Wang and Chien introduced an error observer to design an iterative learning controller for robotic systems, where a robust learning component using a filtered fuzzy neural network was presented to solve the problem of unknown nonlinearities [38]. Subsequently, the results in [38] were extended to SISO nonlinear system [39], MIMO nonlinear systems [40], and MIMO nonlinear systems with delayed output [41]. Chen et al. extended the result in [36] and proposed an observer-based AILC for nonlinear systems with unknown time-varying parametric uncertainties and the delayed output, where the Lyapunov-Krasovskii-like composite energy function was constructed to prove the boundedness of all closed-loop signals and the convergence of output tracking error [42]. But unfortunately the system nonlinearities must satisfy global Lipschitz continuous condition and the observer design depends on the known system’s nonlinear functions. Even though the AILC problem for nonlinear systems using only output measurement has been investigated in the above works, it is noted that the dynamics of nonlinear systems in these works need to satisfy some special structures or conditions.Motivated by the above observations, in this paper we consider the observer-based AILC problem for a class of nonlinear systems with unknown time-varying delays preceded by input saturation. To the best of our knowledge, up till now no works have been reported in the field of AILC to deal with such kinds of systems. In the proposed AILC scheme, both time-varying and time-invariant radial basis function neural network are utilized to form the iterative learning controller and a CEF along both time and iteration axes is constructed to analyze the stability and convergence property. Theoretical analysis and simulation example show that the proposed approach can guarantee that all the signals are bounded and tracking errors converge to a small neighbourhood of the origin. The main contributions of the proposed AILC scheme are highlighted as follows. (1) As far as we know, it is the first time, in the literature, that observer-based AILC problem of unknown nonlinear systems with unknown time-varying time delays and input saturation is investigated. (2) Both time-varying and time-invariant RBF neural networks are used to approximate the unknown time-varying functions and uncertainty that is independent of time variable. (3) Hyperbolic tangent function is employed to handle the singularity problem encountered in Lyapunov synthesis. (4) The boundary layer function is introduced to remove the requirement for identical initial condition which is required for the majority of ILC schemes.The organization of this paper is as follows. The problem formulation and preliminaries are given in Section2. In Section 3, the observer and AILC scheme are developed. Results of extensive simulation studies are presented to demonstrate the validity of the proposed scheme in Section 4, followed by conclusions in Section 5.Throughout this paper, the following notations will be used. (1)σ denotes the integral variable. (2) · denotes the absolute value of a scalar function. (3) · denotes the Euclidean norm or any other consistent norm of a vector or matrix. (4) N is the set of nonnegative integers. (5) For a signal vector r
k
t, define r
k
(
t
)
L
T
∞
=
max
k
,
t
∈
N
×
0
,
T
⁡
r
k
(
t
) and r
k
(
t
)
L
T
2
=
∫
0
T
r
k
(
σ
)
2
d
σ. If r
k
(
t
)
L
T
∞
<
∞, we say that r
k
t is bounded in L
T
∞-norm, which is denoted by r
k
t
∈
L
T
∞. Similarly, we denote the boundedness of r
k
t in L
T
2-norm by r
k
t
∈
L
T
2. Obviously, the boundedness in L
T
∞-norm implies the boundedness in L
T
2-norm because r
k
(
t
)
L
T
2
≤
T
r
k
(
t
)
L
T
∞
2.


## 2. Problem Formulation and Preliminaries

### 2.1. Problem Formulation

In this paper, we consider a class of nonlinear time delay systems with input saturation which runs on a finite time interval0
,
T repeatedly(1)x˙i,kt=xi+1,kt,i=1,…,n-1,x˙n,kt=fxkt,t+hyτ,kt,t+ukvkt+dt,ykt=x1,kt,t∈0,T,ykt=ϖt,t∈-τmax⁡,0,where k
∈
N denotes the index of iteration; y
k
t
∈
R and x
i
,
k
t
∈
R, i
=
1
,
…
,
n, are the system output and states, respectively; x
k
t
≜
x
1
,
k
t
,
…
,
x
n
,
k
t
T are the delay-free state vectors; τ
i
t are unknown time-varying delays and y
τ
i
,
k
≜
y
k
t
-
τ
i
t, i
=
2
,
…
,
n, and y
τ
,
k
t
=
y
τ
1
,
k
t
,
…
,
y
τ
n
,
k
t
T; f
·
,
· and g
·
,
· are unknown smooth functions; h
·
,
· is an unknown smooth function of time delay output with upper bound. d
t is unknown bounded external disturbance. u
k
v
k
t denotes the saturation nonlinearity. ϖ
t denotes the initial function for delayed output. The states are assumed to be unavailable for measurement and only output is measurable. The system is bounded-input-bounded-output (BIBO) stable. In the subsequent parts, the variable t will be omitted when no confusions arise.Our design objective is to determine an adaptive iterative controller for system (1) to steer the output y
k following a desired reference signal y
d over 0
,
T as k
→
∞, while ensuring that all the signals in the closed-loop system remain bounded.Define the desired trajectory asx
d
=
y
d
,
y
˙
d
,
…
,
y
d
n
-
1
T, which is a vector of y
d up to its (
n
-
1
)th time derivative. To facilitate control system design, the following reasonable assumptions are made.Assumption 1.
The unknown time-varying delaysτ
i
t satisfy 0
≤
τ
i
t
≤
τ
max
⁡, τ
˙
i
t
≤
κ
<
1, i
=
1,2
,
…
,
n, where τ
max
⁡ is known and κ is an unknown positive constant.Assumption 2.
The unknown smooth functionh
·
,
· satisfies the following inequality:(2)hyτ,k,t≤∑j=1nρjyτj,kt,where ρ
j
· are unknown positive smooth functions.Assumption 3.
The desired reference signaly
d
t up to its nth derivative is continuous, bounded, and available.Assumption 4.
The unknown external disturbanced
t is bounded; that is, d
t
≤
D
1, with D
1 as an unknown constant.Assumption 5.
The initial state vector is chosen asϖ
t
=
y
d
t
,
t
∈
-
τ
max
⁡
,
0.Remark 6.
Assumption1 is usually necessary in the control problem of systems with unknown time-varying delays, which ensures that the time delay terms can be compensated for by using Lyapunov-Krasovskii functional. And this assumption is more relaxed than that in [17] which requires for a priori knowledge of κ.Remark 7.
Compared with the assumption of time-varying parameterization with known upper bound functions in [17], Assumption 2 is much more relaxed and can be easily satisfied.Remark 8.
Assumption5 is only for analytical purpose and of no practical meaning.


### 2.2. Input Saturation

In this paper, the output of a controlu
k with input v
k subjected to the condition of saturation is given by(3)uk=vk,vk<uMuMsgn⁡vk,vk≥uM,where u
M is the bound of input v
k. For convenience of design, we rewrite the saturation nonlinearity as(4)uk=βvk+d1vkwith β
v
k
=
u
M
×
tanh
⁡
v
k
/
u
M. The part of the control effect that cannot be implemented is defined as(5)d1vk=uk-βvk.Obviously,d
1
v
k is bounded by(6)d1vk=sat⁡vk-βvk≤uM1-tanh⁡1=D2.A graphic presentation of saturation model is shown in Figure1.Figure 1
Saturation model.


### 2.3. RBF Neural Networks

In control engineering, two types of artificial neural networks are usually used to approximate unknown smooth functions, which specifically are linearly parameterized neural networks (LPNNs) and multilayer neural networks (MNNs). As a kind of LPNNs, the radial basis function (RBF) neural network (NN) [43] is usually used as a tool to model unknown nonlinear functions owing to its nice approximation capabilities. The RBF NN can be seen as a two-layer network in which hidden layer performs a fixed nonlinear transformation with no adjustable parameters; that is, the input space is mapped into a new space. The output layer then combines the outputs in the latter space linearly. Generally, the RBF NN approximates the continuous function Q
Z
:
R
q
→
R as follows:(7)QnnZ=WTϕZ,where Z
∈
Ω
Z
⊂
R
q is the input vector, W
=
w
1
,
w
2
,
…
,
w
l
T
∈
R
l is the weight vector, and the NN node number l
>
1; and ϕ
Z
=
φ
1
(
Z
)
,
…
,
φ
l
(
Z
)
T, with φ
i
(
Z
) as the commonly used Gaussian functions; that is, φ
i
(
Z
)
=
e
-
Z
-
μ
i
T
Z
-
μ
i
/
σ
i
2, i
=
1
,
…
,
l, where μ
i
=
μ
i
1
,
μ
i
2
,
…
,
μ
i
q is the center of the receptive field and σ
i is the width of the Gaussian function. It has been proven that if l is chosen sufficiently large, W
T
ϕ
Z can approximate any continuous function, Q
Z, over a compact set Ω
Z
⊂
R
q to any arbitrary accuracy in the form of Q
Z
=
W
∗
T
ϕ
(
Z
)
+
ε
Z, for all Z
∈
Ω
Z
⊂
R
q where W
∗ is the ideal constant weight vector and ε
Z is the approximation error which is bounded over the compact set; that is, ε
Z
≤
ε
∗, for all Z
∈
Ω
Z, where ε
∗
>
0 is an unknown constant. The ideal weight vector W
∗ is an “artificial” quantity required for analytical purposes. W
∗ is defined as the value of W that minimizes ε
Z for all Z
∈
Ω
Z
⊂
R
q; that is, W
∗
≔
argmin
W
∈
R
l
⁡
sup
Z
∈
Ω
Z
⁡
Q
Z
-
W
T
ϕ
Z.When neural networks are used to approximate unknown functions, updating laws for estimating the weight vector need to be designed. In the early stage, the gradient-based back-propagation algorithms and their variants are the most popular algorithms for training neural networks. Along with the applications in traditional adaptive control framework, differential type updating laws were developed in the control scheme design and stability analysis by using Lyapunov method. Over the past few decades, large numbers of adaptive neural control schemes have been presented [11–13, 21, 24, 26]. However, difficulties arise when using (7) to approximate unknown time-varying function Q
Z
,
t, especially when Q
Z
,
t is fast time-varying. In order to deal with this problem, a kind of time-varying neural networks is proposed to approximate the unknown time-varying functions in the form of Q
Z
,
t
=
W
∗
T
t
ϕ
(
Z
)
+
ε
Z
,
t, whose ideal weight vector W
∗
t is time-varying [44, 45]. Difference type learning law is designed and the named CEF method is exploited to obtain the convergence and stability results.In this paper, we will employ both time-varying RBF neural networks proposed in [44, 45] and time-invariant RBF NNs (7) as the approximator to overcome the design problem from the uncertainties.


### 2.4. Schur Complement Lemma [46]

In this paper, the following lemma is used.Lemma 9.
The LMI(8)S=S11S12S21S22<0,where S
11
=
S
11
T and S
22
=
S
22
T, is equivalent to(9)S22<0,S11-S12S22-1S12T<0.


## 2.1. Problem Formulation

In this paper, we consider a class of nonlinear time delay systems with input saturation which runs on a finite time interval0
,
T repeatedly(1)x˙i,kt=xi+1,kt,i=1,…,n-1,x˙n,kt=fxkt,t+hyτ,kt,t+ukvkt+dt,ykt=x1,kt,t∈0,T,ykt=ϖt,t∈-τmax⁡,0,where k
∈
N denotes the index of iteration; y
k
t
∈
R and x
i
,
k
t
∈
R, i
=
1
,
…
,
n, are the system output and states, respectively; x
k
t
≜
x
1
,
k
t
,
…
,
x
n
,
k
t
T are the delay-free state vectors; τ
i
t are unknown time-varying delays and y
τ
i
,
k
≜
y
k
t
-
τ
i
t, i
=
2
,
…
,
n, and y
τ
,
k
t
=
y
τ
1
,
k
t
,
…
,
y
τ
n
,
k
t
T; f
·
,
· and g
·
,
· are unknown smooth functions; h
·
,
· is an unknown smooth function of time delay output with upper bound. d
t is unknown bounded external disturbance. u
k
v
k
t denotes the saturation nonlinearity. ϖ
t denotes the initial function for delayed output. The states are assumed to be unavailable for measurement and only output is measurable. The system is bounded-input-bounded-output (BIBO) stable. In the subsequent parts, the variable t will be omitted when no confusions arise.Our design objective is to determine an adaptive iterative controller for system (1) to steer the output y
k following a desired reference signal y
d over 0
,
T as k
→
∞, while ensuring that all the signals in the closed-loop system remain bounded.Define the desired trajectory asx
d
=
y
d
,
y
˙
d
,
…
,
y
d
n
-
1
T, which is a vector of y
d up to its (
n
-
1
)th time derivative. To facilitate control system design, the following reasonable assumptions are made.Assumption 1.
The unknown time-varying delaysτ
i
t satisfy 0
≤
τ
i
t
≤
τ
max
⁡, τ
˙
i
t
≤
κ
<
1, i
=
1,2
,
…
,
n, where τ
max
⁡ is known and κ is an unknown positive constant.Assumption 2.
The unknown smooth functionh
·
,
· satisfies the following inequality:(2)hyτ,k,t≤∑j=1nρjyτj,kt,where ρ
j
· are unknown positive smooth functions.Assumption 3.
The desired reference signaly
d
t up to its nth derivative is continuous, bounded, and available.Assumption 4.
The unknown external disturbanced
t is bounded; that is, d
t
≤
D
1, with D
1 as an unknown constant.Assumption 5.
The initial state vector is chosen asϖ
t
=
y
d
t
,
t
∈
-
τ
max
⁡
,
0.Remark 6.
Assumption1 is usually necessary in the control problem of systems with unknown time-varying delays, which ensures that the time delay terms can be compensated for by using Lyapunov-Krasovskii functional. And this assumption is more relaxed than that in [17] which requires for a priori knowledge of κ.Remark 7.
Compared with the assumption of time-varying parameterization with known upper bound functions in [17], Assumption 2 is much more relaxed and can be easily satisfied.Remark 8.
Assumption5 is only for analytical purpose and of no practical meaning.


## 2.2. Input Saturation

In this paper, the output of a controlu
k with input v
k subjected to the condition of saturation is given by(3)uk=vk,vk<uMuMsgn⁡vk,vk≥uM,where u
M is the bound of input v
k. For convenience of design, we rewrite the saturation nonlinearity as(4)uk=βvk+d1vkwith β
v
k
=
u
M
×
tanh
⁡
v
k
/
u
M. The part of the control effect that cannot be implemented is defined as(5)d1vk=uk-βvk.Obviously,d
1
v
k is bounded by(6)d1vk=sat⁡vk-βvk≤uM1-tanh⁡1=D2.A graphic presentation of saturation model is shown in Figure1.Figure 1
Saturation model.


## 2.3. RBF Neural Networks

In control engineering, two types of artificial neural networks are usually used to approximate unknown smooth functions, which specifically are linearly parameterized neural networks (LPNNs) and multilayer neural networks (MNNs). As a kind of LPNNs, the radial basis function (RBF) neural network (NN) [43] is usually used as a tool to model unknown nonlinear functions owing to its nice approximation capabilities. The RBF NN can be seen as a two-layer network in which hidden layer performs a fixed nonlinear transformation with no adjustable parameters; that is, the input space is mapped into a new space. The output layer then combines the outputs in the latter space linearly. Generally, the RBF NN approximates the continuous function Q
Z
:
R
q
→
R as follows:(7)QnnZ=WTϕZ,where Z
∈
Ω
Z
⊂
R
q is the input vector, W
=
w
1
,
w
2
,
…
,
w
l
T
∈
R
l is the weight vector, and the NN node number l
>
1; and ϕ
Z
=
φ
1
(
Z
)
,
…
,
φ
l
(
Z
)
T, with φ
i
(
Z
) as the commonly used Gaussian functions; that is, φ
i
(
Z
)
=
e
-
Z
-
μ
i
T
Z
-
μ
i
/
σ
i
2, i
=
1
,
…
,
l, where μ
i
=
μ
i
1
,
μ
i
2
,
…
,
μ
i
q is the center of the receptive field and σ
i is the width of the Gaussian function. It has been proven that if l is chosen sufficiently large, W
T
ϕ
Z can approximate any continuous function, Q
Z, over a compact set Ω
Z
⊂
R
q to any arbitrary accuracy in the form of Q
Z
=
W
∗
T
ϕ
(
Z
)
+
ε
Z, for all Z
∈
Ω
Z
⊂
R
q where W
∗ is the ideal constant weight vector and ε
Z is the approximation error which is bounded over the compact set; that is, ε
Z
≤
ε
∗, for all Z
∈
Ω
Z, where ε
∗
>
0 is an unknown constant. The ideal weight vector W
∗ is an “artificial” quantity required for analytical purposes. W
∗ is defined as the value of W that minimizes ε
Z for all Z
∈
Ω
Z
⊂
R
q; that is, W
∗
≔
argmin
W
∈
R
l
⁡
sup
Z
∈
Ω
Z
⁡
Q
Z
-
W
T
ϕ
Z.When neural networks are used to approximate unknown functions, updating laws for estimating the weight vector need to be designed. In the early stage, the gradient-based back-propagation algorithms and their variants are the most popular algorithms for training neural networks. Along with the applications in traditional adaptive control framework, differential type updating laws were developed in the control scheme design and stability analysis by using Lyapunov method. Over the past few decades, large numbers of adaptive neural control schemes have been presented [11–13, 21, 24, 26]. However, difficulties arise when using (7) to approximate unknown time-varying function Q
Z
,
t, especially when Q
Z
,
t is fast time-varying. In order to deal with this problem, a kind of time-varying neural networks is proposed to approximate the unknown time-varying functions in the form of Q
Z
,
t
=
W
∗
T
t
ϕ
(
Z
)
+
ε
Z
,
t, whose ideal weight vector W
∗
t is time-varying [44, 45]. Difference type learning law is designed and the named CEF method is exploited to obtain the convergence and stability results.In this paper, we will employ both time-varying RBF neural networks proposed in [44, 45] and time-invariant RBF NNs (7) as the approximator to overcome the design problem from the uncertainties.


## 2.4. Schur Complement Lemma [46]

In this paper, the following lemma is used.Lemma 9.
The LMI(8)S=S11S12S21S22<0,where S
11
=
S
11
T and S
22
=
S
22
T, is equivalent to(9)S22<0,S11-S12S22-1S12T<0.


## 3. Observer and Adaptive Neural Iterative Learning Controller Design

### 3.1. Observer Design

Rewrite system (1) as(10)x˙k=Axk+K0yk+Bfxk,t+hyτ,k,t+βvk+d1vk+dtwith(11)Ko=k1,k2,…,knT,A=-k1-k2In-1⋮-kn0⋯0,B=0,…,0,1T,where I
n
-
1 is a unit square matrix with n
-
1 dimensions. K
0
∈
R
n can be selected such that A is a strict Hurwitz matrix. Thus, given a matrix Q
>
0, there exists P
>
0 satisfying the following inequality:(12)ATP+PA+n+3λPPT<-Q,where λ is a positive scalar.Remark 10.
In this paper, to solve inequality (12), we decompose A
=
A
-
+
K
0
B
- where(13)A-=0⋮In-10⋯0,B-=-1,0,…,0.Based on Lemma9, (12) is equivalent to the following LMI:(14)PA-+MB-+B-TMT+A-TP+QPP-λn+3In<0,where Q is a given positive definite matrix and I
n is a unit matrix. Furthermore, it should be noted that P, M, and λ can be computed simultaneously via MATLAB LMI toolbox, and the observer gain matrix is obtained by K
0
=
P
-
1
M.For simplicity, defined
-
t
=
d
1
v
k
+
d
t. Then it is obvious that d
-
t
≤
D
0 with D
0
=
D
1
+
D
2. To estimate the states of system (10), design the observer as(15)x^˙k=Ax^k+Koyk+BΨk+vk,y^k=x^1,k,where Ψ
k will be given later. For subsequent design, we define Δ
v
k
=
β
v
k
-
v
k which describes the effect of input saturation and can be effectively approximated by using a dynamic neural network.Definez
k
≜
z
1
,
k
,
z
2
,
k
,
…
,
z
n
,
k
=
x
k
-
x
^
k; then we can obtain the dynamic of observer error by subtracting (15) from (10):(16)z˙k=Azk+BFxk,t+hyτ,k,t+d-t-Ψk,where F
x
k
,
t
=
f
x
k
,
t
+
Δ
v
k. Choose a positive function of observer error as V
z
k
=
z
k
T
P
z
k; taking the time derivative of V
z
k yields(17)V˙zk=zkTATP+PAzk+2zkTPBFxk,t+hyτ,k,t+d-t-Ψk.Considering Assumption2 and utilizing Young’s inequality, we can have(18)2zkTPBhyτ,k,t≤2zkTPBhyτ,k,t≤nλzkTPPTzk+λ∑j=1nρj2yτj,kt,(19)2zkTPBd-t≤1λzkTPPTzk+λD02.To compensate for the time delay term, consider the following Lyapunov-Krasovskii functional:(20)VUkt=λ1-κ∑j=1n∫t-τjttρj2ykσdσ.Recalling Assumption1, differentiating (20) with respect to time leads to(21)V˙Ukt=λ1-κ∑j=1nρj2yk-λ∑j=1n1-τ˙jt1-κρj2yτj,k≤λ1-κ∑j=1nρj2yk-λ∑j=1nρj2yτj,k.Combining (17)–(19) and (21), it follows that(22)V˙zk+V˙Uk≤zkTATP+PA+n+1λzk+2zkTPBFxk,t-Ψk+λ1-κ∑j=1nρj2yk+λD02.To overcome the difficulty from unknown time-varying functionF
x
k
,
t, we utilize time-varying RBF NN to approximate F
x
k
,
t on the compact set Ω
=
x
k
⊂
R
n which is specified by(23)Fxk,t=W∗Ttϕxk+εxk,t,where the Gaussian basis function is given by ϕ
x
k
=
φ
i
x
k
,
φ
2
x
k
,
…
,
φ
l
x
k
T
∈
R
l with φ
i
x
k
=
exp
⁡
-
x
k
-
μ
i
2
/
σ
i
2, μ
i
∈
R
n and σ
i
∈
R, denoting the centers and widths, respectively. W
∗
t and ε
x
k
,
t are bounded by sup
t
∈
0
,
T
⁡
W
∗
t
≤
ε
W and sup
t
∈
0
,
T
⁡
ε
x
k
,
t
≤
ε
0. Consequently, we can determine that(24)Ψk=W^kTtϕx^k.Then we can have(25)2zkTPBFxk,t-Ψk=2zkTPBW∗Ttϕxk+εxk,t-W^kTϕx^k=2zkTPBW∗Ttϕxk-W∗Ttϕx^k+εxk,t+W∗Ttϕx^k-W^kTϕx^k=2zkTPBW∗Ttϕ~xk,x^k+εxk,t-W~kTϕx^k,where W
~
k
=
W
^
k
-
W
∗ denotes the estimation error, ϕ
~
x
k
,
x
^
k
=
ϕ
x
k
-
ϕ
x
^
k. ϕ
~
x
k
,
x
^
k is bounded by ϕ
~
T
x
k
,
x
^
k
ϕ
~
x
k
,
x
^
k
≤
4
l. Then by using Young’s inequality it is clear that(26)2zkTPBW∗Ttϕ~xk,x^k+εxk≤2λzkTPPTzk+4λlεW2+λε02.Substituting (25) and (26) back into (22) and applying (12) we have(27)V˙zk+V˙Uk≤zkTATP+PA+n+3λPPTzk-2zkTPBW~kTϕx^k+λ1-κ∑j=1nρj2yk+λD02+4λlεW2+λε02≤-zkTQzk-2zkTPBW~kTϕx^k+λ1-κ∑j=1nρj2yk+λD02+4λlεW2+λε02≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+λ1-κ∑j=1nρj2yk+λD02+4λlεW2+λε02.


### 3.2. Adaptive Neural Iterative Learning Controller Design

Define errorse
1
,
k
=
x
^
1
,
k
-
y
d, e
i
,
k
=
x
^
i
,
k
-
y
d
i
-
1, i
=
2
,
…
,
n
-
1, and e
n
,
k
=
x
^
n
,
k
-
y
d
n
-
1. Then we make the assumptions on initial errors.Assumption 11.
Identical initial condition is satisfied for original system (1) and observer (15); that is, z
i
,
k
0
=
0, i
=
1,2
,
…
,
n.Assumption 12.
Identical initial condition is not necessary fore
i
,
k; that is, the initial state errors e
i
,
k
0 at each iteration are not necessarily zero small and fixed but are assumed to be bounded.Define the filtered tracking error ase
s
k
=
Λ
T
1
e
k, where Λ
=
λ
1
,
λ
2
,
…
,
λ
n
-
1
T and λ
1
,
…
,
λ
n
-
1 are chosen such that the polynomial H
s
=
s
n
-
1
+
λ
n
-
1
s
n
-
2
+
⋯
+
λ
1 is a Hurwitz polynomial. It is obvious that if e
s
k approaches zero as k
→
∞, then e
k will converge to the origin asymptotically.Based on Assumption12, there exist known constants ε
i, such that e
i
,
k
(
0
)
≤
ε
i, i
=
1,2
,
…
,
n, for any k
∈
N. In order to overcome the uncertainty from initial tracking error, we define an auxiliary function [9, 10] as(28)sk=esk-ηtsat⁡eskηt,ηt=εe-Kt,where ε
=
Λ
T
1
ε
1
,
ε
2
,
…
,
ε
n
T, K
>
0. The saturation function sat
⁡
· is defined as(29)sat⁡eskηt=1,ifesk>ηt,eskηt,ifesk≤ηt,-1,ifesk<-ηt.Remark 13.
η
(
t
) is called time-varying boundary layer function. It is obvious that η
(
t
) decreases along time axis, which satisfies initial condition η
(
0
)
=
ε and 0
<
η
T
≤
η
t, for all t
∈
0
,
T. If s
k
(
t
) can converge to zero for all t
∈
0
,
T as k
→
∞, then e
s
k will be bounded by η
t.
According to initial condition, we can easily obtain(30)esk0=λ1e1,k0+λ2e2,k0+⋯+en,k0≤λ1e1,k0+λ2e2,k0+⋯+en,k0≤λ1ε1+λ2ε2+⋯+εn=η0which implies that s
k
0
=
e
s
k
0
-
η
0
e
s
k
0
/
η
0
=
0 is satisfied for any k
∈
N. For further use, we give the following equality:(31)sksat⁡eskηt=0,ifeskηt≤1sksgn⁡esk,ifeskηt>1=sksgn⁡sk=sk,where the sign function is defined as(32)sgn⁡·=1,if·>00,if·=0-1,if·<0.To continue the design procedure, we give the dynamic ofe
k as follows:(33)e˙i,k=ei+1,k+kiz1,k,i=1,…,n-1,e˙n,k=knz1,k+vk+W^kTϕx^k-ydn.Define a Lyapunov function as(34)Vsk=12sk2.Taking the derivative ofV
s
k with respect to time yields(35)V˙sk=sks˙k=ske˙sk-η˙t,ifesk>ηt0,ifesk≤ηtske˙sk+η˙t,ifesk<-ηt=ske˙sk-η˙tsgn⁡sk=sk∑j=1n-1λjej+1,k+λjkjz1,k+Kηtsgn⁡sk-ydn+knz1,k+W^kTϕx^k+vk=sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk-Ksk2,where we utilize the following relation:(36)sk-Kesk+Kηtsgn⁡sk=sk-Ksk-Kηtsat⁡eskηt+Kηtsgn⁡sk=-Ksk2-Kηtsk+Kηtsk=-Ksk2.Choose the Lyapunov candidate for the whole closed-loop system asV
k
=
V
z
k
+
V
U
k
+
V
s
k. Combining (27) and (35) we can obtain the derivative of V
k as follows:(37)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+λ1-κ·∑j=1nρj2yk+λD02+4λlεW2+λε02+sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk-Ksk2.For the convenience of expression, denoteΞ
y
k
≜
λ
/
1
-
κ
∑
j
=
1
n
ρ
j
2
y
k
+
λ
D
0
2
+
4
λ
l
ε
W
2
+
λ
ε
0
2; then (37) can be simplified as(38)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk+Ξyksk-Ksk2.However, note thatΞ
y
k
/
s
k is not well defined at s
k
=
0 and may lead to controller singularity problem if we use Ξ
y
k
/
s
k in the controller design. In order to overcome this problem, we exploit the following property.Lemma 14 (see [47]).
For any constantη
>
0 and any variable p
∈
R,(39)limp→0⁡tanh2⁡p/ηp=0.Employing the hyperbolic tangent function, (38) becomes(40)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk+btanh2⁡sk/ηtΞyksk+1-btanh2⁡skηtΞyk-Ksk2.From Lemma14, we know that lim
s
k
→
0
⁡
b
tanh
2
⁡
s
k
/
η
t
Ξ
(
y
k
)
/
s
k
=
0. Hence, b
tanh
2
⁡
s
k
/
η
t
Ξ
(
y
k
)
/
s
k is defined at s
k
=
0 and the problem of possible singularity is avoided. Apparently, λ
/
1
-
κ
∑
j
=
1
n
ρ
j
2
y
k is continuous and well-defined over compact set Ω
y
=
y
k
⊂
R, so it can be approximated by a time-invariant neural network to arbitrary accuracy as (
λ
/
1
-
κ
)
∑
j
=
1
n
ρ
j
2
y
k
=
W
Ξ
∗
T
ϕ
Ξ
y
k
+
ε
Ξ
y
k, where ε
Ξ
y
k
≤
ε
-
Ξ is the approximation error, W
Ξ
∗
∈
R
l
Ξ are unknown ideal time-invariant weight vector, and ϕ
Ξ
y
k
∈
R
l
Ξ is the basis functions, where l
Ξ denotes the NN node number. Also, we make the following finiteness assumption for W
Ξ
∗.Assumption 15.
The ideal weight vectorW
Ξ
∗ is bounded; that is,(41)WΞ∗≤εWΞ,where ε
W
Ξ is unknown positive constant.
ThenΞ
(
y
k
) can be expressed as(42)Ξyk=WΞ∗TϕΞyk+εΞyk+λD02+4λlεW2+λε02.
For convenience of presentation, denoteμ
≜
ε
Ξ
y
k
+
λ
D
0
2
+
4
λ
l
ε
W
2
+
λ
ε
0
2. Furthermore, we rewrite Ξ
(
y
k
) as Ξ
(
y
k
)
=
W
2
∗
T
ϕ
2
y
k, with W
2
∗
=
W
Ξ
∗
T
,
μ
T and ϕ
2
y
k
=
ϕ
Ξ
T
y
k
,
1
T.
Until now, we can design the output feedback controller as follows:(43)vk=-∑j=1n-1λjej+1,k-ΛT1K0z1,k-Kesk+ydn-W^kTtϕx^k-bW^2,kTϕ2yktanh2⁡sk/ηtsk,where W
^
k
t and W
^
2
,
k are the estimates of W
∗
t and W
2
∗, respectively.
The difference type and differential-difference type update algorithms are designed, respectively, forW
^
k
t and W
^
2
,
k as follows:(44)W^kt=W^k-1t+2q1zkTPBϕx^k,W^0t=0,t∈0,T,(45)1-γW^˙2,k=-γW^2,k+γW^2,k-1+q2btanh2⁡skηtϕ2yk,W^2,k0=W^2,k-1T,W^2,0t=0,t∈0,T,where q
1
,
q
2
>
0 and 0
<
γ
<
1 are design parameters.
Define the estimation errors asW
~
k
t
=
W
^
k
t
-
W
∗
t and W
~
2
,
k
=
W
^
2
,
k
-
W
2
,
k
∗. Then, substituting the controller (43) back into (40) yields(46)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k-bW~2,kTϕ2yktanh2⁡skηt+1-btanh2⁡skηtΞyk-Ksk2.For subsequent discussion, we rewrite (46) as(47)2zkTPBW~kTϕx^k+bW~2,kTϕ2yktanh2⁡skηt≤-V˙k-λmin⁡Qzk2+1-btanh2⁡skηtΞyk-Ksk2.
For further analysis, we exploit the following property of the tangent hyperbolic function.Lemma 16.
Consider the setΩ
s
k defined by Ω
s
k
≔
s
k
∣
s
k
≤
m
η
t. Then, for any s
k
∉
Ω
s
k, the following inequality is satisfied:(48)1-btanh2⁡skηt<0,where b
>
1, m
=
ln
⁡
b
/
b
-
1
+
1
/
b
-
1.Proof.
See AppendixA.The convergence and boundedness property of the proposed observer-based AILC scheme are summarized in the following theorem.Theorem 17.
Considering the closed-loop system consisting of plant (1) and input saturation model (3) under Assumptions 1–5, 11, 12 and 15, design state observer (15) and adaptive iterative learning controller (43) with parameter update algorithms (44) and (45); the following properties can be guaranteed: (i) all the signals of the closed-loop system are bounded in L
T
∞-norm; (ii) the error e
s
k
t converges to a small region around zero as k
→
∞; that is, lim
k
→
∞
⁡
∫
0
T
e
s
k
σ
2
d
σ
≤
ε
e
s
k, ε
e
s
k
=
(
1
/
2
K
)
1
+
m
2
ε
2; and (iii) transient performance lim
k
→
∞
⁡
y
k
t
-
y
d
t
≤
m
i
n
{
k
0
∑
i
=
1
n
-
1
ε
i
2
e
-
λ
0
t
+
1
+
m
ε
k
0
(
1
/
(
λ
0
-
K
)
)
(
e
-
K
t
-
e
-
λ
0
t
), p
1
+
1
/
k
1
K
p
1
+
p
2
ε
e
-
K
t
}, where λ
0, k
0, p
1, and p
2 are positive constants and will be given later.Proof.
See AppendixB.


## 3.1. Observer Design

Rewrite system (1) as(10)x˙k=Axk+K0yk+Bfxk,t+hyτ,k,t+βvk+d1vk+dtwith(11)Ko=k1,k2,…,knT,A=-k1-k2In-1⋮-kn0⋯0,B=0,…,0,1T,where I
n
-
1 is a unit square matrix with n
-
1 dimensions. K
0
∈
R
n can be selected such that A is a strict Hurwitz matrix. Thus, given a matrix Q
>
0, there exists P
>
0 satisfying the following inequality:(12)ATP+PA+n+3λPPT<-Q,where λ is a positive scalar.Remark 10.
In this paper, to solve inequality (12), we decompose A
=
A
-
+
K
0
B
- where(13)A-=0⋮In-10⋯0,B-=-1,0,…,0.Based on Lemma9, (12) is equivalent to the following LMI:(14)PA-+MB-+B-TMT+A-TP+QPP-λn+3In<0,where Q is a given positive definite matrix and I
n is a unit matrix. Furthermore, it should be noted that P, M, and λ can be computed simultaneously via MATLAB LMI toolbox, and the observer gain matrix is obtained by K
0
=
P
-
1
M.For simplicity, defined
-
t
=
d
1
v
k
+
d
t. Then it is obvious that d
-
t
≤
D
0 with D
0
=
D
1
+
D
2. To estimate the states of system (10), design the observer as(15)x^˙k=Ax^k+Koyk+BΨk+vk,y^k=x^1,k,where Ψ
k will be given later. For subsequent design, we define Δ
v
k
=
β
v
k
-
v
k which describes the effect of input saturation and can be effectively approximated by using a dynamic neural network.Definez
k
≜
z
1
,
k
,
z
2
,
k
,
…
,
z
n
,
k
=
x
k
-
x
^
k; then we can obtain the dynamic of observer error by subtracting (15) from (10):(16)z˙k=Azk+BFxk,t+hyτ,k,t+d-t-Ψk,where F
x
k
,
t
=
f
x
k
,
t
+
Δ
v
k. Choose a positive function of observer error as V
z
k
=
z
k
T
P
z
k; taking the time derivative of V
z
k yields(17)V˙zk=zkTATP+PAzk+2zkTPBFxk,t+hyτ,k,t+d-t-Ψk.Considering Assumption2 and utilizing Young’s inequality, we can have(18)2zkTPBhyτ,k,t≤2zkTPBhyτ,k,t≤nλzkTPPTzk+λ∑j=1nρj2yτj,kt,(19)2zkTPBd-t≤1λzkTPPTzk+λD02.To compensate for the time delay term, consider the following Lyapunov-Krasovskii functional:(20)VUkt=λ1-κ∑j=1n∫t-τjttρj2ykσdσ.Recalling Assumption1, differentiating (20) with respect to time leads to(21)V˙Ukt=λ1-κ∑j=1nρj2yk-λ∑j=1n1-τ˙jt1-κρj2yτj,k≤λ1-κ∑j=1nρj2yk-λ∑j=1nρj2yτj,k.Combining (17)–(19) and (21), it follows that(22)V˙zk+V˙Uk≤zkTATP+PA+n+1λzk+2zkTPBFxk,t-Ψk+λ1-κ∑j=1nρj2yk+λD02.To overcome the difficulty from unknown time-varying functionF
x
k
,
t, we utilize time-varying RBF NN to approximate F
x
k
,
t on the compact set Ω
=
x
k
⊂
R
n which is specified by(23)Fxk,t=W∗Ttϕxk+εxk,t,where the Gaussian basis function is given by ϕ
x
k
=
φ
i
x
k
,
φ
2
x
k
,
…
,
φ
l
x
k
T
∈
R
l with φ
i
x
k
=
exp
⁡
-
x
k
-
μ
i
2
/
σ
i
2, μ
i
∈
R
n and σ
i
∈
R, denoting the centers and widths, respectively. W
∗
t and ε
x
k
,
t are bounded by sup
t
∈
0
,
T
⁡
W
∗
t
≤
ε
W and sup
t
∈
0
,
T
⁡
ε
x
k
,
t
≤
ε
0. Consequently, we can determine that(24)Ψk=W^kTtϕx^k.Then we can have(25)2zkTPBFxk,t-Ψk=2zkTPBW∗Ttϕxk+εxk,t-W^kTϕx^k=2zkTPBW∗Ttϕxk-W∗Ttϕx^k+εxk,t+W∗Ttϕx^k-W^kTϕx^k=2zkTPBW∗Ttϕ~xk,x^k+εxk,t-W~kTϕx^k,where W
~
k
=
W
^
k
-
W
∗ denotes the estimation error, ϕ
~
x
k
,
x
^
k
=
ϕ
x
k
-
ϕ
x
^
k. ϕ
~
x
k
,
x
^
k is bounded by ϕ
~
T
x
k
,
x
^
k
ϕ
~
x
k
,
x
^
k
≤
4
l. Then by using Young’s inequality it is clear that(26)2zkTPBW∗Ttϕ~xk,x^k+εxk≤2λzkTPPTzk+4λlεW2+λε02.Substituting (25) and (26) back into (22) and applying (12) we have(27)V˙zk+V˙Uk≤zkTATP+PA+n+3λPPTzk-2zkTPBW~kTϕx^k+λ1-κ∑j=1nρj2yk+λD02+4λlεW2+λε02≤-zkTQzk-2zkTPBW~kTϕx^k+λ1-κ∑j=1nρj2yk+λD02+4λlεW2+λε02≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+λ1-κ∑j=1nρj2yk+λD02+4λlεW2+λε02.


## 3.2. Adaptive Neural Iterative Learning Controller Design

Define errorse
1
,
k
=
x
^
1
,
k
-
y
d, e
i
,
k
=
x
^
i
,
k
-
y
d
i
-
1, i
=
2
,
…
,
n
-
1, and e
n
,
k
=
x
^
n
,
k
-
y
d
n
-
1. Then we make the assumptions on initial errors.Assumption 11.
Identical initial condition is satisfied for original system (1) and observer (15); that is, z
i
,
k
0
=
0, i
=
1,2
,
…
,
n.Assumption 12.
Identical initial condition is not necessary fore
i
,
k; that is, the initial state errors e
i
,
k
0 at each iteration are not necessarily zero small and fixed but are assumed to be bounded.Define the filtered tracking error ase
s
k
=
Λ
T
1
e
k, where Λ
=
λ
1
,
λ
2
,
…
,
λ
n
-
1
T and λ
1
,
…
,
λ
n
-
1 are chosen such that the polynomial H
s
=
s
n
-
1
+
λ
n
-
1
s
n
-
2
+
⋯
+
λ
1 is a Hurwitz polynomial. It is obvious that if e
s
k approaches zero as k
→
∞, then e
k will converge to the origin asymptotically.Based on Assumption12, there exist known constants ε
i, such that e
i
,
k
(
0
)
≤
ε
i, i
=
1,2
,
…
,
n, for any k
∈
N. In order to overcome the uncertainty from initial tracking error, we define an auxiliary function [9, 10] as(28)sk=esk-ηtsat⁡eskηt,ηt=εe-Kt,where ε
=
Λ
T
1
ε
1
,
ε
2
,
…
,
ε
n
T, K
>
0. The saturation function sat
⁡
· is defined as(29)sat⁡eskηt=1,ifesk>ηt,eskηt,ifesk≤ηt,-1,ifesk<-ηt.Remark 13.
η
(
t
) is called time-varying boundary layer function. It is obvious that η
(
t
) decreases along time axis, which satisfies initial condition η
(
0
)
=
ε and 0
<
η
T
≤
η
t, for all t
∈
0
,
T. If s
k
(
t
) can converge to zero for all t
∈
0
,
T as k
→
∞, then e
s
k will be bounded by η
t.
According to initial condition, we can easily obtain(30)esk0=λ1e1,k0+λ2e2,k0+⋯+en,k0≤λ1e1,k0+λ2e2,k0+⋯+en,k0≤λ1ε1+λ2ε2+⋯+εn=η0which implies that s
k
0
=
e
s
k
0
-
η
0
e
s
k
0
/
η
0
=
0 is satisfied for any k
∈
N. For further use, we give the following equality:(31)sksat⁡eskηt=0,ifeskηt≤1sksgn⁡esk,ifeskηt>1=sksgn⁡sk=sk,where the sign function is defined as(32)sgn⁡·=1,if·>00,if·=0-1,if·<0.To continue the design procedure, we give the dynamic ofe
k as follows:(33)e˙i,k=ei+1,k+kiz1,k,i=1,…,n-1,e˙n,k=knz1,k+vk+W^kTϕx^k-ydn.Define a Lyapunov function as(34)Vsk=12sk2.Taking the derivative ofV
s
k with respect to time yields(35)V˙sk=sks˙k=ske˙sk-η˙t,ifesk>ηt0,ifesk≤ηtske˙sk+η˙t,ifesk<-ηt=ske˙sk-η˙tsgn⁡sk=sk∑j=1n-1λjej+1,k+λjkjz1,k+Kηtsgn⁡sk-ydn+knz1,k+W^kTϕx^k+vk=sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk-Ksk2,where we utilize the following relation:(36)sk-Kesk+Kηtsgn⁡sk=sk-Ksk-Kηtsat⁡eskηt+Kηtsgn⁡sk=-Ksk2-Kηtsk+Kηtsk=-Ksk2.Choose the Lyapunov candidate for the whole closed-loop system asV
k
=
V
z
k
+
V
U
k
+
V
s
k. Combining (27) and (35) we can obtain the derivative of V
k as follows:(37)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+λ1-κ·∑j=1nρj2yk+λD02+4λlεW2+λε02+sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk-Ksk2.For the convenience of expression, denoteΞ
y
k
≜
λ
/
1
-
κ
∑
j
=
1
n
ρ
j
2
y
k
+
λ
D
0
2
+
4
λ
l
ε
W
2
+
λ
ε
0
2; then (37) can be simplified as(38)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk+Ξyksk-Ksk2.However, note thatΞ
y
k
/
s
k is not well defined at s
k
=
0 and may lead to controller singularity problem if we use Ξ
y
k
/
s
k in the controller design. In order to overcome this problem, we exploit the following property.Lemma 14 (see [47]).
For any constantη
>
0 and any variable p
∈
R,(39)limp→0⁡tanh2⁡p/ηp=0.Employing the hyperbolic tangent function, (38) becomes(40)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k+sk∑j=1n-1λjej+1,k+ΛT1K0z1,k+Kesk-ydn+W^kTϕx^k+vk+btanh2⁡sk/ηtΞyksk+1-btanh2⁡skηtΞyk-Ksk2.From Lemma14, we know that lim
s
k
→
0
⁡
b
tanh
2
⁡
s
k
/
η
t
Ξ
(
y
k
)
/
s
k
=
0. Hence, b
tanh
2
⁡
s
k
/
η
t
Ξ
(
y
k
)
/
s
k is defined at s
k
=
0 and the problem of possible singularity is avoided. Apparently, λ
/
1
-
κ
∑
j
=
1
n
ρ
j
2
y
k is continuous and well-defined over compact set Ω
y
=
y
k
⊂
R, so it can be approximated by a time-invariant neural network to arbitrary accuracy as (
λ
/
1
-
κ
)
∑
j
=
1
n
ρ
j
2
y
k
=
W
Ξ
∗
T
ϕ
Ξ
y
k
+
ε
Ξ
y
k, where ε
Ξ
y
k
≤
ε
-
Ξ is the approximation error, W
Ξ
∗
∈
R
l
Ξ are unknown ideal time-invariant weight vector, and ϕ
Ξ
y
k
∈
R
l
Ξ is the basis functions, where l
Ξ denotes the NN node number. Also, we make the following finiteness assumption for W
Ξ
∗.Assumption 15.
The ideal weight vectorW
Ξ
∗ is bounded; that is,(41)WΞ∗≤εWΞ,where ε
W
Ξ is unknown positive constant.
ThenΞ
(
y
k
) can be expressed as(42)Ξyk=WΞ∗TϕΞyk+εΞyk+λD02+4λlεW2+λε02.
For convenience of presentation, denoteμ
≜
ε
Ξ
y
k
+
λ
D
0
2
+
4
λ
l
ε
W
2
+
λ
ε
0
2. Furthermore, we rewrite Ξ
(
y
k
) as Ξ
(
y
k
)
=
W
2
∗
T
ϕ
2
y
k, with W
2
∗
=
W
Ξ
∗
T
,
μ
T and ϕ
2
y
k
=
ϕ
Ξ
T
y
k
,
1
T.
Until now, we can design the output feedback controller as follows:(43)vk=-∑j=1n-1λjej+1,k-ΛT1K0z1,k-Kesk+ydn-W^kTtϕx^k-bW^2,kTϕ2yktanh2⁡sk/ηtsk,where W
^
k
t and W
^
2
,
k are the estimates of W
∗
t and W
2
∗, respectively.
The difference type and differential-difference type update algorithms are designed, respectively, forW
^
k
t and W
^
2
,
k as follows:(44)W^kt=W^k-1t+2q1zkTPBϕx^k,W^0t=0,t∈0,T,(45)1-γW^˙2,k=-γW^2,k+γW^2,k-1+q2btanh2⁡skηtϕ2yk,W^2,k0=W^2,k-1T,W^2,0t=0,t∈0,T,where q
1
,
q
2
>
0 and 0
<
γ
<
1 are design parameters.
Define the estimation errors asW
~
k
t
=
W
^
k
t
-
W
∗
t and W
~
2
,
k
=
W
^
2
,
k
-
W
2
,
k
∗. Then, substituting the controller (43) back into (40) yields(46)V˙k≤-λmin⁡Qzk2-2zkTPBW~kTϕx^k-bW~2,kTϕ2yktanh2⁡skηt+1-btanh2⁡skηtΞyk-Ksk2.For subsequent discussion, we rewrite (46) as(47)2zkTPBW~kTϕx^k+bW~2,kTϕ2yktanh2⁡skηt≤-V˙k-λmin⁡Qzk2+1-btanh2⁡skηtΞyk-Ksk2.
For further analysis, we exploit the following property of the tangent hyperbolic function.Lemma 16.
Consider the setΩ
s
k defined by Ω
s
k
≔
s
k
∣
s
k
≤
m
η
t. Then, for any s
k
∉
Ω
s
k, the following inequality is satisfied:(48)1-btanh2⁡skηt<0,where b
>
1, m
=
ln
⁡
b
/
b
-
1
+
1
/
b
-
1.Proof.
See AppendixA.The convergence and boundedness property of the proposed observer-based AILC scheme are summarized in the following theorem.Theorem 17.
Considering the closed-loop system consisting of plant (1) and input saturation model (3) under Assumptions 1–5, 11, 12 and 15, design state observer (15) and adaptive iterative learning controller (43) with parameter update algorithms (44) and (45); the following properties can be guaranteed: (i) all the signals of the closed-loop system are bounded in L
T
∞-norm; (ii) the error e
s
k
t converges to a small region around zero as k
→
∞; that is, lim
k
→
∞
⁡
∫
0
T
e
s
k
σ
2
d
σ
≤
ε
e
s
k, ε
e
s
k
=
(
1
/
2
K
)
1
+
m
2
ε
2; and (iii) transient performance lim
k
→
∞
⁡
y
k
t
-
y
d
t
≤
m
i
n
{
k
0
∑
i
=
1
n
-
1
ε
i
2
e
-
λ
0
t
+
1
+
m
ε
k
0
(
1
/
(
λ
0
-
K
)
)
(
e
-
K
t
-
e
-
λ
0
t
), p
1
+
1
/
k
1
K
p
1
+
p
2
ε
e
-
K
t
}, where λ
0, k
0, p
1, and p
2 are positive constants and will be given later.Proof.
See AppendixB.


## 4. Simulation Study

In this section, we present a simulation example to verify the effectiveness of proposed control scheme. Consider the following second-order nonlinear time delay system with input saturation:(49)x˙1,kt=x2,kt,x˙2,kt=fxkt,t+hxτ,kt,t+ukt+dt,ykt=x1,kt,where f
X
k
t
,
t
=
-
x
1
,
k
t
x
2
,
k
t
sin
⁡
x
1
,
k
t
x
2
,
k
tand h
y
τ
,
k
,
t
=
0.5
sin
⁡
t
e
-
cos
⁡
0.5
t
y
τ
1
sin
⁡
y
τ
1
+
y
τ
2
sin
⁡
y
τ
2, with τ
1
=
0.5
1
+
sin
⁡
0.3
t and τ
2
=
0.8
1
-
sin
⁡
0.5
t. The external disturbance is given by d
=
0.1
∗
rand
∗
sin
⁡
t, where rand presents Gaussian noise which takes a random value on 0,1. We choose Q
=
0.001
0
0
0.002. By using LMI toolbox, we can obtain K
0
=
3.2894,2.9764
T and P
=
0.4741
-
0.2848
-
0.2848
0.4741. Next, we give the simulation study in three cases.Case 1.
The desired trajectory is given byx
d
t
=
sin
⁡
t
,
cos
⁡
t
T. The systems run on 0,4
π repetitively. The design parameters are chosen as ε
1
=
ε
2
=
1, λ
=
2, K
=
2, γ
=
0.5, q
1
=
0.5, q
2
=
1, ε
=
λ
ε
1
+
ε
2
=
3, and u
M
=
1.3. The parameters for two NNs are chosen as l
=
30, μ
j
=
(
1
/
l
)
2
j
-
l
2,3
,
2,3
,
3, σ
j
=
1.5, j
=
1,2
,
…
,
l, and l
Ξ
=
15, μ
Ξ
j
=
(
2
/
l
Ξ
)
2
j
-
l
Ξ, σ
Ξ
j
=
1, j
=
1,2
,
…
,
l
Ξ. The upper bound of control input is u
M
=
1.3. Parts of the simulation results are shown in Figures 2–9. Figures 2 and 6 express the trajectories of the observer output and the desired reference signal of the first iteration and the tenth iteration, respectively; Figures 3 and 7 show the trajectories of x
1
,
k and x
^
1
,
k of the first iteration (k
=
1) and the tenth iteration (k
=
10), respectively; Figures 4 and 7 show the effects of input saturation. Obviously, these signals are bounded. Figures 8 and 9 show the convergence of ∫
0
T
z
1
,
k
2
t
d
t and ∫
0
T
s
k
2
t
d
t along the iteration axis, which indicates that the proposed approach achieves perfect tracking by iterative learning.Figure 2
Reference signaly
d on observer state x
^
1
,
k (k
=
1) in Case 1.Figure 3
x
1
,
k on x
^
1
,
k (k
=
1) in Case 1.Figure 4
Control outputu
k and input v
k (k
=
1) in Case 1.Figure 5
Reference signaly
d on observer state x
^
1
,
k (k
=
10) in Case 1.Figure 6
x
1
,
k on x
^
1
,
k (k
=
10) in Case 1.Figure 7
Control outputu
k and input v
k (k
=
10) in Case 1.Figure 8
∫
0
T
z
1
,
k
2
t
d
t versus the number of iterations in Case 1.Figure 9
∫
0
T
s
k
2
t
d
t versus the number of iterations in Case 1.Case 2.
To show the control performance for more complicated desired trajectory, we choose the desired trajectory asx
d
t
=
sin
⁡
t
+
sin
⁡
0.5
t
,
cos
⁡
t
+
0.5
cos
⁡
0.5
t
T. The system runs on 0,8
π repetitively. The design parameters are chosen as the same as Case 1. The control input is bounded by u
M
=
4. The systems run for ten times repeatedly. Parts of the simulation results are shown in Figures 10–17. Figures 10–12 show the results of the first iteration (k
=
1). It can be seen that the tracking performance of the first iteration is not so good. Figures 13–15 present the simulation results of the tenth iteration (k
=
10). Obviously, the tracking performance has been improved greatly compared with that of the first iteration, which can be also demonstrated by convergence of ∫
0
T
z
1
,
k
2
t
d
t and ∫
0
T
s
k
2
t
d
t along the iteration domain in Figures 16 and 17. The results indicate the validity of the proposed method for more complicated design trajectory.Figure 10
Reference signaly
d on observer state x
^
1
,
k (k
=
1) in Case 2.Figure 11
x
1
,
k on x
^
1
,
k (k
=
1) in Case 2.Figure 12
Control outputu
k and input v
k (k
=
1) in Case 2.Figure 13
Reference signaly
d on observer state x
^
1
,
k (k
=
10) in Case 2.Figure 14
x
1
,
k on x
^
1
,
k (k
=
10) in Case 2.Figure 15
Control outputu
k and input v
k (k
=
10) in Case 2.Figure 16
∫
0
T
z
1
,
k
2
t
d
t versus the number of iterations in Case 2.Figure 17
∫
0
T
s
k
2
t
d
t versus the number of iterations in Case 2.Case 3.
Finally, the contribution of the proposed observer-based AILC scheme is shown by comparing the proposed controller with traditional adaptive neural network controller [48]. The controller is the same, but the adaptive laws using σ-modification for adaptive laws of parameters are given by(50)W^˙=ΓWzkTPBϕx^k-δWW^,W^˙2=q2skϕ2yk-γW^2.
The design parameters are chosen asΓ
W
=
diag
⁡
0.2
,
…
,
0.2, δ
W
=
0.5, q
2
=
1, γ
=
0.5, and u
M
=
3.5. Since traditional adaptive NN controller runs in time domain, the notation k in this case does not have any practical meaning. Figures 18–20 provide simulation results. From the simulation results shown in Figures 18–20, it is obvious that the adaptive NN controller is unable to achieve perfect tracking performance and performs much worse than the proposed approach.
According to the simulation results, it is confirmed that the proposed AILC can guarantee fairly good control performance for uncertain nonlinear systems with unknown time-varying delays and control input saturation in the presence of external disturbance. Moreover, it is verified that our control scheme is more suitable than robust adaptive neural network control methods for finite time repeated problem.Figure 18
Reference signaly
d on observer state x
^
1 in Case 3.Figure 19
x
1 on x
^
1 in Case 3.Figure 20
Control outputu
k and input v
k in Case 3.


## 5. Conclusions

An adaptive iterative learning control scheme has been proposed for a class of nonlinear time-varying systems with unknown time-varying delays and input saturation running on a finite time interval repeatedly. An observer has been designed to estimate the states. The uncertainties from unknown time-varying delays have been compensated for by using appropriate Lyapunov-Krasovskii functional in the Lyapunov function candidate, such that control law is delay-independent. Both time-varying and time-invariant RBF neural networks are employed to deal with the systems uncertainties. Theoretical analysis by constructing Lyapunov-like CEF has shown that the proposed systematic design is able to guarantee the convergence of tracking errors to a small residual domain around the origin and the boundedness of all the closed-loop signals. Simulation results have been provided to show the effectiveness the proposed control scheme.



---

*Source: 645161-2015-08-20.xml*