The University of Southampton
University of Southampton Institutional Repository

Iterative learning control for constrained linear systems

Iterative learning control for constrained linear systems
Iterative learning control for constrained linear systems
This article considers iterative learning control (ILC) for linear systems with convex control input constraints. First, the constrained ILC problem is formulated in a novel successive projection framework. Then, based on this projection method, two algorithms are proposed to solve this constrained ILC problem. The results show that, when perfect tracking is possible, both algorithms can achieve perfect tracking. The two algorithms differ, however, in that one algorithm needs much less computation than the other. When perfect tracking is not possible, both algorithms can exhibit a form of practical convergence to a ‘best approximation’. The effect of weighting matrices on the performance of the algorithms is also discussed and finally, numerical simulations are given to demonstrate the effectiveness of the proposed methods.
iterative learning control, projection method, constraint handling, norm optimisation
0020-3270
1397-1413
Chu, Bing
555a86a5-0198-4242-8525-3492349d4f0f
Owens, David H.
dca0ba32-aba6-4bab-a511-9bd322da16df
Chu, Bing
555a86a5-0198-4242-8525-3492349d4f0f
Owens, David H.
dca0ba32-aba6-4bab-a511-9bd322da16df

Chu, Bing and Owens, David H. (2010) Iterative learning control for constrained linear systems. International Journal of Control, 83 (7), 1397-1413. (doi:10.1080/00207171003758752).

Record type: Article

Abstract

This article considers iterative learning control (ILC) for linear systems with convex control input constraints. First, the constrained ILC problem is formulated in a novel successive projection framework. Then, based on this projection method, two algorithms are proposed to solve this constrained ILC problem. The results show that, when perfect tracking is possible, both algorithms can achieve perfect tracking. The two algorithms differ, however, in that one algorithm needs much less computation than the other. When perfect tracking is not possible, both algorithms can exhibit a form of practical convergence to a ‘best approximation’. The effect of weighting matrices on the performance of the algorithms is also discussed and finally, numerical simulations are given to demonstrate the effectiveness of the proposed methods.

This record has no associated files available for download.

More information

e-pub ahead of print date: 3 June 2010
Published date: July 2010
Keywords: iterative learning control, projection method, constraint handling, norm optimisation
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 336248
URI: http://eprints.soton.ac.uk/id/eprint/336248
ISSN: 0020-3270
PURE UUID: f45f35d4-375e-4592-85eb-9b0539865441
ORCID for Bing Chu: ORCID iD orcid.org/0000-0002-2711-8717

Catalogue record

Date deposited: 21 Mar 2012 11:53
Last modified: 15 Mar 2024 03:42

Export record

Altmetrics

Contributors

Author: Bing Chu ORCID iD
Author: David H. Owens

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.

×