H∞ and guaranteed cost control of discrete linear repetitive processes
H∞ and guaranteed cost control of discrete linear repetitive processes
Repetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. In general, they cannot be controlled by direct extension of existing techniques from either standard (termed 1D here) or 2D systems theory. Here first we give major new results on the design of control laws using an H∞ setting and including the possibility of uncertainty in the process model. Then we give the first ever results on guaranteed cost control, i.e. including a performance criterion in the design. The designs in both cases can be computed using linear matrix inequalities. These results are for so-called discrete linear repetitive processes which arise in applications areas such as iterative learning control.
93-131
Paszke, W
7f08c6f0-79bf-40d9-8957-17581bbb8687
Galkowski, K
65b638be-b5a5-4e25-b1b8-e152c08a1cbb
Rogers, E
611b1de0-c505-472e-a03f-c5294c63bb72
Owens, D H
db24b8ef-282b-47c0-9cd2-75e91d312ad7
2006
Paszke, W
7f08c6f0-79bf-40d9-8957-17581bbb8687
Galkowski, K
65b638be-b5a5-4e25-b1b8-e152c08a1cbb
Rogers, E
611b1de0-c505-472e-a03f-c5294c63bb72
Owens, D H
db24b8ef-282b-47c0-9cd2-75e91d312ad7
Paszke, W, Galkowski, K, Rogers, E and Owens, D H
(2006)
H∞ and guaranteed cost control of discrete linear repetitive processes.
Linear Algebra and Its Applications, 412, .
Abstract
Repetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. In general, they cannot be controlled by direct extension of existing techniques from either standard (termed 1D here) or 2D systems theory. Here first we give major new results on the design of control laws using an H∞ setting and including the possibility of uncertainty in the process model. Then we give the first ever results on guaranteed cost control, i.e. including a performance criterion in the design. The designs in both cases can be computed using linear matrix inequalities. These results are for so-called discrete linear repetitive processes which arise in applications areas such as iterative learning control.
More information
Published date: 2006
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 264349
URI: http://eprints.soton.ac.uk/id/eprint/264349
ISSN: 0024-3795
PURE UUID: cd1b38f7-5b85-4cb0-8663-0918c0b8692f
Catalogue record
Date deposited: 27 Jul 2007
Last modified: 15 Mar 2024 02:42
Export record
Contributors
Author:
W Paszke
Author:
K Galkowski
Author:
E Rogers
Author:
D 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