Iterative Learning Control Based on Nesterov Accelerated Gradient Method

33Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Based on Nesterov accelerated gradient method, the problem of iterative learning control for a class of linear discrete-time systems is considered in this paper. Firstly, the iterative learning control problem of linear discrete-time systems is transformed into an iterative least-squares problem. Then, the Nesterov accelerated gradient method is introduced into the iterative learning control framework. Note that the Nesterov accelerated gradient learning algorithm has the capability of fast convergence. It is shown that the algorithm presented in this paper can guarantee the output tracking error converges to zero with rate O(1/k) , where k is the iteration counter. Moreover, the monotonic convergence of the Nesterov accelerated gradient learning algorithm is analyzed and discussed. Finally, the effectiveness of the proposed method is verified by two simulation examples.

Cite

CITATION STYLE

APA

Gu, P., Tian, S., & Chen, Y. (2019). Iterative Learning Control Based on Nesterov Accelerated Gradient Method. IEEE Access, 7, 115836–115842. https://doi.org/10.1109/ACCESS.2019.2936044

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free