.png){kind=icon}
.png){kind=icon}
Return
Iterative Learning Control Based on Nesterov Accelerated Gradient Method
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2936044.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Iterative learning control
Nesterov accelerated gradient method
monotonic convergence
learning algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
