• No results found

The convergence analysis of P type iterative learning control with initial state error for some fractional system

N/A
N/A
Protected

Academic year: 2020

Share "The convergence analysis of P type iterative learning control with initial state error for some fractional system"

Copied!
13
0
0

Loading.... (view fulltext now)

Full text

(1)

R E S E A R C H

Open Access

The convergence analysis of P-type

iterative learning control with initial state

error for some fractional system

Xianghu Liu

1,2*

and Yanfang Li

2

*Correspondence:

[email protected]

1Department of Mathematics,

Guizhou University, Huaxi Road, Guiyang, China

2Mathematics Department, Zunyi

Normal College, Wujiang Road, Zunyi, 563006, China

Abstract

In this paper, the convergence of iterative learning control with initial state error for some fractional equation is studied. According to the Laplace transform and the M-L function, the concept of mild solutions is showed. The sufficient conditions of convergence for the open and closed P-type iterative learning control are obtained. Some examples are given to illustrate our main results.

MSC: Primary 93C10; 93C40

Keywords: Caputo fractional derivative; iterative learning control; convergence; Mittag-Leffler function

1 Introduction

In this paper, we will analysis the convergence of iterative learning control initial state error of the following fractional system:

⎧ ⎪ ⎨ ⎪ ⎩

cDα

tx(t) =Ax(t) +Bu(t), tJ= [,b], x() =x,

y(t) =Cx(t),

()

wherecDα

t denotes the Caputo fractional derivative of orderα,  <α< .A,B,CRn×n, u(t) is a control vector.

Iterative learning control (ILC) was shown by Uchiyama in  (in Japanese), but only few people noticed it, Arimotoet al. developed the ILC idea and studied the effective algorithm until , they made it to be the iterative learning control theory, more and more people paid attention to it.

The fractional calculus and fractional difference equations have attracted lots of authors during in the past years, they published some outstanding work [–], because they de-scribed many phenomena in engineering, physics, science, and controllability. The work of fractional order systems in iterative learning control appeared in , and extensive attention has been paid to this field and great progress has been made in the following  years [–], many fractional nonlinear systems were researched [–]. To our knowl-edge, it has not been studied very extensively. In the study of iterative control theory, as-sume that the initial state of each run is on the desired trajectory, however, the actual

(2)

operation often causes some error from the iterative initial state to the desired trajectory, so we consider the system () and study the convergence of the learning law.

Motivated by the above mentioned works, the rest of this paper is organized as follows: In Section , we will show some definitions and preliminaries which will be used in the following parts. In Sections  and , we give some results for P-type ILC for some fractional system. In Section , some simulation examples are given to illustrate our main results.

In this paper, the norm for then-dimensional vectorw= (w,w, . . . ,wn) is defined as w=max≤i≤n|wi|, and theλ-norm is defined as=supt∈[,T]{eλt|x(t)|},λ> .

2 Some preliminaries for some fractional system

In this section, we will give some definitions and preliminaries which will be used in the paper, for more information, one can see [–].

Definition . The integral

tf(t) =  (α)

t

(ts)α–f(s)ds, α> ,

is called the Riemann-Liouville fractional integral of orderα, whereis the gamma func-tion.

For a functionf(t) given in the interval [,∞), the expression

LDα

tf(t) =  (nα)

d dt

n t

(ts)n–α–f(s)dt,

wheren= [α] + , [α] denotes the integer part of numberα, is called the Riemann-Liouville fractional derivative of orderα> .

Definition . Caputo’s derivative for a functionf : [,∞)→Rcan be written as

cDα

tf(t) =LD

α

t f(t) – n–

k= tk k!f

(k)()

, n= [α] + ,

where [α] denotes the integer part of real numberα.

Definition . The definition of the two-parameter function of the Mittag-Leffler type is described by

,β(z) =

k= zk

(αk+β), α> ,β> ,zC,

ifβ= , we get the Mittag-Leffler function of one parameter,

