Robustness analysis of an adjoint optimal iterative learning controller with experimental verification
A new modification to the steepest-descent algorithm for discrete-time iterative learning control is developed for plant models with multiplicative uncertainty. A theoretical analysis of the algorithm shows that if a tuning parameter is selected to be sufficiently large, the algorithm will result in...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
2008-07-01.
|
Subjects: | |
Online Access: | Get fulltext |