Technical Communique: Evaluation of piecewise affine control via binary search tree

By Petter Tøndel, T. A. Johansen, Alberto Bemporad. 2003

407 citations recorded by the source corpus.

Subfields: Control and Systems Engineering

View Paper: https://www.semanticscholar.org/paper/25602c2b29a9c2e688114f842a331fdce081f12f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

1. Francesco Borrelli
2. Manfred Morari
3. Alberto Bemporad
4. Alessandro Alessio
5. Urban Maeder
6. Eric C. Kerrigan
7. David Q. Mayne
8. Ali Mesbah

Citations in the corpus

• Min-max control of constrained uncertain discrete-time linear systems (2003, background): “In [28] and [ 29 ], efficient algorithms for the online evaluation of the explicit optimal control law were presented, where efficiency is in terms of storage and computational complexity.”
• A survey on explicit model predictive control (2009, background): “In [69] the authors suggest to organize the hyperplanes defining the regions on a binary search tree (possibly further subdividing some of the regions), so that the time to locate the state vector on-line within the partition becomes logarithmic in the number of stored cells and memory space is save”
• Design and Implementation of Model Predictive Control for Electrical Motor Drives (2009, neutral): “Instead of verifying whether the state is within a region, a binary search tree is built [ 21 ].”