(z) =

k= zk (αk+ ).

(3)

Lemma . The general solution of equation()is given by

x(t) =,(A,t)x+

t

,α(A,ts)Bu(s)ds, ()

,β(A,t) =

k=

Aktαk+β– (αk+β).

Lemma . From Definition.in[],we know that the operators Sα,(t),,α(t),,α–(t) are exponentially bounded,there is a constant C=α,C=αA

–α α ,C=

αA

–α α ,eα(t) =

eA

αt,M=e

α(b),

,(A,t)≤C(t), ,α(A,t)≤C(t). ()

3 Open and closed-loop case

In this section, we consider the following fractional equation:k= , , , , . . . ,

cDα

txk(t) =Axk(t) +Buk(t), tJ= [,b], yk(t) =Cxk(t).

()

For equation (), we apply the following open and closed-loop P-type ILC algorithm, t∈[,b]:

uk+(t) =uk(t) +Lek(t) +Lek+(t), ()

whereL,Lare the parameters which will be determined,ek=yd(t) –yk(t),yd(t) are the given functions. The initial state of each iterative learning is

xk+() =xk() +BLek(t). ()

We make the following assumptions:

(H):  –λ–CMCLB> ,

(H): I–CSα,(A,t)BL+λ–CMCLB –λ–C

MCLB < .

Theorem . Assume that the open and closed-loop P-type ILC algorithm()is used, (H) and(H)hold,let yk(·)be the output of equation(),if the initial state of each iterative learning satisfy(),limk→∞ekλ= ,tJ.

Proof According to (), (), and (), we know

xk+(t) =,(A,t)xk+() +

t

,α(A,ts)Buk+(s)ds

=,(A,t)

xk() +BLek(t)

+

t

,α(A,ts)B

uk(s) +Lek(s) +Lek+(s)

ds

=xk(t) +,(A,t)BLek(t) +

t

,α(A,ts)BLek(s)ds

+

t

(4)

so the (k+ )th iterative error is

ek+(t) =yd(t) –Cxk+(t)

=yd(t) –C

xk(t) +,(A,t)BLek(t) +

t

,α(A,ts)BLek(s)ds

+

t

,α(A,ts)BLek+(s)ds

=ek(t) –C

,(A,t)BLek(t) +

t

,α(A,ts)BLek(s)ds

+

t

,α(A,ts)BLek+(s)ds

=ICSα,(A,t)BL

ek(t) –C

t

,α(A,ts)BLek(s)ds

C

t

,α(A,ts)BLek+(s)ds; ()

take the norm of (),

ek+(t)≤ICSα,(A,t)BLek(t)

+C

t

C(s)BLek(s)ds

+C

t

C(s)BLek+(s)ds, ()

take theλ-norm of (),

ek+λICSα,(A,t)BLekλ

+ sup

t∈[,T]eλtCC

BL

t

eα(s)ek(s)ds

+ sup

t∈[,T]eλtC

t

C(s)BLek+(s)ds

ICSα,(A,t)BLekλ

+ sup

t∈[,T]eλtCC

BL

t

(s)eλsdsekλ

+ sup

t∈[,T]eλtC

t

C(s)BLeλsdsek+λ, ()

if  –λ–C

MCLB> ,

ek+λ

ICSα,(A,t)BL+λ–CMCLB  –λ–C

MCLB

ekλ, ()

let I–CSα,(A,t)BL+λ–CLMCB

(5)

Theorem . implied that the tracking errorek(t) depends onCandxk(t), it is also ob-served for () that the boundedness of the parametersC,B,L,Limplies the bounded-ness of theekλ, so Theorem . indirectly indicated that the output error also depend

on I–CSα,(A,t)BL+λ–CMCLB

–λ–CMCLB . From the result, we can do a more in-depth discussion.

Corollary . Suppose that all conditions are the same with Theorem.,limk→∞ekλ=

,then

lnCML+CML

λCL

