2015
DOI: 10.1049/iet-cta.2014.0754
|View full text |Cite
|
Sign up to set email alerts
|

Data‐driven terminal iterative learning control with high‐order learning law for a class of non‐linear discrete‐time multiple‐input–multiple output systems

Abstract: In this study, a novel data-driven terminal iterative learning control with high-order learning law is proposed for a class of non-linear non-affine discrete-time multiple-input-multiple output systems, where only the system state or output at the endpoint is measurable and the control input is time-varying. A new data-driven dynamical linearisation is proposed in the iteration domain and the linearisation data model can be updated by a designed parameter updating law iteratively. The high-order learning contr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 48 publications
(16 citation statements)
references
References 33 publications
0
16
0
Order By: Relevance
“…In this paper, the following assumptions are imposed.Assumption The identical initial condition is assumed, that is, y k (0) = y 0 , ∀ k , and y 0 is a constant vector.Assumption The nonlinear function g N (⋅) is bounded with bounded arguments, and its derivatives with respect to U k are continuous and bounded. Without loss of generality, we assume that Lgmin<‖‖gN'()Lgmax for all time instants and iterations where gN'()=gN()UkT and Lgmin, Lgmax are 2 positive constants.Theorem (Chi et al): If nonlinear system satisfies Assumptions and , then there exists a matrix Ξ k such that system can be transferred to a linear model in the iteration domain without any linearization approximation: yk()N=yk1()N+ΞknormalΔUk, and Lgmin‖‖boldΞkLgmax is bounded for any iteration k , Ξk=centercenterg1,N*boldukT0centerg1,N*boldukT1centercenterg1,N*boldukTN1…”
Section: Problem Formulation and Dynamical Linearizationmentioning
confidence: 99%
See 3 more Smart Citations
“…In this paper, the following assumptions are imposed.Assumption The identical initial condition is assumed, that is, y k (0) = y 0 , ∀ k , and y 0 is a constant vector.Assumption The nonlinear function g N (⋅) is bounded with bounded arguments, and its derivatives with respect to U k are continuous and bounded. Without loss of generality, we assume that Lgmin<‖‖gN'()Lgmax for all time instants and iterations where gN'()=gN()UkT and Lgmin, Lgmax are 2 positive constants.Theorem (Chi et al): If nonlinear system satisfies Assumptions and , then there exists a matrix Ξ k such that system can be transferred to a linear model in the iteration domain without any linearization approximation: yk()N=yk1()N+ΞknormalΔUk, and Lgmin‖‖boldΞkLgmax is bounded for any iteration k , Ξk=centercenterg1,N*boldukT0centerg1,N*boldukT1centercenterg1,N*boldukTN1…”
Section: Problem Formulation and Dynamical Linearizationmentioning
confidence: 99%
“…In addition, the convergence analysis was conducted mainly under a linear system framework. More recently, 2 high‐order data‐driven TILC methods were presented in Chi et al, but only an asymptotic convergence is proved. As it is known, monotonic convergence is a more desirable performance with more practical relevance than the asymptotic one .…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…A high-order learning control law terminal iterative learning control (TILC) is developed to improve control performance. The new developed control law is a data-driven control strategy, where any other model information of the control plant do not need except for the I/O measurements [15]. The model-free sliding mode controllers have been applied to control the azimuth and pitch positions in two single input single output control loops and it has proved its effectiveness over intelligent PI control system [16].…”
Section: Introductionmentioning
confidence: 99%