Premium
Sampled‐data iterative learning control with well‐defined relative degree
Author(s) -
Sun Mingxuan,
Wang Danwei,
Wang Youyi
Publication year - 2004
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.919
Subject(s) - iterative learning control , degree (music) , convergence (economics) , tracking error , upper and lower bounds , mathematics , zero (linguistics) , computer science , stability (learning theory) , approximation error , tracking (education) , control (management) , sampling (signal processing) , trajectory , algorithm , mathematical optimization , artificial intelligence , machine learning , economics , economic growth , psychology , mathematical analysis , pedagogy , linguistics , philosophy , physics , astronomy , acoustics , filter (signal processing) , computer vision
This paper addresses the problem of iterative learning control with well‐defined relative degree. The solution is a family of sampled‐data learning algorithms using lower‐order differentiations of the tracking error with the order less than the relative degree. A unified convergence condition for the family of learning algorithms is derived and is proved to be independent of the highest order of the differentiations. In the presence of initial condition errors, the system output is ensured to converge to the desired trajectory with a specified error bound at each sampling instant. The bound will reduce to zero whenever the bound on initial condition errors tends to zero. Numerical examples are provided to illustrate the tracking performance of the proposed learning algorithms. Copyright © 2004 John Wiley & Sons, Ltd.