Robustness Analysis of a Type of Iterative Algorithm for R-L Fractional Nonlinear Control Systems in the Sense of 
 
 
 L
 
 
 p
 
 
 Norm

The paper is concerned with the robustness analysis of a type of iterative algorithm for R-L fractional nonlinear control systems in the sense of 
 
 
 
 L
 
 
 p
 
 
 
 norm. Firstly, according to the Laplace transform and M-L function, the concept of mild solutions of the system is derived. Secondly, we give the sufficient conditions of robustness analysis of the 
 
 P
 
 
 D
 
 
 α
 
 
 
 -type ILC algorithm with uncertain disturbances and then study the robust analysis of the second-order 
 
 P
 
 
 D
 
 
 α
 
 
 
 -type ILC algorithm. At last, two fractional examples are given to demonstrate the results.


Introduction
e aim of the paper is to analyze the robustness of a type of iterative algorithm in the sense of L p norm of the following R-L fractional system: where RL D α t denotes the R-L derivative of order α, 0 < α < 1, A,B, C ∈ R n×n , u(t) is a control vector, and g 1− α � (t 1− α /Γ(1 − α)).
Iterative learning control (ILC) was shown by Uchiyama in 1978 (in Japanese), and in recent years, more and more scholars have paid attention to the problems, among which are experts who study fractional calculus. e work of the fractional-order system in iterative learning control appeared in 2001. In the following decade, extensive attention has been paid to this field, great progress has been made [1][2][3][4][5][6][7][8], and many fractional nonlinear systems were investigated [9][10][11][12][13][14][15][16][17]. In recent years, the fractional ILC algorithm has played a great role in multiagent control information transmission, and for more information, one can see the references [13][14][15][16].
In Li et al.'s study [17], the authors discussed a P-type ILC scheme for a class of fractional-order nonlinear systems with delay by using the λ-norm and Gronwall inequality and obtained the sufficient condition for the robust convergence of the tracking errors.
In view of that the λ-norm often causes tracking errors that exceed the actual engineering range and cause inaccurate data, the authors Lan and Lin [18] used the L p norm to discuss the convergence of iterative learning algorithms, and it objectively quantifies the essential characteristics of the tracking error and comprehensively reflects the behavior of the system. Zhang and Peng [19] used the generalized Young inequality of convolution and discussed the robustness of the PD-type fractional-order iteration and learning control algorithm in the sense of L p norm, and the conditions of its robust convergence are obtained. e above references have analyzed the robustness of the algorithm of the Caputo-type fractional system, and we find the Caputo fractional derivative is often used to solve general diffusion problems. e R-L type fractional derivative has a wider application in viscoelastic problems because it does not require the function to be differentiable at the origin. As far as we all know, analyzing robustness with interference of the R-L type fractional system is an extremely interesting and challenging work. e rest of this paper is organized as follows. In Section 2, according to the Laplace transform and M-L function, the concept of mild solutions of the system is derived. In Section 3, we give the sufficient conditions of robustness analysis of the PD α -type ILC algorithm with uncertain disturbances and then study the robust analysis of the second-order PD α -type ILC algorithm. In Section 4, two fractional examples are given to demonstrate the results.

Some Preliminaries for Fractional Systems
In this section, we show some definitions and preliminaries of the L p norm and Mittag-Leffler function. From [20][21][22][23], one can see the definitions of the R-L fractional integral and derivative.

Definition 1.
e norm for the n-dimensional vector Z � (z 1 , z 2 , . . . , z n ) is defined as ‖Z‖ � max 1≤i≤n |z i |, and the L p norm is defined as

