# High-Order Feedback Iterative Learning Control Algorithm with Forgetting Factor

Authors: Hongbin Wang; Jian Dong; Yueling Wang
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

A novel iterative learning control (ILC) algorithm is proposed to produce output curves that pass close to the desired trajectory. The key advantage of the proposed algorithm is introducing forgetting factor, which is a function of the number of iterations. Due to the forgetting factor characteristic of ILC, the proposed scheme not only stabilizes the nonlinear system with uncertainties but also weakens interference on the tracking desired trajectory. Simulation examples are included to demonstrate feasibility and effectiveness of the proposed algorithm.


---

## Body

## 1. Introduction

Control schemes for tracking problems can be divided into two steps: trajectory planning and tracking control. In these schemes, the trajectory planner attempts to generate a desired trajectory, which is set in advance. Then, the controller, which is designed to track the desired trajectory, focuses on the system dynamics to generate a sequence of inputs. To improve the accuracy in trajectory tracking, various control schemes such as feedback control [1], robust control [2], and iterative learning control [3–5] have been developed. Iterative learning control (ILC) is a control methodology for tracking a desired trajectory in repetitive systems; those were widely applied in practical engineering such as robotics [6, 7], semiconductors [8], and chemical processes [9, 10]. The prime strategy of ILC algorithms is to refine the input from one trial in order to improve the performance of the system on the next trial.The algorithm based on ILC is further improved by combining with existing feedback controller, such as PID [11], ALINEA [12], model-free adaptive control [13], and other general feedback controls [14, 15]. These combinations can retain the functionality of existing feedback loop such as robustness and meanwhile enjoy the extra performance improvement from ILC. However, some ILC algorithm’s convergence process is slow. To make the system track expectations more quickly and precisely, a high-order feedback iterative learning control [16] is proposed. Although it is applied to the linear system, the algorithm itself is of great value. However, when the system exist uncertainty and nonrepetitive disturbance, the control methods often achieve poor effect in practical applications. In order to reduce the effects of disturbance throughout the iterative process, the paper introduces forgetting factor, which can filter the signal towards the direction of iteration.The contribution of this paper is a combination of the high-order feedback iterative learning control and forgetting factor. Through a new ILC algorithm, the perfect tracking control performance of the robot manipulators can be achieved in the repetitive nonlinear time-varying systems [17, 18] with uncertainty and disturbance [19, 20]. A rigorous proof based on the Lipschitz-like approach is given to guarantee the stability and convergence of nonlinear system.The remainder of this paper is organized as follows. The iterative learning control problem is described in a general setting in Section2. A designed controller is presented briefly in Section 3. A robust convergence analysis of tracking properties under the high-order feedback ILC controller with forgetting factor is performed in Section 4. Simulation results are given in Section 5. Finally, in Section 6, conclusions are drawn.


## 2. Problem Description

