Fundamental Trackability Problems for Iterative Learning Control
文献类型：期刊论文
| 作者 | Deyuan Meng; Jingyao Zhang |
| 刊名 | IEEE/CAA Journal of Automatica Sinica
 |
| 出版日期 | 2023 |
| 卷号 | 10期号:10页码:1933-1950 |
| 关键词 | Convergence functional Cauchy sequence (FCS) iterative learning control (ILC) trackability |
| ISSN号 | 2329-9266 |
| DOI | 10.1109/JAS.2023.123312 |
| 英文摘要 | Generally, the classic iterative learning control (ILC) methods focus on finding design conditions for repetitive systems to achieve the perfect tracking of any specified trajectory, whereas they ignore a fundamental problem of ILC: whether the specified trajectory is trackable, or equivalently, whether there exist some inputs for the repetitive systems under consideration to generate the specified trajectory? The current paper contributes to dealing with this problem. Not only is a concept of trackability introduced formally for any specified trajectory in ILC, but also some related trackability criteria are established. Further, the relation between the trackability and the perfect tracking tasks for ILC is bridged, based on which a new convergence analysis approach is developed for ILC by leveraging properties of a functional Cauchy sequence (FCS). Simulation examples are given to verify the effectiveness of the presented trackability criteria and FCS-induced convergence analysis method for ILC. |
| 源URL | [http://ir.ia.ac.cn/handle/173211/52394]  |
| 专题 | 自动化研究所_学术期刊_IEEE/CAA Journal of Automatica Sinica |
| 推荐引用方式 GB/T 7714 | Deyuan Meng,Jingyao Zhang. Fundamental Trackability Problems for Iterative Learning Control[J]. IEEE/CAA Journal of Automatica Sinica,2023,10(10):1933-1950. |
| APA | Deyuan Meng,&Jingyao Zhang.(2023).Fundamental Trackability Problems for Iterative Learning Control.IEEE/CAA Journal of Automatica Sinica,10(10),1933-1950. |
| MLA | Deyuan Meng,et al."Fundamental Trackability Problems for Iterative Learning Control".IEEE/CAA Journal of Automatica Sinica 10.10(2023):1933-1950. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。