Optimal selection of the forgetting matrix into an iterative learning control algorithm
A recursive optimal algorithm, based on minimizing the input error covariance matrix, is derived to generate the optimal forgetting matrix and the learning gain matrix of a P-type iterative learning control (ILC) for linear discrete-time varying systems with arbitrary relative degree. This note show...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | article |
| منشور في: |
2005
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/11172 http://dx.doi.org/10.1109/TAC.2005.860232 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/1556736 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | A recursive optimal algorithm, based on minimizing the input error covariance matrix, is derived to generate the optimal forgetting matrix and the learning gain matrix of a P-type iterative learning control (ILC) for linear discrete-time varying systems with arbitrary relative degree. This note shows that a forgetting matrix is neither needed for boundedness of trajectories nor for output tracking. In particular, it is shown that, in the presence of random disturbances, the optimal forgetting matrix is zero for all learning iterations. In addition, the resultant optimal learning gain guarantees boundedness of trajectories as well as uniform output tracking in presence of measurement noise for arbitrary relative degree. |
|---|