## Discrete Dynamics of Fractional Systems: Theory and Numerical Techniques

View this Special IssueResearch Article | Open Access

Lei Li, "Lebesgue-*p* Norm Convergence Analysis of PD^{α}-Type Iterative Learning Control for Fractional-Order Nonlinear Systems", *Discrete Dynamics in Nature and Society*, vol. 2018, Article ID 5157267, 10 pages, 2018. https://doi.org/10.1155/2018/5157267

# Lebesgue-*p* Norm Convergence Analysis of PD^{α}-Type Iterative Learning Control for Fractional-Order Nonlinear Systems

**Academic Editor:**Qin Sheng

#### Abstract

The first-order and second-order PD^{α}-type iterative learning control (ILC) schemes are considered for a class of Caputo-type fractional-order nonlinear systems. Due to the imperfection of the -norm, the Lebesgue-*p* () norm is adopted to overcome the disadvantage. First, a generalization of the Gronwall integral inequality with singularity is established. Next, according to the reached generalized Gronwall integral inequality and the generalized Young inequality, the monotonic convergence of the first-order PD^{α}-type ILC is investigated, while the convergence of the second-order PD^{α}-type ILC is analyzed. The resultant condition shows that both the learning gains and the system dynamics affect the convergence. Finally, numerical simulations are exploited to verify the results.

#### 1. Introduction

Iterative learning control (ILC) is an effective control developed for target trajectory tracking [1]. The key feature of the ILC is to improve the quality of control iteratively by using proportional, integral, and/or derivative tracking errors obtained from previous operation and finally to generate the control input that causes the desired output trajectory. Due to its satisfactory tracking performance by using less a prior knowledge, ILC has been widely applied to repetitive operations including robot manipulations and batch processes [2–4].

Fractional calculus is a mathematical topic with more than three-hundred-year-old history, but its application to physics and engineering has attracted a lot of attention in the latest decades [5, 6]. They have been verified to be a powerful technique to model the memory and hereditary properties of many materials and processes [7–9]. Further, it has been acknowledged that a fractional-order controller performs well compared to an integer-order controller for a fractional-order system. This pushes the development of the fractional-order controllers [10, 11].

Among different fractional-order controllers, fractional-order iterative learning control (FOILC) is becoming one of active research areas. In the 2010s, for an -order linear system, the authors investigated the -order derivative-type (-type) ILC in time domain [12]. This investigation showed that the optimal ILC for an -order linear system is the ILC order being . In the following years, many FOILC problems are presented for various fractional-order systems. Up to now, the FOILC area has attracted much attention, of which the convergence analysis is one of key issues. For more details, readers can refer to the works [13–19] and the references therein. Despite the nice results of existing investigations, there still remain some undesirable problems between the theoretical development and its practical application.

The first one is that many nice results are derived under a questionable assumption that the desired control input exists [20–22]. However, from the engineering application perspective, the desired output trajectory should be predetermined by the target to be tracked, rather than constructed under the assumption that the desired control input existed. That is, the convergence analysis process relies on the information that seems to be known but is actually unknown to the desired control input.

The second one is that the existing FOILC investigations analyzed the convergence by using -norm-based analytical methods, and the convergence is guaranteed with the sufficiently large . As commented in [23, 24], the larger parameter may greatly inhibit the actual tracking error and ignore the influence of the state matrix and proportional learning gains to the condition. This conveys that the results of both the ILCs and FOILCs are mathematically good, but practically, it may result in the normal tracking error exceeding the practical tolerance even though the -norm tracking error is satisfactory. Thus, both the existing ILCs and FOILCs need to be refined. For this aspect, reference [25] has adopted -norm to evaluate the tracking error and has derived the monotonic convergence of the conventional first-order PD-type ILC for a class of integer-order linear systems. The derivation tells that the convergence is not only dominated by the system input and output matrices and the derivative learning gain, but also by the system state matrix and the proportional learning gain. The result reflects the relationship between the system dynamics and the learning mechanism to the convergence. To be specific, as -norm measures the tracking error in the concept of energy, the convergence result in the sense of -norm may boost the theoretical development near to practical execution. However, the result of the FOILC is a hanging issue. It is necessary to state that the integer derivative is a local operator, while the fractional derivative is a nonlocal operator which has many different properties; thus many theoretical approaches based on the integer-order control systems cannot have been directly applied to the fractional ones. Therefore, it is worthwhile to apply the -norm for convergence analysis of existing FOILCs.

In addition, as discussed in FOILCs [12, 15–17], the higher-order learning algorithms, which employ preceding control information of more than one iteration, have utility to lead a better performance in terms of both convergence rate and robustness, which is taken advantage of. As a matter of fact, with different choice of learning gains, the higher-order classical ILC algorithm can be perform slower and faster than or equivalent to the lower-order ones in terms of convergence rate [25]. However, such affirmation has not been seen valid for fractional-order iterative learning control systems.

