Model-free Iterative Learning Control based on Adaptive Dynamic Programming

An exploration of the model-free iterative learning control based on adaptive dynamic programming is developed for nonlinear non-affine discrete-time systems. A data-driven iterative dynamic linearization model is developed for original nonlinear systems only using input/output data. Subsequently, a novel performance index function incorporating the error information of future batches is formulated along the iteration axis through dynamic programming, where neural networks are employed to estimate future information. The gradient descent algorithm is employed to facilitate the weight updating of the neural network. Ultimately, a variable penalty factor is developed. This synthesis collectively enhances the convergence rate of tracking errors. The effectiveness of this method is substantiated through two simulation examples.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/ddcls66240.2025.11065403
Primary Topic
Machine Learning and ELM
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Model-free Iterative Learning Control based on Adaptive Dynamic Programming

Ronghu Chi, Si‐Min Liu
Machine Learning and ELM
article

Model-free Iterative Learning Control based on Adaptive Dynamic Programming

Ronghu Chi, Si‐Min Liu
article en

Abstract

An exploration of the model-free iterative learning control based on adaptive dynamic programming is developed for nonlinear non-affine discrete-time systems. A data-driven iterative dynamic linearization model is developed for original nonlinear systems only using input/output data. Subsequently, a novel performance index function incorporating the error information of future batches is formulated along the iteration axis through dynamic programming, where neural networks are employed to estimate future information. The gradient descent algorithm is employed to facilitate the weight updating of the neural network. Ultimately, a variable penalty factor is developed. This synthesis collectively enhances the convergence rate of tracking errors. The effectiveness of this method is substantiated through two simulation examples.

Qingdao University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 92%
Machine Learning and ELM
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.