Journal of Control Science and Engineering

Journal of Control Science and Engineering / 2014 / Article

Research Article | Open Access

Volume 2014 |Article ID 351568 |

Guang-Wei Xu, Cheng Shao, Yu Han, "Design of Iterative Learning Control Method with Global Convergence Property for Nonlinear Systems", Journal of Control Science and Engineering, vol. 2014, Article ID 351568, 5 pages, 2014.

Design of Iterative Learning Control Method with Global Convergence Property for Nonlinear Systems

Academic Editor: Zengqiang Chen
Received17 Apr 2014
Revised16 Jul 2014
Accepted15 Sep 2014
Published02 Oct 2014


We address an iterative learning control (ILC) method for overcoming initial value problem caused by local convergence methods. Introducing a feedback recursive form of tracking errors into iterative learning law, this algorithm can avoid a crude linear approximation to nonlinear plants to reach global convergence property. The algorithm’s structure is entirely illustrated. Under assumptions, it is guaranteed that tracking errors of the closed-loop system converge to zero. Besides, we discuss the roles of parameters in iterative learning law for algorithm realization, and a nonlinear case study is presented to demonstrate the effectiveness and tracking performance of the proposed algorithm.

1. Introduction

Iterative learning control (ILC) is a methodology for reducing errors from trial to trial for systems that operate repetitively. The objective of iterative learning control is to overcome the imperfect knowledge of system structure to improve tracking performance as few trials as possible. Since ILC issue is originally proposed by Arimoto et al. [1], applications of ILC can be widely found in industrial robot manipulator, chemical batch process, some medical equipment, manufacturing, and so forth [27].

The research of iterative learning control has been focusing on nonlinear systems. ILC algorithms based on optimization theory are effective methods to improve tracking performance of nonlinear systems. Xu and Tan [8] proposed Newton-type ILC scheme for nonlinear systems, and Du et al. [9] also provided Newton-type ILC scheme for known or identified continuous differential and monotonic system. Besides, Lin et al. [10] presented ILC algorithm based on Newton method for discrete nonlinear systems, and algorithm was implemented by decomposing nonlinear ILC problem into the sequence of linear time-varying ILC problems. Xu et al. [11] developed rank-one update to derive recurrent formula for approximating inverse matrix of Jacobian. Benefiting from usage of optimization theory, useful insights on performance improvement are presented in these articles. However, due to local or semilocal convergence properties, the difficult and important problem of finding an initial value close enough to the desired input so that error converges to zero remains. In fact, due to the unknown desired input in control process, it is rigorously hard to satisfy additional conditions of initial value. Therefore, convergence performance of methods mentioned above could have a greatly reduced quality.

This paper develops an iterative learning control method with global convergence property for nonlinear systems. We disclose the relationship between optimization and general ILC nonlinear scheme. Based on this relationship, iterative learning control issue can be reasonably transformed into seeking root for an equation. Defining a new learning gain related with two contiguous iterations, we address iterative learning law with recursive form of errors, and the proposed algorithm avoids a crude linear approximation to nonlinear systems to overcome initial value issue. Giving algorithm’s structure entirely, we theoretically guarantee global convergence property of this algorithm. Afterwards, the importance of learning gain and parameter is discussed. A nonlinear case study is given to demonstrate the effectiveness and tracking performance of the proposed algorithm.

The remainder of this paper is organized as follows. In Section 2, a focused nonlinear ILC problem is considered. In Section 3, an iterative leaning law with recursive form of errors is proposed. Afterwards, algorithm’s structure is given entirely. In Section 4, under our assumptions, theoretical analysis is derived to ensure global convergence. We discuss the roles of parameter and learning gain for algorithm realization. In Section 5, simulation example is presented to demonstrate the effectiveness of the proposed algorithm. Finally, conclusions are given in Section 6.

2. Problem Statement

The class of stable continuous-time nonlinear systems is considered: where is control input and is system output at the th trial with . Besides, denotes system state. In addition, a reference signal is given. Suppose is sample period and time interval is partitioned in equal division; that is, . Therefore, is redefined in the vector form as well as system state and output, respectively, In sampled system, corresponding to , also need to be set piecewise, or rather

The tracking error at the th trial is defined as , and then we could rewrite it in the vector form

The control input at the next trial can be constructed by using effectiveness of previous inputs and errors, such as the typical ILC scheme with learning gain . Under iterative learning law, algorithm can reach convergence in the sense that where is the desired reference input and denotes the Euclidean norm; that is, . The inner product in both input space and output space is defined such that .

Then, sampled nonlinear system (1) in ILC context can be stated as a mapping where and , respectively, denote the piecewise input and the corresponding sampled system output. In mathematics context, the problem is described that, for a given desired output , it is to find the desired input control to satisfy functional equation Let , and then iterative learning control scheme can be transformed into seeking root for functional equation where is a nonlinear operator, and it is obviously shown that .

