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.

Computation and approximation of piecewise affine control laws via binary search trees

Bemporad A.
2002

Abstract

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.
0-7803-7516-5
File in questo prodotto:
File Dimensione Formato  
Computation_and_approximation_of_piecewise_affine_control_laws_via_binary_search_trees (1).pdf

non disponibili

Tipologia: Versione Editoriale (PDF)
Licenza: Nessuna licenza
Dimensione 568.36 kB
Formato Adobe PDF
568.36 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11771/20232
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 36
social impact