Now, let us consider the repetitive nonlinear time-varying systems with uncertainty and disturbance:(1)
x
˙
i
t
=
f
x
i
t
,
t
+
B
x
i
t
,
t
u
i
t
+
w
i
x
i
t
,
t
,
y
i
t
=
C
x
i
t
+
v
i
t
,where i and t are the iteration index and continuous time, respectively. u
i
(
t
)
∈
R
m is the control variable. x
i
(
t
)
∈
R
m is the state variable; y
i
(
t
)
∈
R
m is the output of the system at the ith trial. w
i
(
x
i
(
t
)
,
t
) and v
i
(
t
) are the uncertain item and disturbance term, respectively. C
∈
R
r
×
n is constant matrix. f
(
·
), B
(
·
), and w
(
·
) are nonlinear functions.Assumption 1.
Functionsf, B, and w are uniformly globally Lipschitz with respect to x on a compact set Ω
∈
R
m
×
R
m
×
1
,
T:(2)
f
x
i
+
1
t
,
t
-
f
x
i
t
,
t
≤
k
f
x
i
+
1
t
-
x
i
t
,
B
x
i
+
1
t
,
t
-
B
x
i
t
,
t
≤
k
B
x
i
+
1
t
-
x
i
t
,
w
x
i
+
1
t
,
t
-
w
x
i
t
,
t
≤
k
w
x
i
+
1
t
-
x
i
t
,where k
f, k
B, and k
w are the Lipschitz constants.Assumption 2.
Initial error of the system at theith trial satisfies this criterion:(3)
x
i
+
1
0
-
x
i
0
≤
b
x
0
,
∀
i
.
Let us make the definitions of norm to simplify formula:(4)
b
v
≜
s
u
p
t
∈
0
,
T
v
l
+
1
t
λ
,
b
C
≜
sup
⁡
C
λ
,
b
φ
≜
s
u
p
t
∈
0
,
T
φ
k
t
λ
,
b
B
≜
sup
∀
x
∈
R
n
⁡
s
u
p
t
∈
0
,
T
B
x
i
t
,
t
λ
,
∂
x
~
l
=
max
⁡
s
u
p
∂
x
l
+
1
λ
.
Let(5)
e
i
=
y
d
-
y
i
=
C
∂
x
i
-
v
i
,
e
˙
i
=
y
˙
d
-
y
˙
i
=
C
∂
x
˙
i
-
v
˙
i
,
B
i
≜
B
x
i
t
,
t
,
∂
u
i
t
≜
u
d
t
-
u
i
t
,
x
˙
d
t
=
f
x
d
t
,
t
+
B
x
d
t
,
t
u
d
t
+
w
x
d
t
,
t
≜
f
d
+
B
d
u
d
+
w
d
,
∂
x
i
t
≜
x
d
t
-
x
i
t
,
∂
f
i
t
≜
f
d
-
f
x
i
t
,
t
,
∂
B
i
t
≜
B
d
-
B
x
i
t
,
t
,
∂
w
i
t
≜
w
d
-
w
i
x
i
t
,
t
;we have(6)
∂
x
˙
i
=
x
˙
d
-
x
˙
i
=
f
d
+
B
d
u
d
+
w
d
-
f
x
i
t
,
t
+
B
x
i
t
,
t
u
i
t
+
w
x
i
t
,
t
=
∂
f
i
t
+
B
d
u
d
-
B
x
i
t
,
t
u
d
-
∂
u
i
t
+
∂
w
i
t
=
∂
f
i
t
+
∂
B
i
u
d
-
B
x
i
t
,
t
∂
u
i
t
+
∂
w
i
t
,where x
d, u
d, and y
d are the desired state, desired control input, and desired output of system and ≜ indicate a formula is defined as another formula.The high-order feedback iterative learning control algorithm with forgetting factor is applied to nonlinear time-varying systems. Asi
→
∞, the bound of tracking error converges to a small neighborhood of the origin. If ∂
x
i
(
0
)
λ and b
v tend to zero, the bound of tracking error asymptotically reaches zero, by ILC.Whenε
=
0, b
v
=
0, and ∂
x
i
(
0
)
λ
=
0, we obtain l
i
m
i
→
∞
∂
u
i
λ
=
0. If l
i
m
i
→
∞
∂
x
i
λ
=
0, we have l
i
m
i
→
∞
e
i
(
t
)
λ
=
l
i
m
i
→
∞
∂
y
i
λ
=
0. At any given bound of tracking error ε
∗, we can find a group parameters of φ
k and G
k to satisfy s
u
p
t
∈
0
,
T
e
i
t
λ
≤
ε
∗, with ∀
i
≥
M.


## 3. Designed Controller

