Abstract
The optimal updating law of the problem of optimal higher-order iterative learning control is given explicitly and the convergence of the tracking errors is proved. Two examples show that the convergence of the optimal higher-order iterative learning control is faster than that of the optimal one-order iterative learning control.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
