The University of Southampton
University of Southampton Institutional Repository

Combined inverse and gradient iterative learning control: performance, monotonicity, robustness and non-minimum-phase zeros

Combined inverse and gradient iterative learning control: performance, monotonicity, robustness and non-minimum-phase zeros
Combined inverse and gradient iterative learning control: performance, monotonicity, robustness and non-minimum-phase zeros
Based on recent papers that have demonstrated that robust iterative learning control can be based on parameter optimization using either the inverse plant or gradient concepts, this paper presents a unification of these ideas for discrete-time systems that not only retains the convergence properties and the robustness properties derived in previous papers but also permits the inclusion of filters in the input update formula and a detailed analysis of the effect of non-minimum-phase dynamics on algorithm performance in terms of a ‘plateauing’ or ‘flat-lining’ effect in the error norm evolution. Although the analysis is in the time domain, the robustness conditions are expressed as frequency domain inequalities. The special case of a version of the inverse algorithm that can be used to construct a robust stable anti-causal inverse non-minimum-phase plant is presented and analysed in detail.
1049-8923
406-431
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
555a86a5-0198-4242-8525-3492349d4f0f

Owens, David H. and Chu, Bing (2014) Combined inverse and gradient iterative learning control: performance, monotonicity, robustness and non-minimum-phase zeros. International Journal of Robust and Nonlinear Control, 24 (3), 406-431. (doi:10.1002/rnc.2893).

Record type: Article

Abstract

Based on recent papers that have demonstrated that robust iterative learning control can be based on parameter optimization using either the inverse plant or gradient concepts, this paper presents a unification of these ideas for discrete-time systems that not only retains the convergence properties and the robustness properties derived in previous papers but also permits the inclusion of filters in the input update formula and a detailed analysis of the effect of non-minimum-phase dynamics on algorithm performance in terms of a ‘plateauing’ or ‘flat-lining’ effect in the error norm evolution. Although the analysis is in the time domain, the robustness conditions are expressed as frequency domain inequalities. The special case of a version of the inverse algorithm that can be used to construct a robust stable anti-causal inverse non-minimum-phase plant is presented and analysed in detail.

This record has no associated files available for download.

More information

Published date: 1 February 2014

Identifiers

Local EPrints ID: 472443
URI: http://eprints.soton.ac.uk/id/eprint/472443
ISSN: 1049-8923
PURE UUID: 85a2607b-1746-42b2-9108-e46e27d36a6e
ORCID for Bing Chu: ORCID iD orcid.org/0000-0002-2711-8717

Catalogue record

Date deposited: 05 Dec 2022 18:07
Last modified: 17 Mar 2024 03:28

Export record

Altmetrics

Contributors

Author: David H. Owens
Author: Bing Chu 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.

×