To make further improvement on the tracking precision of system, we will find an ideal inputu
d by the method of iterative learning. And it can make the output of system close to the desired trajectory as far as possible. In this section, we will design an ILC to realize perfect tracking.Denote the output tracking errore
i
=
y
d
-
y
i, where y
d is the given desired output trajectory, which is a solution to system (1); that is, there exists a unique desired input u
d, such that when u
=
u
d, the system has a unique desired state x
d satisfying(7)
x
˙
d
t
=
f
x
d
t
,
t
+
B
x
d
t
,
t
u
d
t
+
w
x
d
t
,
t
≜
f
d
+
B
d
u
d
+
w
d
,
y
d
t
=
C
x
d
t
≜
C
x
d
.Starting from an arbitrary continuous initial control inputu
0, obtain the next control input u
1 and the subsequent series u
i
∣
i
=
2,3
,
… for system (1) by using a proper learning control updating law in such a way that when i
→
∞, y
i
→
y
d
±
ε
∗ in the presence of bounded uncertainty and disturbance.We propose high-order feedback iterative learning controller as follows. At theith ILC iteration, the control input u
i to system (1) satisfies(8)
u
i
+
1
t
=
u
i
+
1
s
t
,where u
i
+
1
s
(
t
) is from the feedback iterative learning controller. The high-order feedback iterative learning controller is assumed to be in the following general form. The ILC law which includes tracking error of N previous iterations is used; that is,(9)
u
i
+
1
s
t
=
u
i
t
+
∑
k
=
1
N
φ
k
t
e
l
+
1
t
,where i indicates the iteration number, l
=
i
-
k
+
1, N is the order of ILC law with N
≥
1, φ
k
(
t
) is the feedback gain matrix, and e
l
+
1
=
y
d
-
y
l
+
1.In the work, the forgetting factorβ is introduced to the designed controller. The factor β is used to make a tradeoff between perfect learning and robustness, which can increase the robustness of ILC against uncertainty, disturbance, initialization error, and fluctuation of system dynamics:(10)
β
i
=
H
-
i
,where i indicates the iteration number; we use β instead of β
i to simplify formula. 0
≤
β
<
1 is time-variant forgetting factor, which is based on its iterations. H is constant. If i
→
∞, then β
→
0.The high-order feedback ILC controller with forgetting factor is constructed as follows:(11)
u
i
+
1
t
=
β
u
0
t
+
1
-
β
u
i
t
+
∑
k
=
1
N
φ
k
t
e
l
+
1
t
,where i indicates the iteration number, l
=
i
-
k
+
1, N is the order of ILC law with N
≥
1, and β is time-variant forgetting factor. u
0
(
t
) is the initial value of input, φ
k
(
t
) is the feedback gain matrix, and e
l
+
1
=
y
d
-
y
l
+
1.


## 4. Convergence Analysis