Definition 2.
e definition of the two-parameter function of the Mittag-Leffler type is described by If β � 1, one has the Mittag-Leffler function of one parameter as follows: Now, according to the results of the papers [17,[24][25][26][27], we will give the following lemma. Lemma 1 (Lemma 3, see [25]). e general solution of equation (1) is given by where Lemma 2 (Definition 2.4, see [27]). e operators E α,α (t) are exponentially bounded, and there is a constant Lemma 3 (H€ older inequality). Set p > 0, q > 0, and

Robust Analysis of the Second-Order PD α -Type ILC Algorithm
In this section, we consider the following second-order PD α -type ILC algorithm: where r 1 + r 2 � 1. e initial state of the system is as follows: For convenience, one can see Figure 2.
Assume that the initial state of each iterative learning meets (18), where L 1 and L 2 are the parameters which will be determined. Note Theorem 2. Suppose system (6) satisfies the second-order PD α -type ILC algorithm and the initial state of each iteration satisfies (18), then there exists positive p such that K 1 + K 2 < 1, and K 3 ⟶ 0. Since k ⟶ ∞, ‖Δu k+1 ‖ L p is uniformly bounded, which guarantees that lim k⟶∞ ‖e k ‖ λ � 0 and t ∈ J.
Proof. According to Lemma 1, we yield and then, By taking the L p norm, it yields

Mathematical Problems in Engineering
For brevity, note that and one can deduce ere exists a constant p > 0, which satisfies K 1 + K 2 < 1 and K 3 ⟶ 0. Since k ⟶ ∞, ‖Δu k+1 ‖ L p is uniformly bounded. e proof is completed.

Simulations
In this section, we will give two simulation examples to demonstrate the validity of the algorithms.

PD α -Type ILC with Initial State
Error. Consider the following one-dimensional systems as follows: Mathematical Problems in Engineering with the iterative learning control and initial state error where Ax(·) � x(·) 2 . Now, we can choose α � 0.6, , ω(t) � 10 − 3 sin(0.001t), and ](t) � 10 − 5 (t). For the system, we use the PD α -type ILC algorithm and set the initial control u 0 (·) � 0, y d (t) � 5 sin(e t 2 ), and t ∈ (0, 2). One can calculate M ≈ 3 > 0, κ 1 � 0.47, κ 2 � 0.17, and κ 3 < 0.01 � m, and then, all conditions of eorem 1 are satisfied. e state trajectories of system (24) with initial conditions are given in Figure 3 and Table 1, and with the increase of the number of iterations, it can track the desired trajectory gradually. Consistent with the theoretical analysis in the previous section, the algorithm has a faster convergence speed. At the end of the fourth iteration, the algorithm has converged. From Figures 3 and 4, the curve is basically completely fitted, showing that the system algorithm is well robust.

Mathematical Problems in Engineering
We also select other parameters and initial values of the algorithm as follows: u 0 (·) � 0, y d (t) � y 1 d (t) y 2 d (t) � 5 sin(t) 4t 3 , t ∈ (0, 1.9), r 1 � 1, r 2 � 0.5, c 1 � 1, and c 2 � 0.5. It is easy to show that M ≈ 3 > 0, K 1 � 0.264, K 2 � 0.428, and K 3 ⟶ 0, and all conditions of eorem 2 are satisfied. In the simulation, * * * denotes the desired trajectory of state 1, ◇◇◇ denotes the desired trajectory of state 2, and solid lines (--) in different colors denote the output of the system. In Figure 5, we use k1 to represent the iteration of state 1 and use k2 to represent the iteration of state 2, and the tracking error is shown in Figure 6, which implies the number of iterations and tracking error.
From Figure 6 and Table 2, one can find that the tracking error tends to zero quickly, so the output of the system can track the desired trajectory almost perfectly.

Conclusion
In this paper, we show the concept of mild solutions of the R-L fractional system and considered two cases of the PD α -type ILC algorithm. e sufficient conditions of robustness analysis of the PD α -type ILC algorithm with uncertain disturbances were given by the corresponding theorems and proved. At last, two R-L fractional examples are given to demonstrate the results.

Data Availability
e data used to support the findings of this study are included within the article.