Accelerated norm-optimal iterative learning control algorithms using successive projection
Accelerated norm-optimal iterative learning control algorithms using successive projection
This article proposes a novel technique for accelerating the convergence of the previously published norm-optimal iterative learning control (NOILC) methodology. The basis of the results is a formal proof of an observation made by D.H. Owens, namely that the NOILC algorithm is equivalent to a successive projection algorithm between linear varieties in a suitable product Hilbert space. This leads to two proposed accelerated algorithms together with well-defined convergence properties. The results show that the proposed accelerated algorithms are capable of ensuring monotonic error norm reductions and can outperform NOILC by more rapid reductions in error norm from iteration to iteration. In particular, examples indicate that the approach can improve the performance of NOILC for the problematic case of non-minimum phase systems. Realisation of the algorithms is discussed and numerical simulations are provided for comparative purposes and to demonstrate the numerical performance and effectiveness of the proposed methods.
1469-1484
Chu, Bing
555a86a5-0198-4242-8525-3492349d4f0f
Owens, David H.
dca0ba32-aba6-4bab-a511-9bd322da16df
2009
Chu, Bing
555a86a5-0198-4242-8525-3492349d4f0f
Owens, David H.
dca0ba32-aba6-4bab-a511-9bd322da16df
Chu, Bing and Owens, David H.
(2009)
Accelerated norm-optimal iterative learning control algorithms using successive projection.
International Journal of Control, 82 (8), .
(doi:10.1080/00207170802512824).
Abstract
This article proposes a novel technique for accelerating the convergence of the previously published norm-optimal iterative learning control (NOILC) methodology. The basis of the results is a formal proof of an observation made by D.H. Owens, namely that the NOILC algorithm is equivalent to a successive projection algorithm between linear varieties in a suitable product Hilbert space. This leads to two proposed accelerated algorithms together with well-defined convergence properties. The results show that the proposed accelerated algorithms are capable of ensuring monotonic error norm reductions and can outperform NOILC by more rapid reductions in error norm from iteration to iteration. In particular, examples indicate that the approach can improve the performance of NOILC for the problematic case of non-minimum phase systems. Realisation of the algorithms is discussed and numerical simulations are provided for comparative purposes and to demonstrate the numerical performance and effectiveness of the proposed methods.
This record has no associated files available for download.
More information
e-pub ahead of print date: 18 June 2009
Published date: 2009
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 336247
URI: http://eprints.soton.ac.uk/id/eprint/336247
ISSN: 0020-3270
PURE UUID: 39f7c46c-4b47-45c0-b728-d262f703782d
Catalogue record
Date deposited: 20 Mar 2012 14:29
Last modified: 15 Mar 2024 03:42
Export record
Altmetrics
Contributors
Author:
Bing Chu
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