3. Design of Iterative Learning Control Method

Aiming at studying the effective global scheme for nonlinear ILC issue, we solve nonlinear equation (9) by the following iterative learning law with memoryless iterative process: where is the iteration-varying learning gain, served as the role of a dynamical controller. The learning gain satisfies with . Constants, and , play the role of constraining choice range of learning gain to avoid its value fluctuation. It is noted that and do not need to adjust values for every iteration.

Besides, we define by the following recursive form: where is a scalar with our new formula

For , applying (13) and (14), we can obtain that Therefore, formula (14) of scalar can be rewritten as It shows that is a link between the current iteration and the last iteration information. Value of describes the ratio of two contiguous . This formula is very important for subsequent convergence analysis. Now we can define the improved algorithm for nonlinear systems as follows.

Algorithm 1 (a new ILC method).

Step 1. Input any initial , and compute , , .

Step 2. Compute a satisfying (11) and (12).

Step 3. Let . If , then stop.

Step 4. Choose satisfied (14) and generate by (13),

set , and go to Step 2.

Remark 2. If tracking error achieves zero, will be singular, and then it is noted that the algorithm can be convergent and an improved ILC scheme can be reached.

4. Convergence of ILC Method

In this section, we turn our attention to establishing a convergence theorem for this ILC algorithm.

4.1. Convergence Analysis

The following conditions for nonlinear system are assumed.

Assumption 3. (i) The level set of control inputs , denoted by , is bounded.
(ii) System function is continuously differentiable and satisfies Lipschitz continuous condition; that is, there exists a constant such that for all .
In fact, these assumptions are reasonable for actual control process. Imply that the error generated by algorithm is bounded; that is, there is a constant such that In addition, Lipschitz continuous condition implies that error is also Lipschitz continuous.
Under Assumption 3, we present a useful lemma.

Lemma 4. Suppose that Assumption 3 holds, and consider iterative learning law (10) where learning gain satisfies conditions (11) and (12). Then,

Proof. From (11) we have Applying Lipschitz continuous condition (17) and iterative learning law (10), the following estimate is given: Then it is immediately obtained that which with (12) shows that Summing the above inequalities with , and using the bound (18), we can obtain that (19) is proved.

Note that it is necessary and important to discuss the convergence of infinite series including , because recursive formula (13) can be also regarded as the sum of errors when iteration approaches infinity. And it ensures that the errors can be convergent to zero. Above all, convergence theorem is provided.

Theorem 5. Consider system (1) with learning control law (10), and suppose that is an initial input for which Assumption 3 holds. Then errors generated by Algorithm 1 converge to zero in the sense that

Proof. From (13) for , we can obtain Squaring both sides of the above equation, we have Then, divide both sides by and apply (16) as follows: Due to , it is shown from the above inequality that for all . The algorithm does not converge after finite many iterations; that is, there exists some such that for all . This implies, by (28), that which implies that It is concluded by noting that (30) and (19) in Lemma 4 are contradictory.

The proposed ILC method could enjoy the advantage of global convergence and solve the problem of the initial value close enough to the unknown desired input.

4.2. Discussion

It is shown in the previous subsection that this ILC method could reach convergence under Assumption 3. Now it is worth noting the role of . From condition (11), we can obtain that Applying formula (14) and (16), we have due to , and the above equation can be rewritten as From (32), for , the above inequality can establish the following relationship:

This indicates that and could influence the convergence speed of our algorithm. As is known in the previous section, is a key for constructing iteration learning law. in our definition could reflect the sufficient descent property if holds.

Subsequently, the choice of learning gain is considered. could be achieved by satisfying (11) and (12), which are a group of good guide for identifying a value . It is noted that constants actually play the role of bound on . And can be considered as a factor impacting on the rate of convergence by inequality (11). If is too small, error at the next trial could decline so fast that it is difficult to find a proper learning gain . Therefore, a large value between 0 and 1 for could remain more space for the choice of .

5. Simulation Example

In this section, simulation example is presented to demonstrate the effectiveness of the proposed ILC method. The following system is the same as the first example in [10]. State space model of the objective plant is where is a coefficient related to the above plant’s nonlinearity. Larger value of denotes more serious nonlinearity of the plant.

The reference output signal is

Set the initial condition of state as . The proposed ILC method is then applied to the above nonlinear ILC problem. For theoretical analysis on global convergence property, now we examine that the simulation results correspond with the previous analysis.

The performance comparison of the proposed ILC method and Newton method based ILC [10] on magnitude of nonlinearity is shown in Figure 1. The initial input value is set as . Due to numerical noise generated by normal errors implicit in simulation, algorithm ends when errors converge to around . Figure 1 shows simulation results of the proposed ILC method by solid line and Newton method based ILC denoted by dash-dotted line at the beginning of initial value . In the light of Figure 1, Newton method based ILC with local convergence reaches convergence in 12 iterations, while it shows that tracking errors of the proposed algorithm drop to until 15 iterations. Once the control input becomes close enough to the desired one, Newton method based ILC converges to the tolerance range in a much faster speed.