Motivated by the aforementioned hanging issue regarding the fractional-order systems and FOILC schemes, this paper develops the first-order and the second-order proportional-Caputo-fractional-order-derivative-type (PD^{α}-type) ILCs for a class of Caputo-type fractional-order nonlinear dynamic systems and then applies the *-*norm to investigate their convergence in an objective manner. The main contributions of this paper are that we establish a theoretical analysis framework on the monotonic convergence of the first-order PD^{α}-type ILC for a Caputo-type fractional-order nonlinear system in the sense of -norm. In the theoretical analysis, there is no need for the questionable assumption that the desired input exists and a novel Growall integral inequality with singularity is established for the strict convergence analysis. And then, the convergence is derived for the case when the second-order PD^{α}-type is implemented on the systems and the convergent speed comparison of the second-order law with the first-order one is generalized to FOILCs.

The rest of the paper is organized as follows. In Section 2, the basic concepts, properties, and lemmas are described. In Section 3, the monotonic convergence of the first-order PD^{α}-type ILC scheme and the convergence of the second-order PD^{α}-type ILC are given. In Section 4, examples are presented to validate the theoretical results. Finally, some conclusions are drawn in Section 5.

#### 2. Preliminaries

In this section, we briefly give some basic definitions and properties related to fractional calculus [5, 6].

*Definition 1. *For an arbitrary integrable function , the definition of the fractional integrals of order is defined aswhere is the Gamma function and .

*Definition 2. *For a given number , the - Caputo-type derivative of the function is defined aswhere is an integer and .

*Property 3. *If , then .

*Definition 4. *The Mittag-Leffler function is defined aswhere and .

*Definition 5 (see [26]). *For a given scalar function , its -norm is defined as For a time-varying vector function , its -norm is defined as

Lemma 6 (see [27]). *If the function , then the initial value problem, is equivalent to the following nonlinear Volterra integral equation: and its solutions are continuous.*

For brevity, we set in the following section.

Lemma 7 (generalized Young inequality of convolution integral [26]). *For Lebesgue integrable scalar functions , the generalized Young inequality of their convolution integral is where satisfy . Particularly, when and thus , then the inequality of convolution integral is*

Lemma 8 (see [2]). *Let be a positive real sequence defined as If are nonnegative numbers satisfyingthen the following holds:*

Let us establish an extended Gronwall integral inequality with singularity, which is important to the convergence analysis in the next section. The proof is based on an iteration argument.

Lemma 9. *Suppose (constant) and and are nonnegative and locally integrable on . If Thenwhere *

*Proof. *See Appendix.

#### 3. PD^{α}-Type ILCs and Convergence Analysis for Fractional-Order Nonlinear Systems

Consider the following nonlinear - () systems:where refers to the operation number and is an operation time interval while . and denote* n*-dimensional state vector, scalar control input, and output, respectively. and are matrices with appropriate dimensions. The function satisfies the global Lipschitz condition:where is positive Lipschitz constant.

In this section, the sufficient conditions are derived for convergence of the first-order and second-order PD^{α}**-**type ILC algorithms for fractional-order nonlinear systems. Now, we give our main results.

#### 4. Monotonic Convergence Analysis for First-Order PD^{α}-Type ILC

To control the systems stated in (15), the first-order PD^{α}-type ILC is given as follows: Here, and are the first-order proportional and fractional-order derivative learning gains, respectively. The expression denotes the tracking error between the desired trajectory and the system output of the system (15) driven by at the iteration.

Theorem 10. *For the first-order PD ^{α}-type iterative learning control rue is applied to system (15), if the system matrices , , the order and the Lipchitz constant together with learning gains , satisfy the following condition:Here, stands for the absolute value and stands for the -norm of the function defined on the operation time interval .*

*Then, the output error is strictly monotonic convergence in -norm; that is,*(1)

*;*(2)

*.*

*Proof. *For the dynamic system (15) and the PD^{α}-type ILC scheme , from Lemma 6, we have and, then, we getApplying Property 3 to the last term on the right side of (20), we haveTaking absolution on both sides of (21) yieldsApplying Lipschitz condition to the second term on the right side of (22), we getTaking (23) into (22) obtainsUsing Lemma 9 to inequality (24), we haveTaking the -norm on both sides of (25) and adopting the generalized Young inequality of convolution integral, we getThis completes the proof of Theorem 10.

*Remark 11. *We can see, from the above derivation, that the convergence condition is quantified directly from the -norm, not by using the sufficiently large , and analyzed in terms of the tracking error rather than the control input error. Besides, the monotonic property of convergence can ensure the first-order PD^{α}-type ILC rule to be practically implementable. Further, from condition (18), we can observe that the convergence is affected not only by the derivative learning gain and the system dynamics, but also by the proportional learning gain. That is, the result reflects the features of system dynamics and the mechanism of the algorithm to the convergence. Actually, the impact of the state dynamics and proportional learning gain, which are neglected in the existing FOILC investigations, exists but is significantly suppressed by the sufficiently large parameter . It should be noted that, as mentioned in [23], a large value of may have a huge tracking error, which is not allowable in practice.