<t<b.

Proof From Theorem ., the important condition is I–CSα,(A,t)BL+λ–CMCLB –λ–C

MCLB < , which implies that

 –C(t)CLB+λ–CMCLB ≤ –λ–CMCLB,

we can get

lnCML+CML

λCL

<t<b.

4 P-type ILC for some fractional system with random disturbance

In this section, we consider the following fractional equation:k= , , , , . . . ,

cDα

txk(t) =Axk(t) +Buk(t) +ωk(t), tJ= [,b], yk(t) =Cxk(t) +νk(t),

()

whereωk(t),νk(t) are the random disturbance.

Firstly, we will make some assumptions to be satisfied on the data of our problem:

(H): ωkλε,νkλεfor some positive constantsε,ε,

(H): ρ=I+CSα,(A,t)LBλ–CCLBM> , ρ=ICSα,(A,t)LB+λ–CCLBM.

For equation (), we choose the following open and closed-loop P-type ILC algorithm, t∈[,b]:

uk+(t) =uk(t) +Lek(t) +Lek+(t), ()

whereL,Lare the parameters which will be determined,ek=yd(t) –yk(t),yd(t) are the given functions.

Assume that the initial state of each iterative learning is (), whereL,Lare the pa-rameters which will be determined. We have

xk+() =xk() +BLek(t) +BLek+(t). ()

(6)

Proof According to () and assumptions (H), (H), we know

xk+(t) =,(A,t)xk+() +

t

,α(A,ts)

Buk+(s) +ωk+(s)

ds

=,(A,t)

xk() +BLek(t) +BLek+(t)

+

t

,α(A,ts)B

uk(s) +Lek(s) +Lek+(s)

ds

+

t

,α(A,ts)ωk+(s)ds

=xk(t) +,(A,t)BLek(t) +,(A,t)BLek+(t)

+

t

,α(A,ts)BLek(s)ds+

t

,α(A,ts)BLek+(s)ds

+

t

,α(A,ts)ωk+(s)ds,

the (k+ )th iterative error is

ek+(t) =yd(t) –Cxk+(t) –νk+(t)

=yd(t) –C

xk(t) +,(A,t)BLek(t) +,(A,t)BLek+(t)

+

t

,α(A,ts)BLek(s)ds+

t

,α(A,ts)BLek+(s)ds

+

t

,α(A,ts)ωk+(s)ds

νk+(t)

=ek(t) –C

,(A,t)BLek(t) +,(A,t)BLek+(t)

+

t

,α(A,ts)BLek(s)ds+

t

,α(A,ts)BLek+(s)ds

+

t

,α(A,ts)ωk+(s)ds

νk+(t)

=ICSα,(A,t)BL

ek(t) –CSα,(A,t)BLek+(t)

C

t

,α(A,ts)BLek(s)dsC

t

,α(A,ts)BLek+(s)ds

C

t

,α(A,ts)ωk+(s)dsνk+(t). ()

Taking the norm of (), it is easy to obtain

I+CSα,(A,t)LBek+(t)

ICSα,(A,t)LBek(t)+C

t

C(s)LBek(s)ds

+C

t

C(s)LBek+(s)ds+C

t

C(s)ωk+(s)ds

(7)

once more using theλ-norm, we have

I+CSα,(A,t)LBek+λ

ICSα,(A,t)LBekλ+ sup

t∈[,T]eλtC

CBL

t

eα(s)eλsdsekλ

+ sup

t∈[,T]eλtC

CLB

t

(s)eλsdsek+λ

+ sup

t∈[,T]eλtC

C

t

(s)eλsdsωk+λ+ sup

t∈[,T]eλtν

k+(t),

invoking (H) and (H), ifε=λ–CεMC+ε,

ρek+λρekλ+ε, ()

which implies that

ekλ

ε ρ–ρ

,

ifε→ andε→,ε→, thuslimk→∞ekλ= ,tJ, and this completes the proof.