However, due to the unknown desired input, it is hard to get an ideal initial value close enough to the desired input without any additional requirement. As usual, the performances of algorithms vary with different initial inputs. If initial value of input is far from the desired one, a very large tracking error may be generated, and even divergence could happen. Therefore, an ILC method with global convergence property becomes a feasible alternative scheme for overcoming this problem.

To clarify the importance of initial control input, take the case with , when the system’s nonlinearity is severe. As shown in Figure 2, the proposed ILC method is convergent until the 18th trial, while Newton method based ILC cannot converge due to the initial value that is far from the desired input. Then, it is worth receiving robustness for different initial values at the cost of convergence speed.

The above results indicate that the proposed ILC method can converge even in the presence of different initial values. Although convergence speed of the proposed ILC method slows down with the system’s nonlinearity getting severe, it overcomes the limitation of divergence for local convergence algorithms when initial values are far from the unknown desired input.

6. Conclusions

This paper has proposed an iterative learning control method to avoid initial value issue caused by local convergence algorithms. The chief idea behind this algorithm is to construct iterative learning law with feedback recursive formula of tracking errors. Aiming to satisfy the global convergence performance, a proper learning gain is the key part in this formula, and the definition of learning gain is given. The problem of initial value close to unknown desired input is removed by this improvement in theoretical circumstance. Afterwards, under our assumptions, convergence proof of this algorithm is derived, and the proposed algorithm ensures that tracking errors of closed-loop system uniformly converge to zero. Besides, we discuss the role of learning gain for algorithm realization. Finally, a nonlinear case study is given to demonstrate the effectiveness of this ILC algorithm. In the future, interesting questions could include the possibility of uncertainty for plant and robustness issue.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.


This work is supported by the National Natural Science Foundation of China (61074020).


  1. S. Arimoto, S. Kawamyra, and F. Miyazaki, “Bettering operation of robots by learning,” Journal of Robotic Systems, vol. 1, no. 2, pp. 123–140, 1984. View at: Google Scholar
  2. R. Chi, M. Li, Z. Hou, X. Liu, and Z. Yu, “Freeway traffic density and on-ramp queue control via ILC approach,” Mathematical Problems in Engineering, vol. 2014, Article ID 321934, 8 pages, 2014. View at: Publisher Site | Google Scholar | MathSciNet
  3. C. Shao, F.-R. Gao, and Y. Yang, “Robust stability of optimal iterative learning control and application to injection molding machine,” Acta Automatica Sinica, vol. 29, no. 1, pp. 72–79, 2003 (Chinese). View at: Google Scholar | MathSciNet
  4. Y.-C. Wang and C.-J. Chien, “An output-recurrent-neural-network-based iterative learning control for unknown nonlinear dynamic plants,” Journal of Control Science and Engineering, vol. 2012, Article ID 545731, 9 pages, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  5. C. Liu, J. Xu, and J. Wu, “Iterative learning control for remote control systems with communication delay and data dropout,” Mathematical Problems in Engineering, vol. 2012, Article ID 705474, 14 pages, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  6. C. Liu, R. Xiong, J. Xu, and J. Wu, “On iterative learning control for remote control systems with packet losses,” Journal of Applied Mathematics, vol. 2013, Article ID 245372, 9 pages, 2013. View at: Publisher Site | Google Scholar | MathSciNet
  7. G. Xu and C. Shao, “The new iterative learning control algorithm based on vector rotation for discrete time systems,” ICIC Express Letters, vol. 5, no. 7, pp. 2111–2117, 2011. View at: Google Scholar
  8. J. Xu and Y. Tan, Linear and Nonlinear Iterative Learning Control, Springer, New York, NY, USA, 2003. View at: MathSciNet
  9. H. Du, M. Hu, J. Xie, and S.-F. Ling, “Control of an electrostrictive actuator using Newton's method,” Precision Engineering, vol. 29, no. 3, pp. 375–380, 2005. View at: Publisher Site | Google Scholar
  10. T. Lin, D. H. Owens, and J. Hätönen, “Newton-method based iterative learning control for discrete non-linear systems,” International Journal of Control, vol. 79, no. 10, pp. 1263–1276, 2006. View at: Publisher Site | Google Scholar | MathSciNet
  11. G. Xu, C. Shao, Y. Han, and K. Yim, “New quasi-Newton iterative learning control scheme based on rank-one update for nonlinear systems,” The Journal of Supercomputing, vol. 67, no. 3, pp. 653–670, 2014. View at: Publisher Site | Google Scholar

Copyright © 2014 Guang-Wei Xu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.