*Remark 12. *Note that the convergence analysis for fractional-order linear time-invariant system has been investigated in my early work [28], in which the derivation is made by means of the state transition matrix in an equality form, and the convergence condition is where is the system matrix and is the state transition matrix. However, in this paper, the investigated fractional-order system is nonlinear with its nonlinearity unknown; the proof of convergence is derived by means of inequality Lemma 9. Thus, the convergence condition cannot degenerate to the condition when the fractional-order nonlinear system is reduced to the corresponding linear case.

##### 4.1. Convergence Analysis for Second-Order PD^{α}-Type ILC

In this section, we go on considering the second-order PD^{α}-type ILC algorithm, which is constructed by employing the control inputs and their output errors of the latest previously adjacent operations in a weighting average form as follows: Here, and denote the second-order proportional and fractional-order derivative learning gains, respectively. The weighting coefficients and satisfy , , and .

Theorem 13. *For the second-order PD ^{α}-type iterative learning control rule is applied to system (15), if the system matrices , , the order , and the Lipchitz constant together with the learning gains , , , satisfy the following conditions:*(1)

*.*(2)

*Then, the learning scheme is convergent, that is, .*

*Proof. *From the dynamic system (15) and the PD^{α}-type ILC scheme , we haveApplying Property 3 to the last term on the right side of (29) yieldsSubmitting (30) into (29) and taking absolute values on both sides of (29) obtainUsing Lemma 9 to equality (31) derives thatAdopting the -norm on both sides of (32) implies thatand, then, according to Lemma 8 and assumptions and , it is therefore finally evident that .

*Remark 14. *It can be observed that when , the second-order PD^{α}-type ILC updating law degenerates to the first-order PD^{α}-type ILC updating law . Then the convergence becomes

Corollary 15. *Assume that exists. Analogous to the discussion regarding the convergent speed in [25], we can make assertions as follows:*(1)*If , then the second-order algorithm is -faster than the first-order .*(2)*If , then the scheme is -equivalent to the scheme .*(3)*If , then the second-order strategy is -slower than the first-order .*

*Remark 16. *From the view point of speed, comparing and of Corollary 15, we can conclude that if we choose a suitable learning gains, the second-order updating law may not be a preferred candidate for the systems. However, if we pursue more freedom in choosing the learning gains and better robustness to noise, the second-order updating law is a useful alternative.

#### 5. Simulation Illustrations

In this simulation, we consider the following fractional-order nonlinear system:

The operation time period is , the desired trajectory is , and the initial control is .

For the first-order -type ILC scheme , the first-order proportional and fractional-order derivative learning gains are chosen as and , respectively. It can be seen and ; then it is easy to verify that , which means that the monotonic convergence condition (18) is satisfied. The outputs by the scheme at the 2nd, 3rd, and 4th operations are shown in Figure 1, respectively. The monotonic tracking error in the sense of -norm is shown in Figure 2.

For the second-order -type ILC , we consider two cases as follows.

*Case 1. *In schemes and ), the first-order learning gains are set as and , respectively. In scheme , the weighting coefficients are assigned as and , and the second-order learning gains are selected as and , respectively. It is computed that and , which is included in the case that . It shows that the output error of convergence is faster than that of . The corresponding outputs by scheme at the 3rd, 5th, and 7th operations are displayed in Figure 3. It shows that the output follows the desired trajectory well as the iteration increases. The comparison of the tracking error in the sense of -norm made by the updating laws and is shown in Figure 4. It shows that the tracking errors of both the first-order and second-order laws are convergent and the first-order law is convergence faster than second-order law .

*Case 2. *In schemes and (, the first-order learning gains are chosen as and , respectively. In , the weighting coefficients are assigned as and , and the second-order learning gains are set as and , respectively. It is computed that and , which belongs to the case that . The outputs by scheme at the 2nd, 4th, and 6th iterations are exhibited in Figure 5. Figure 6 shows that the tracking error of the updating law convergence is slower than that of in the sense of -norm.

#### 6. Conclusion

In this paper, for a class of fractional-order nonlinear systems, the first-order and second-order PD^{α}-type ILC strategies are developed and the sufficiency for convergence is analyzed by means of evaluating the tracking error in the sense of -norm. For analysis, it is found that the sufficient conditions of convergence not only depend on all of system dynamics, but also rely on all of learning gains. Moreover, the convergence speed comparison of the second-order law with the first-order one has been affirmed. We have clarified that, for a fractional-order nonlinear system, the results of the second-order law, that is, its convergence being faster than, equivalent to, or slower than first-order scheme, are validated. All theoretical results were conducted by simulations.

#### Appendix

#### Proof of Lemma 9

For the locally integrable function , denote . Then we have and it can be written as

Now, let us prove that and as for each in .

*Step 1. *For , inequality (A.3) is true.

*Step 2. *Assume that when , inequality (A.3) is true.

*Step 3. *If , then, from induction hypothesis, we derive that

By interchanging the order of integration, we get where the integral with

Inequality (A.3) is proved.

Since as for each in , we have Note that, the second term on the right side of (A.7) impliesSince the last term on the right side of (A.7) issubmitting (A.8) and (A.9) into (A.7) obtainswhere

The proof is complete.

#### Conflicts of Interest

The author declares that there are no conflicts of interest.

#### References

- S. Arimoto, S. Kawamura, and F. Miyazaki, “Be