The University of Southampton
University of Southampton Institutional Repository

Iterative learning control: A data-driven approach

Iterative learning control: A data-driven approach
Iterative learning control: A data-driven approach
Iterative learning control (ILC) is a control method that is well-suited for repetitive tasks with finite durations. ILC algorithms learn from the past input and error information to improve the system's tracking performance. In particular, it can achieve perfect tracking even in the presence of model uncertainties. Starting from the work by \cite{arimoto1984bettering}, ILC has attracted intensive research in the last few decades and now has many applications.

Depending on whether the system model information is utilised, ILC designs can be classified as model-based ILC and model-free ILC. With system model information, model-based designs can achieve excellent tracking performance, e.g. monotonic convergence. In practice, the accurate system model may be expensive to obtain, making model-based algorithms challenging to implement. To address this limitation, this thesis studies data-driven ILC algorithms using the well-known Willems' fundamental lemma, which shows that linear system behaviour can be presented by a given persistently exciting trajectory.

Based on Willems' fundamental lemma, a novel data-driven norm optimal ILC (NOILC) algorithm is proposed to eliminate the requirement of the model-based NOILC algorithm on the system model. It shows that the developed algorithm achieves identical tracking performance to the model-based NOILC algorithm. We also show the algorithm can handle system constraints. Two extensions are then developed to relax the persistent excitation condition of the existing input data: the receding-horizon-based data-driven NOILC algorithm and the trial-partition-based data-driven NOILC algorithm. To demonstrate the generality of our proposed data-driven framework, we study two practical ILC applications, namely point-to-point tracking tasks and consensus tracking tasks. The simulation examples are provided to verify the effectiveness of the proposed algorithms.
University of Southampton
Jiang, Zheng
d42bc017-e3fd-46bf-9db5-e05ea72dd78c
Jiang, Zheng
d42bc017-e3fd-46bf-9db5-e05ea72dd78c
Chu, Bing
555a86a5-0198-4242-8525-3492349d4f0f
Rapisarda, Paolo
79efc3b0-a7c6-4ca7-a7f8-de5770a4281b

Jiang, Zheng (2025) Iterative learning control: A data-driven approach. University of Southampton, Doctoral Thesis, 166pp.

Record type: Thesis (Doctoral)

Abstract

Iterative learning control (ILC) is a control method that is well-suited for repetitive tasks with finite durations. ILC algorithms learn from the past input and error information to improve the system's tracking performance. In particular, it can achieve perfect tracking even in the presence of model uncertainties. Starting from the work by \cite{arimoto1984bettering}, ILC has attracted intensive research in the last few decades and now has many applications.

Depending on whether the system model information is utilised, ILC designs can be classified as model-based ILC and model-free ILC. With system model information, model-based designs can achieve excellent tracking performance, e.g. monotonic convergence. In practice, the accurate system model may be expensive to obtain, making model-based algorithms challenging to implement. To address this limitation, this thesis studies data-driven ILC algorithms using the well-known Willems' fundamental lemma, which shows that linear system behaviour can be presented by a given persistently exciting trajectory.

Based on Willems' fundamental lemma, a novel data-driven norm optimal ILC (NOILC) algorithm is proposed to eliminate the requirement of the model-based NOILC algorithm on the system model. It shows that the developed algorithm achieves identical tracking performance to the model-based NOILC algorithm. We also show the algorithm can handle system constraints. Two extensions are then developed to relax the persistent excitation condition of the existing input data: the receding-horizon-based data-driven NOILC algorithm and the trial-partition-based data-driven NOILC algorithm. To demonstrate the generality of our proposed data-driven framework, we study two practical ILC applications, namely point-to-point tracking tasks and consensus tracking tasks. The simulation examples are provided to verify the effectiveness of the proposed algorithms.

Text
Thesis_Final - Version of Record
Restricted to Repository staff only until 8 January 2026.
Available under License University of Southampton Thesis Licence.
Text
Final-thesis-submission-Examination-Mr-Zheng-Jiang (2)
Restricted to Repository staff only

More information

Published date: January 2025

Identifiers

Local EPrints ID: 497231
URI: http://eprints.soton.ac.uk/id/eprint/497231
PURE UUID: 904e733c-492f-4c05-8ce9-dcd58c28ef2c
ORCID for Bing Chu: ORCID iD orcid.org/0000-0002-2711-8717

Catalogue record

Date deposited: 16 Jan 2025 17:36
Last modified: 08 Feb 2025 02:47

Export record

Contributors

Author: Zheng Jiang
Thesis advisor: Bing Chu ORCID iD
Thesis advisor: Paolo Rapisarda

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×