eprintid: 462
rev_number: 9
eprint_status: archive
userid: 7
dir: disk0/00/00/04/62
datestamp: 2011-07-27 08:53:24
lastmod: 2011-08-04 07:29:08
status_changed: 2011-07-27 08:53:24
type: article
metadata_visibility: show
contact_email: alberto.bemporad@imtlucca.it
item_issues_count: 0
creators_name: Bemporad, Alberto
creators_name: Teel, Andrew R.
creators_name: Zaccarian, Luca
creators_id: alberto.bemporad@imtlucca.it
creators_id: 
creators_id: 
title: Anti-windup synthesis via sampled-data piecewise affine optimal control
ispublished: pub
subjects: QA75
subjects: T1
divisions: CSA
full_text_status: none
keywords: Anti-windup design; Input saturation; Sampled-data systems; Piecewise a ne systems
abstract: Discrete-time receding horizon optimal control is employed in model-based anti-windup augmentation. The optimal control formulation enables designs that minimize the mismatch between the unconstrained closed-loop response with a given controller and the constrained closed-loop response with anti-windup augmentation. Recently developed techniques for off-line computation of the constrained linear regulator's solution, which is piecewise affine, facilitate implementation. The resulting sampled-data, anti-windup closed-loop system's properties are established and its performance is demonstrated on a simulation example.
date: 2004-04
date_type: published
publication: Automatica
volume: 40
number: 4
publisher: Elsevier
pagerange: 549-562
id_number: 10.1016/j.automatica.2003.11.004
refereed: TRUE
issn: 0005-1098
related_url_url: http://www.sciencedirect.com/science/article/pii/S0005109803003625
funders: This work was supported in part by the European Community through project “CC-Computation and Control” IST-2001-33520, AFOSR Grant Numbers F49620-00-1-0106 and F49620-03-1-0203, NSF Grant Number ECS-9988813, ASI and MIUR through PRIN project MATRICS and F
citation:   Bemporad, Alberto and Teel, Andrew R. and Zaccarian, Luca  Anti-windup synthesis via sampled-data piecewise affine optimal control.  Automatica, 40 (4).  pp. 549-562.  ISSN 0005-1098      (2004)