Luca Zaccarian

Modern anti-windup synthesis : control augmentation for actuator saturation

This book provides a wide variety of state-space--based numerical algorithms for the synthesis of feedback algorithms for linear systems with input saturation. Specifically, it addresses and solves the anti-windup problem, presenting the objectives and terminology of the problem, the mathematical tools behind anti-windup algorithms, and more than twenty algorithms for anti-windup synthesis, illustrated with examples. Luca Zaccarian and Andrew Teels modern method--combining a state-space approach with algorithms generated by solving linear matrix inequalities--treats MIMO and SISO systems with equal ease. The book, aimed at control engineers as well as graduate students, ranges from very simple anti-windup construction to sophisticated anti-windup algorithms for nonlinear systems. * Describes the fundamental objectives and principles behind anti-windup synthesis for control systems with actuator saturation * Takes a modern, state-space approach to synthesis that applies to both SISO and MIMO systems * Presents algorithms as linear matrix inequalities that can be readily solved with widely available software * Explains mathematical concepts that motivate synthesis algorithms * Uses nonlinear performance curves to quantify performance relative to disturbances of varying magnitudes * Includes anti-windup algorithms for a class of Euler-Lagrange nonlinear systems * Traces the history of anti-windup research through an extensive annotated bibliography

Linear discrete-time global and regional anti-windup: an LMI approach

In this article we address linear anti-windup design for linear discrete-time control systems guaranteeing regional and global stability and performance. The techniques that we develop are the discrete-time counterpart of existing techniques for anti-windup augmentation which lead to convex constructions by way of linear matrix inequalities (LMIs) when adopting static and plant order anti-windup augmentation. Interesting system theoretic interpretations of the performance bounds for the non-linear closed loop can also be given. We show here that parallel results apply to the discrete-time case. We derive the corresponding conditions and prove their effectiveness by adapting the continuous-time approaches to the discrete-time case.