Abstract
In iterative learning control (ILC) design, a direct objective is to achieve time-optimal learning in the presence of the system uncertainties. Higher-order ILC (HO-ILC) schemes have been proposed targeting at improving the convergence speed in the iteration domain. A m-th order ILC essentially uses system control information generated from past m iterations. A question is: can the convergence speed be improved in general by a HO-ILC? We show that, as far as the linear HO-ILC is concerned, the lower order ILC always outperform the higher-order ILC in the sense of time weighted norm. In order to facilitate a rigorous analysis of HO-ILC convergence speed and lay a fair basis for comparisons among ILC with different orders, the problem is formulated into a robust optimization problem in a min-max form.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