From Theorem ., on the one hand, the random disturbance makes some impact on the system (),ε→ andε→ imply the impact is very small; on the other hand,ρ>ρ, for this condition, we illustrate the following corollary.

Corollary . Suppose that all conditions are the same as Theorem.,limk→∞ek(t)λ=

,then t satisfies

ln|CM

λC|

<t<ln|

–λ–CCLBM CLB |

.

Proof According to (H),I+CSα,(A,t)LBλ–CCLBM> , then

t<ln|

–λ–CCLBM CLB |

.

From Theorem ., we know thatε→ andε→, and the condition is

ρρ

=ICSα,(A,t)LB+λ –C

CLBM I+CSα,(A,t)LBλ–CCLBM

< ,

which yields ln|

CM

λC|

Aα <t. At last, we obtain the estimate

ln|CM

λC|

<t<ln|

–λ–CCLBM CLB |

(8)

5 Simulations

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

5.1 P-type ILC with initial state error

⎧ ⎪ ⎨ ⎪ ⎩

cD.

t xk(t) =xk(t) + .uk(t), tJ= [, .], x() = .,

yk(t) =xk(t),

()

with the iterative learning control and initial state error

uk+(t) =uk(t) + .ek(t) + .ek+(t), xk+() =xk() + .ek(t).

()

We set the initial controlu(·) = ,yd(t) = t( – t),t∈(, .), and setα= .,A= , B= .,C= .,λ= ,L=L= ., andC= ,C= ,λA

α =  > ,M > ,

 –λ–C

MCLB ≈. > , I–CSα,(A,t)BL+λ –C

MCLB –λ–C

MCLB ≈ .

. < , all conditions of Theorem . are satisfied.

[image:8.595.119.477.475.709.2]

The simulation result can be seen from Figure  and Figure , for the open and closed-loop P-type ILC system (), with the increase of the number of iterations, it can track the desired trajectory gradually by using the algorithm. We do not use the single iteration rate to get the result, because in the late of the iteration, the output of the system may jump around the desired trajectory, so we adopt a correction method, that is, whene(k) > , u(k) =u(k) – .×e(k) ore(k) < ,u(k) =u(k) + .×e(k),kis the number of iteration, the result approaches the desired trajectory stably and quickly, from Figure , the tracking error tends to zero at the th iteration, so the iterative learning control is feasible and the efficiency is high.

(9)
[image:9.595.116.478.80.321.2]

Figure 2 Number of iterations and tracking error.

5.2 P-type ILC with random disturbance

Consider the following P-type ILC system:

⎧ ⎪ ⎨ ⎪ ⎩

cD.

t xk(t) =xk(t) + .uk(t) + –t, tJ= [, .], x() = .,

yk(t) = .xk(t) + –t,

()

with the iterative learning control and initial state error

uk+(t) =uk(t) +ek(t) + .ek+(t), xk+() =xk() + .ek(t) + .ek+(t).

()

We set the initial controlu(·) = ,yd(t) = t–t,t∈(, .), and setα= .,A= , B= .,C= ,λ= ,L= ,L= ., andC= ,C= ,ρ≈.,ρ≈.,ε= –→ ,ε= –→, all conditions of Theorem . are satisfied. We also use a correction method, that is, whene(k) > ,u(k) =u(k) –m×e(k) ore(k) < ,u(k) =u(k) +m×e(k), k is the number of iterations, m is the parameter, we set m= ., ., , and the out-put of the system is shown in Figure , Figure , Figure . The symbol∗∗∗denotes the desired trajectory, — denotes the output of the system, the tracking error is shown in Figure , Figure , Figure , which imply the number of iteration and the tracking er-ror.

(10)
[image:10.595.119.477.127.365.2]

Figure 3 ∗∗∗denotes the desired trajectory, — denotes the output of the system.

[image:10.595.119.479.422.663.2]
(11)
[image:11.595.119.478.127.364.2]

