.png){kind=icon}
.png){kind=icon}
Return
Data-Driven Learning Control Algorithms for Unachievable Tracking Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/JAS.2023.123756.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For unachievable tracking problems, where the system output cannot precisely track a given reference, achieving the best possible approximation for the reference trajectory becomes the objective. This study aims to investigate solutions using the P-type learning control scheme. Initially, we demonstrate the necessity of gradient information for achieving the best approximation. Subsequently, we propose an input-output-driven learning gain design to handle the imprecise gradients of a class of uncertain systems. However, it is discovered that the desired performance may not be attainable when faced with incomplete information. To address this issue, an extended iterative learning control scheme is introduced. In this scheme, the tracking errors are modified through output data sampling, which incorporates low-memory footprints and offers flexibility in learning gain design. The input sequence is shown to converge towards the desired input, resulting in an output that is closest to the given reference in the least square sense. Numerical simulations are provided to validate the theoretical findings.
Keywords:
Data-driven algorithms
incomplete information
iterative learning control
gradient information
unachievable problems
Journal
I
IF:
19.2
Papers:
1.4K
Citations:
1.1W