.png){kind=icon}
返回
Iterative Learning Control for Path-Following Tasks With Performance Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TCST.2021.3062223.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The classical problem setup of iterative learning control (ILC) is to enforce tracking of a reference profile specified at all time points in the fixed task duration. The removal of the time specification releases significant design freedom in how the path is followed but has not been fully exploited in the literature. This article unlocks this extra design freedom by formulating the ILC task description to handle repeated path-following tasks, e.g., welding and laser cutting, which aim at following a given spatial path defined in the output space without any temporal information. The general ILC problem is reformulated for ILC design with the inclusion of an additional performance index, and the class of piecewise linear paths is characterized for the reformulated problem setup. A two-stage design framework is proposed to solve the characterized problem and yields a comprehensive algorithm based on an ILC update and a gradient projection update. This algorithm is verified on a gantry robot experimental platform to demonstrate its practical efficacy and robustness against model uncertainty.
Keyword:
Iterative learning control
Hilbert space
Iterative learning control (ILC)
optimization
path following
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
4.9K
被引数:
1.7W
机构
引用论文
A coordinate descent approach to optimal tracking time allocation in point-to-point ILC点到点ILC中最佳跟踪时间分配的坐标下降方法.png)
MECHATRONICSOAAI
MECHATRONICSIF3.1
OAAI分享收藏
查看更多内容