Discrete-time and sampled-data anti-windup synthesis: stability and performance

Herrmann, Guido, Turner, Matthew and Postlethwaite, Ian (2006) Discrete-time and sampled-data anti-windup synthesis: stability and performance. International Journal of Systems Science, 37 (2). pp. 91-113. ISSN 0020-7721

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1080/00207720500444074


The anti-windup (AW) problem is formulated in discrete time using a configuration which effectively decouples the nominal linear and nonlinear parts of a closed loop system with constrained plant inputs. Conditions are divided which ensure an upper bound on the induced l2 norm of a certain mapping which is central to the anti-windup problem. Results are given for the full-order case, where a solution always exists, and for static and low-order cases, where a solution does not necessarily exist, but which is often more appealing from a practical point of view The anti-windup problem is also framed and solved for continous-time systems under sampled-data control. It is proved that the stability of the anti-windup compensator loop is equivalent to a purely discrete-time problem, while a hybrid induced norm is used for performance recovery. The performance problem is solved using linear sampled-data lifting techniques to transpose the problem into the purely discrete domain. The results of the paper are demonstrated on a flight control example.

Item Type: Article
Subjects: H600 Electronic and Electrical Engineering
Department: Faculties > Engineering and Environment > Mathematics, Physics and Electrical Engineering
Depositing User: Sarah Howells
Date Deposited: 11 Dec 2012 10:35
Last Modified: 13 Oct 2019 00:23
URI: http://nrl.northumbria.ac.uk/id/eprint/10664

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics