The University of Southampton
University of Southampton Institutional Repository

Nonlinear Iterative Learning by an Adaptive Lyapunov Technique

Nonlinear Iterative Learning by an Adaptive Lyapunov Technique
Nonlinear Iterative Learning by an Adaptive Lyapunov Technique
We consider the iterative learning control problem from an adaptive control viewpoint. It is shown that many standard adaptive designs can be modified in a straightforward manner to give a solution to either the feedback or feedforward ILC problem. In particular, we show that many of the common assumptions of nonlinear iterative learning control can be relaxed, eg. we relax the common linear growth assumption on the nonlinearities and handle systems of arbitrary relative degree. Furthermore it is shown that these new ILC designs have the power to solve a new ILC problem: the learning of unseen trajectories (generalization). It is shown that generally a linear rate of convergence of the MSE can be achieved, and some simple robustness analyses are given. For linear plants we show that a linear arte of MSE convergence can be achieved for non-minimum phase plants.
840-850
French, M.
22958f0e-d779-4999-adf6-2711e2d910f8
Rogers, E.
611b1de0-c505-472e-a03f-c5294c63bb72
French, M.
22958f0e-d779-4999-adf6-2711e2d910f8
Rogers, E.
611b1de0-c505-472e-a03f-c5294c63bb72

French, M. and Rogers, E. (2000) Nonlinear Iterative Learning by an Adaptive Lyapunov Technique. International Journal of Control, 73 (10), 840-850.

Record type: Article

Abstract

We consider the iterative learning control problem from an adaptive control viewpoint. It is shown that many standard adaptive designs can be modified in a straightforward manner to give a solution to either the feedback or feedforward ILC problem. In particular, we show that many of the common assumptions of nonlinear iterative learning control can be relaxed, eg. we relax the common linear growth assumption on the nonlinearities and handle systems of arbitrary relative degree. Furthermore it is shown that these new ILC designs have the power to solve a new ILC problem: the learning of unseen trajectories (generalization). It is shown that generally a linear rate of convergence of the MSE can be achieved, and some simple robustness analyses are given. For linear plants we show that a linear arte of MSE convergence can be achieved for non-minimum phase plants.

Other
ijcit2.ps - Other
Download (740kB)

More information

Published date: 2000
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 252226
URI: http://eprints.soton.ac.uk/id/eprint/252226
PURE UUID: acf9d011-a535-4934-9580-bf7bd06eae24
ORCID for E. Rogers: ORCID iD orcid.org/0000-0003-0179-9398

Catalogue record

Date deposited: 22 Sep 2000
Last modified: 15 Mar 2024 02:42

Export record

Contributors

Author: M. French
Author: E. Rogers ORCID iD

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.

×