Figure 5 ∗∗∗denotes the desired trajectory, — denotes the output of the system.

[image:11.595.117.479.407.673.2]
(12)
[image:12.595.116.477.80.326.2] [image:12.595.120.477.369.615.2]

Figure 7 Number of iterations and tracking error.

[image:12.595.167.425.685.731.2]

Figure 8 Number of iterations and tracking error.

Table 1 The iteration number and the tracking error and the running time table

m The number of iterations The tracking error Run time (second)

0.5 7 0.002 58.207

0.7 5 0.0013 50.123

(13)

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

The authors contributed equally to this work. All authors read and approved the final manuscript.

Acknowledgements

This work was financially supported by the Zunyi Normal College Doctoral Scientific Research Fund BS[2014]19, BS[2015]09, Guizhou Province Mutual Fund LH[2015]7002, Guizhou Province Department of Education Fund KY [2015]391, [2016]046, Guizhou Province Department of Education teaching reform project [2015]337, Guizhou Province Science and technology fund (qian ke he ji chu) [2016]1160, [2016]1161, Zunyi Science and technology talents [2016]15.

Received: 15 September 2016 Accepted: 19 January 2017

References

1. Miller, KS, Ross, B: An Introduction to the Fractional Calculus and Differential Equations. Wiley, New York (1993) 2. Kilbas, AA, Srivastava, HM, Trujillo, JJ: Theory and Applications of Fractional Differential Equations. Elsevier,

Amsterdam (2006)

3. Lakshmikantham, V, Leela, S, Devi, JV: Theory of Fractional Dynamic Systems. Cambridge Academic Publishers, Cambridge (2009)

4. Diethelm, K: The Analysis of Fractional Differential Equations. Springer, Berlin (2010)

5. Wang, JR, Zhou, Y, Medved, M: On the solvability and optimal controls of fractional integrodifferential evolution systems with infinite delay. J. Optim. Theory Appl.152, 31-50 (2012)

6. Zhang, L, Ahmad, B, Wang, G: Explicit iterations and extremal solutions for fractional differential equations with nonlinear integral boundary conditions. Appl. Math. Comput.268, 388-392 (2015)

7. Zhang, X: On the concept of general solution for impulsive differential equations of fractional-orderq∈(1, 2). Appl. Math. Comput.268, 103-120 (2015)

8. Ge, F-D, Zhou, H-C, Ko, C-H: Approximate controllability of semilinear evolution equations of fractional order with nonlocal and impulsive conditions via an approximating technique. Appl. Math. Comput.275, 107-120 (2016) 9. Arthi, G, Park, JH, Jung, HY: Existence and exponential stability for neutral stochastic integrodifferential equations with

impulses driven by a fractional Brownian motion. Commun. Nonlinear Sci. Numer. Simul.32, 145-157 (2016) 10. Hernández, E, O’Regan, D, Balachandran, K: On recent developments in the theory of abstract differential equations

with fractional derivatives. Nonlinear Anal.73, 3462-3471 (2010)

11. Zayed, EME, Amer, YA, Shohib, RMA: The fractional complex transformation for nonlinear fractional partial differential equations in the mathematical physics. J. Assoc. Arab Univ. Basic Appl. Sci.19, 59-69 (2016)

12. Zhang, X, Zhang, B, Repovš, D: Existence and symmetry of solutions for critical fractional Schrödinger equations with bounded potentials. Nonlinear Anal., Real World Appl.142, 48-68 (2016)

13. Bien, Z, Xu, JX: Iterative Learning Control Analysis: Design, Integration and Applications. Springer, New York (1998) 14. Chen, YQ, Wen, C: Iterative Learning Control: Convergence, Robustness and Applications. Springer, Berlin (1999) 15. Norrlof, M: Iterative Learning Control: Analysis, Design, and Experiments. Linkoping Studies in Science and

Technology, Dissertations, Sweden (2000)

