Evaluation of piecewise affine control via binary search tree (Q1400337)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Evaluation of piecewise affine control via binary search tree |
scientific article; zbMATH DE number 1963715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Evaluation of piecewise affine control via binary search tree |
scientific article; zbMATH DE number 1963715 |
Statements
Evaluation of piecewise affine control via binary search tree (English)
0 references
13 August 2003
0 references
An algorithm is presented for generating a binary search tree in order to compute piecewise affine functions on a piecewise polyhedral set. Applications to some control problems are indicated.
0 references
piecewise linear controllers
0 references
binary search tree
0 references
polyhedral set
0 references
0 references
0 references
0 references
0.84667724
0 references
0.84530187
0 references
0.83803254
0 references
0.8345121
0 references
0.8336509
0 references
0.83142257
0 references
0.83048475
0 references
0 references
0.8278152
0 references
0.82654697
0 references
