TY  - JOUR
SN  - 0005-1098
Y1  - 2003///
N2  - 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.
JF  - Automatica
VL  - 39
PB  - Elsevier
EP  - 950
A1  - Tondel, Petter
A1  - Johansen, Tor Arne
A1  - Bemporad, Alberto
SP  - 945
ID  - eprints460
TI  - Evaluation of piecewise affine control via binary search tree
AV  - none
KW  - Piecewise linear controllers; Hybrid systems
UR  - http://www.sciencedirect.com/science/article/pii/S0005109802003084
IS  - 5
ER  -