eprintid: 460
rev_number: 13
eprint_status: archive
userid: 7
dir: disk0/00/00/04/60
datestamp: 2011-07-27 09:04:28
lastmod: 2011-08-05 14:08:37
status_changed: 2011-07-27 09:04:28
type: article
metadata_visibility: show
contact_email: alberto.bemporad@imtlucca.it
item_issues_count: 0
creators_name: Tondel, Petter
creators_name: Johansen, Tor Arne
creators_name: Bemporad, Alberto
creators_id: 
creators_id: 
creators_id: alberto.bemporad@imtlucca.it
title: Evaluation of piecewise affine control via binary search tree
ispublished: pub
subjects: QA75
subjects: TJ
divisions: CSA
full_text_status: none
keywords: Piecewise linear controllers; Hybrid systems
abstract: We present an algorithm for generating a binary search tree that allows efficient computation of piecewise affine (PWA) functions defined on a polyhedral partition. This is useful for PWA control approaches, such as explicit model predictive control, as it allows the controller to be implemented online with small computational effort. The computation time is logarithmic in the number of regions in the PWA partition.
date: 2003
date_type: published
publication: Automatica
volume: 39
number: 5
publisher: Elsevier
pagerange: 945-950
id_number: 10.1016/S0005-1098(02)00308-4
refereed: TRUE
issn: 0005-1098
official_url: http://www.sciencedirect.com/science/article/pii/S0005109802003084
citation:   Tondel, Petter and Johansen, Tor Arne and Bemporad, Alberto  Evaluation of piecewise affine control via binary search tree.  Automatica, 39 (5).  pp. 945-950.  ISSN 0005-1098      (2003)