TY  - CHAP
KW  - approximate function; binary search trees; explicit model predictive control; piecewise affine control laws; polyhedral partition; computational complexity; functions; linear programming; linear systems; predictive control; tree searching
CY  - Las Vegas, Nevada USA, December 2002
Y1  - 2002///
M1  - 3
A1  - Tondel, Petter
A1  - Johansen, Tor Arne
A1  - Bemporad, Alberto
UR  - http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1184353&isnumber=26568
SP  - 3144
TI  - Computation and approximation of piecewise affine control via binary search tree
AV  - none
T2  - Decision and Control Conference
PB  - IEEE
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 (MPC), as it allows the controller to be implemented on-line with small computational effort. The computation time is logarithmic in the number of regions in the PWA partition. A method for generating an approximate PWA function based on a binary search tree is also presented, giving further simplification of PWA control.
EP  - 3149
ID  - eprints547
SN  - 0-7803-7516-5 
ER  -