From (1) and (11), we get(12)
∂
u
i
+
1
=
u
d
-
u
i
+
1
=
u
d
-
β
u
0
-
1
-
β
u
i
-
∑
k
=
1
N
φ
k
t
e
l
+
1
t
=
β
∂
u
0
-
1
-
β
∂
u
i
-
∑
k
=
1
N
φ
k
t
C
∂
x
l
+
1
-
v
l
+
1
=
1
-
β
∂
u
i
-
∑
k
=
1
N
φ
k
t
C
∂
x
l
+
1
+
∑
k
=
1
N
φ
k
t
v
l
+
1
+
β
∂
u
0
.Let us take norm on both sides of (12) yields and define b
u
d
≜
s
u
p
t
∈
0
,
T
u
d
(
t
)
λ. Using Assumptions 1 and 2 gives(13)
∂
u
i
+
1
λ
≤
∑
k
=
1
N
p
k
1
-
β
∂
u
l
λ
+
∑
k
=
1
N
b
c
b
φ
∂
x
~
l
λ
+
∑
k
=
1
N
b
v
b
φ
+
β
∂
u
0
λ
=
∑
k
=
1
N
p
k
1
-
β
∂
u
l
λ
+
ξ
0
∑
k
=
1
N
∂
x
~
l
λ
+
μ
0
,where μ
0
=
N
b
v
b
φ
+
β
∂
u
0
λ,ξ
0
=
b
c
b
φ, and∂
u
l
=
u
d
-
u
l; we have(14)
∂
x
~
i
λ
=
∂
x
~
i
0
+
∫
0
t
∂
x
~
˙
d
τ
λ
=
∂
x
~
i
0
+
∫
0
t
∂
f
i
t
+
∂
B
i
t
u
d
-
B
x
~
i
t
,
t
∂
u
i
t
+
∂
w
i
t
d
τ
λ
≤
b
x
0
+
∫
0
t
e
^
∂
x
~
i
λ
+
b
B
∂
u
i
λ
d
τwith e
^
≜
k
f
+
b
u
d
k
B
+
k
w. Taking norm, we can obtain(15)
∫
0
t
x
~
τ
λ
d
τ
λ
=
sup
t
∈
0
,
T
⁡
e
-
λ
t
∫
0
t
x
~
τ
λ
d
τ
=
sup
t
∈
0
,
T
⁡
e
-
λ
t
∫
0
t
x
~
τ
λ
e
-
λ
τ
e
-
λ
τ
d
τ
≤
x
~
τ
λ
sup
t
∈
0
,
T
⁡
e
-
λ
t
∫
v
t
e
λ
τ
d
τ
=
x
~
τ
λ
sup
t
∈
0
,
T
⁡
1
-
e
-
λ
t
λ
≤
x
~
τ
λ
○
λ
-
1with ○
λ
-
1
≜
1
-
e
-
λ
T
/
λ; we get ∂
x
~
i
λ
≤
b
x
0
+
e
^
○
λ
-
1
∂
x
~
i
λ
+
b
B
○
λ
-
1
∂
u
i
λ. This equation means(16)
∂
x
~
i
λ
≤
b
x
0
+
b
B
○
λ
-
1
∂
u
i
λ
1
-
e
^
○
λ
-
1
.Inserting (16) into (13) gives(17)
∂
u
i
+
1
λ
≤
∑
k
=
1
N
p
k
1
-
β
∂
u
l
λ
+
ξ
0
∑
k
=
1
N
∂
x
~
l
λ
+
μ
0
≤
∑
k
=
1
N
p
k
1
-
β
∂
u
l
λ
+
ξ
0
∑
k
=
1
N
b
x
0
+
b
B
○
λ
-
1
∂
u
l
λ
1
-
e
^
○
λ
-
1
+
μ
0
=
∑
k
=
1
N
ρ
k
∂
u
l
λ
+
ε
,where (18)
ρ
k
=
p
k
1
-
β
+
ξ
0
b
B
○
λ
-
1
1
-
e
^
○
λ
-
1
,
ε
=
ξ
0
∑
k
=
1
N
b
x
0
1
-
e
^
○
λ
-
1
+
μ
0
.Lemma 3.
Assume that there is a positive real sequencea
n
1
∞ and the condition a
n
≤
ρ
~
1
a
n
-
1
+
ρ
~
2
a
n
-
2
+
⋯
+
ρ
~
N
a
n
-
N
+
ε
~
,
(
n
=
N
+
1
,
N
+
2
,
…
)
;
ε
~
≥
0 is satisfied with ρ
~
i
≥
0
(
i
=
1,2
,
…
,
N
).Ifρ
~
≤
∑
i
=
1
N
ρ
~
i
<
1, then l
i
m
n
→
∞
a
n
≤
ε
~
/
1
-
ρ
~. By Lemma 3, we choose a sufficiently large constant λ such that the following inequality holds when conditions ρ
~
k
<
1 and ρ
~
=
∑
k
=
1
N
ρ
k
<
1 are satisfied:(19)
lim
i
→
∞
⁡
∂
u
i
λ
≤
ε
1
-
ρ
~
.Inserting∂
y
i
=
y
d
-
y
i
=
C
x
d
-
C
x
i
-
v
i
=
C
∂
x
i
-
v, we get ∂
y
i
λ
≤
b
c
∂
x
i
λ
+
b
v. Adding (16), (17), and (19), we get that the tracking error bound converges to a small neighborhood of the origin, as i goes to infinity. Meanwhile, the tracking error ∂
y
i
λ, initial state error ∂
x
i
(
0
)
λ, and the bound of output disturbance item b
v have a linear relationship. If ∂
x
i
(
0
)
λ and b
v tend to zero, the tracking error bound asymptotically reaches zero, by ILC.When conditionsb
v
=
0 and ∂
x
i
(
0
)
λ
=
0 are satisfied, from (17), we get ε
=
0 and from (19), we obtain l
i
m
i
→
∞
∂
u
i
λ
=
0. Then, (16) gives l
i
m
i
→
∞
∂
x
i
λ
=
0; we have l
i
m
i
→
∞
e
i
(
t
)
λ
=
l
i
m
i
→
∞
∂
y
i
λ
=
0. According to limit definition, at any bound of given tracking error ε
∗, we can choose a group parameter of φ
k and G
k in order to reach the conclusion of this theorem s
u
p
t
∈
0
,
T
e
i
t
λ
≤
ε
∗, with ∀
i
≥
M.


