Tondel, Petter and Johansen, Tor Arne and Bemporad, Alberto Computation and approximation of piecewise affine control via binary search tree. In: Decision and Control Conference. IEEE, Las Vegas, Nevada USA, December 2002, pp. 3144-3149. ISBN 0-7803-7516-5 (2002)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Uncontrolled Keywords:||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|
|Subjects:||Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > TJ Mechanical engineering and machinery
|Research Area:||Computer Science and Applications|
|Depositing User:||Professor Alberto Bemporad|
|Date Deposited:||27 Jul 2011 09:08|
|Last Modified:||08 Aug 2011 08:13|
Actions (login required)