16. Xu, JX, Tan, Y: Linear and Nonlinear Iterative Learning Control. Springer, Berlin (2003)

17. Wang, Y, Gao, F, Doyle III, FJ: Survey on iterative learning control, repetitive control, and run-to-run control. J. Process Control19, 1589-1600 (2009)

18. de Wijdeven, JV, Donkers, T, Bosgra, O: Iterative learning control for uncertain systems: robust monotonic convergence analysis. Automatica45, 2383-2391 (2009)

19. Xu, JX: A survey on iterative learning control for nonlinear systems. Int. J. Control84, 1275-1294 (2011)

20. Li, Y, Chen, YQ, Ahn, HS: Fractional-order iterative learning control for fractional-order systems. Asian J. Control13, 54-63 (2011)

21. Lan, Y-H: Iterative learning control with initial state learning for fractional order nonlinear systems. Comput. Math. Appl.64, 3210-3216 (2012)

22. Lin, M-T, Yen, C-L, Tsai, M-S, Yau, H-T: Application of robust iterative learning algorithm in motion control system. Mechatronics23, 530-540 (2013)

23. Yan, L, Wei, J: Fractional order nonlinear systems with delay in iterative learning control. Appl. Math. Comput.257, 546-552 (2015)

24. Liu, S, Wang, JR, Wei, W: Analysis of iterative learning control for a class of fractional differential equations. J. Appl. Math. Comput.53, 17-31 (2017)

25. Liu, S, Debbouche, A, Wang, J: On the iterative learning control for stochastic impulsive differential equations with randomly varying trial lengths. J. Comput. Appl. Math.312, 47-57 (2017)

26. Zhou, Y, Jiao, F: Existence of mild solutions for fractional neutral evolution equations. Comput. Math. Appl.59, 1063-1077 (2010)

27. Mophou, GM, N’Guérékata, GM: Existence of mild solutions of some semilinear neutral fractional functional evolution equations with infinite delay. Appl. Math. Comput.216, 61-69 (2010)

28. Wei, J: The controllability of fractional control systems with control delay. Comput. Math. Appl.64, 3153-3159 (2012) 29. Yan, L, Wei, J: Fractional order nonlinear systems with delay in iterative learning control. Appl. Math. Comput.257,

546-552 (2015)

Figure

Figure 1 ∗∗∗ denotes the desired trajectory, — denotes the output of the system.
Figure 2 Number of iterations and tracking error.
Figure 3 ∗∗∗ denotes the desired trajectory, — denotes the output of the system.
Figure 5 ∗∗∗ denotes the desired trajectory, — denotes the output of the system.
+2

References

Related documents

Percent of humeral head anterior to scapular line (PHHA), glenoid version, coracoscapular angles, and coracoscapular and coracohumeral distances were significantly lower for

Results: The proteomic approach revealed significantly increased expression of carbonic anhydrase I (CA1) in the synovial membrane of patients with AS as compared with the RA and

4) At 4- and 12-month follow-up, changes in the sec- ondary outcomes VAS pain, global disease activity, gen- eric and disease specific functioning and disability (measured by

We found that KOA related structural changes seen on radiographs and MRI scans, at baseline, did not rule out improvement of symptoms following a clinically signifi- cant weight

TNP: Trigeminal neuropathic pain; PET: Positron emission tomography; μ OR: μ -opioid receptor; μ ORs BP ND : μ -opioid receptor non-displaceable binding potential; NAc:

Although a majority of participants reported using pro- fessionally-guided recommendations, over 40% reported using at least one self-guided pharmacological and/or

examination, 5) nerve conduction studies in all subjects, 6) ability to exclude pre-existing or prevalent cases at baseline, 7) blinding of Health Outcomes Assessment and Job

ES: Erector Spinae; FCSA: Functional Cross Sectional Area; FI: Fatty infiltration; FSPGR: Fast-spoiled gradient echo; IP: In-phase (water); L1,4: Lumbar levels L1 and L4; LBP: Low