## 5. Simulation

To demonstrate the effectiveness of the proposed ILC algorithm, we consider a two-degree-of-freedom planar manipulator with revolute joints and use the most basic nonlinear strong coupling example. This paper deals with nonlinear dynamical system (20) by using simulation method:(20)
M
θ
i
θ
¨
i
+
C
θ
i
,
θ
˙
i
θ
˙
i
+
G
θ
i
+
f
θ
i
,
t
=
u
i
i
=
1,2
,
3
,
…
,where θ
i
∈
R
n is the vector of state variables, M
(
θ
i
)
∈
R
n
×
n is the inertia matrix, C
(
θ
i
,
θ
˙
i
)
θ
˙
i
∈
R
n is the vector of the Coriolis and centripetal torques, G
(
θ
i
)
∈
R
n is the gravitational term, f
θ
i
,
t
∈
R
n is interference terms, and u
i
∈
R
n is the vector of control input.Equation (20) can be rewritten. Let x
1
i
=
θ
i, x
2
i
=
θ
˙
i
=
x
˙
1
i; we get(21)
x
˙
1
i
=
x
2
i
,
x
˙
2
i
=
θ
¨
i
=
M
-
1
θ
i
u
i
-
C
θ
i
,
θ
˙
i
θ
˙
i
-
G
θ
i
-
f
θ
i
,
θ
˙
i
=
M
-
1
x
1
i
u
i
-
C
x
1
i
,
x
2
i
x
2
i
-
G
x
1
i
-
f
x
1
i
,
x
2
i
.LetX
i
=
x
1
i
,
x
2
i
T, y
i
=
X
i; (21) can be rewritten as(22)
X
˙
i
=
x
2
i
-
M
-
1
x
1
i
C
x
1
i
,
x
2
i
+
G
x
1
i
+
0
M
-
1
x
1
i
u
i
+
0
-
M
-
1
x
1
i
f
x
1
i
,
x
2
i
,
y
i
=
X
i
.Simulations are carried out on a planar directly driving two-joint robot. And the matrices for the robot arm in the state space are(23)
M
θ
i
=
a
b
cos
⁡
θ
2
i
-
θ
1
i
b
cos
⁡
θ
2
i
-
θ
1
i
c
,
C
θ
i
,
θ
˙
i
=
-
b
θ
˙
2
i
2
sin
⁡
θ
2
i
-
θ
1
i
-
b
θ
˙
2
i
2
sin
⁡
θ
2
i
-
θ
1
i
,where a, b, and c are three constants. a
=
5.76794 kg·m2, b
=
1.473 kg·m2, and c
=
1.76794 kg·m2.The expected output trail isθ
d
=
2.63
t
2.8
t
T. The interference term is f
(
t
)
=
cos
⁡
(
5
t
)
sin
⁡
(
5
t
)
T and the initial state is considered as(24)
x
0
=
0
2.81
0.18
3.12
T
.We choose a high-order feedback iterative learning control algorithm with forgetting factor:(25)
u
i
+
1
t
=
β
u
0
t
+
1
-
β
u
i
t
+
∑
k
=
1
N
φ
k
t
e
l
+
1
twith l
=
i
-
k
+
1.We choose a high-order feedback iterative learning control algorithm:(26)
u
i
+
1
t
=
u
i
t
+
∑
k
=
1
N
φ
k
t
e
l
+
1
twith l
=
i
-
k
+
1.Given to Lemma3, the data used in the simulation is chosen as (27)
β
=
8
-
i
,
u
0
=
0.1
0.1
,
N
=
3
,
φ
1
=
1.7
0
0
1.6
,
φ
2
=
0.85
0
0
0.65
,
φ
3
=
0.1
0
0
0.02
.After checking the convergence condition in Lemma3, we can obtain the following:The first algorithm is as follows:(28)
ρ
~
=
∑
k
=
1
N
ρ
k
=
∑
k
=
1
N
p
k
1
-
β
+
b
c
b
φ
b
B
○
λ
-
1
1
-
e
^
○
λ
-
1
=
0.54
<
1
.
The second algorithm is as follows:(29)
ρ
~
=
∑
k
=
1
N
ρ
k
=
∑
k
=
1
N
p
k
+
b
c
b
φ
b
B
○
λ
-
1
1
-
e
^
○
λ
-
1
=
0.68
<
1
.So, l
i
m
i
→
∞
∂
u
i
λ
≤
ε
/
1
-
ρ
~. Finally, at any bound of given tracking error ε
∗, we can reach the conclusion of this theorem s
u
p
t
∈
0
,
T
e
i
t
λ
≤
ε
∗, with ∀
i
≥
M.Simulation results are shown in Figures1, 2, and 3.Figure 1
Control input trajectories.
(a)
(b)
(c)
(d)Figure 2
Desired and actual position trajectories.
(a)
(b)
(c)
(d)Figure 3
Max absolute values of the tracking error.
(a)
(b)In Figure1, there is a small amplitude of control input in the ILC algorithm with forgetting factor. From Figure 2, we can see that a good tracking performance can be achieved using the high-order feedback ILC algorithm with forgetting factor, even in the conditions of uncertainty and nonrepetitive disturbance from iteration to iteration. That is attributed to the forgetting factor, which can weaken the disturbance. But for the traditional ILC algorithm without forgetting factor, there are large stable tracking errors.Figure3 shows the absolute maximum tracking error from iteration to iteration, although the error curve is not perfectly smooth due to the presence of uncertainty and disturbance. From this figure, we can see that the ILC algorithm with forgetting factor can obtain a very fast convergent rate and very small and monotonic decreased tracking errors. But for the classic ILC algorithm without forgetting factor, although high-order feedback controller is used, the tracking errors were unsatisfactory and more iterations were needed to obtain a relatively acceptable tracking performance. We can see that the tracking errors are still relatively large compared with approach 1. It demonstrated that the forgetting factor is more useful in terms of reducing tracking error and speeding up the convergence.x
i
(
0
)
-
x
d
(
0
)
≠
0 indicates that the system exist initialization errors. So the error of the last iteration cannot be close to zero; it only converges to a compact domain around zero.


## 6. Conclusions

A high-order feedback ILC algorithm with forgetting factor for a class of nonlinear systems with uncertain and nonrepetitive disturbance is introduced in this paper. The main contribution of this paper is adding a forgetting factor to the existing high-order feedback ILC method for nonlinear systems. A rigorous proof is given to show the effectiveness of the proposed algorithm and the asymptotic error convergence along the iteration axis. Simulation results demonstrate that the proposed algorithm has faster convergence speed, greatly reduced tracking error, and better performance in stability and robustness. The future work aims to apply the proposed algorithm to actual robot control and biochemical reactions process.



---

*Source: 826409-2015-10-22.xml*