Convergence Conditions for Solving Robust Iterative Learning Control Problems Under Nonrepetitive Model Uncertainties

被引:47
|
作者
Meng, Deyuan [1 ,2 ]
机构
[1] Beihang Univ BUAA, Res Div 7, Beijing 100191, Peoples R China
[2] Beihang Univ BUAA, Sch Automat Sci & Elect Engn, Beijing 100191, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
H-infinity-based analysis; iterative learning control (ILC); model uncertainties; nonrepetitiveness; robustness; DISCRETE-TIME-SYSTEMS; NONLINEAR-SYSTEMS; MULTIAGENT SYSTEMS; CONSENSUS TRACKING; CONTROL ALGORITHM; BATCH PROCESSES; CONTROL DESIGN; INTERVAL; DISTURBANCES; STABILITY;
D O I
10.1109/TNNLS.2018.2874977
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Learning from saved measurement and control data to refine the performance of output tracking is the core feature of iterative learning control (ILC). Even though this implementation process of ILC does not need any model knowledge, ILC typically requires the strict repetitiveness of the control systems, especially on the plant models of them. The questions of interest in this paper are: 1) whether and how can robust ILC problems be solved with respect to the nonrepetitive (or iteration-dependent) model uncertainties and 2) can convergence conditions be developed with the effective contraction mapping (CM)-based approach to ILC? The answers to these questions are affirmative, and the CM-based approach is applicable to robust ILC that accommodates certain nonrepetitive uncertainties, especially in the plant models. In particular, an H-infinity-norm condition is proposed to ensure the robust ILC convergence, which can be solved to determine learning gain matrices. Simulation tests are performed to illustrate the validity of our presented H-infinity-based analysis results.
引用
收藏
页码:1908 / 1919
页数:12
相关论文
共 50 条