Evaluation of piecewise affine control via binary search tree

被引：245

作者：

Tondel, P ^{[1
]}

Johansen, TA

Bemporad, A

机构：

[1] Norwegian Univ Sci & Technol, Dept Engn Cybernet, N-7491 Trondheim, Norway

[2] Univ Siena, Dipartimento Ingn Informaz, I-53100 Siena, Italy

来源：

AUTOMATICA | 2003年 / 39卷 / 05期

关键词：

piecewise linear controllers; hybrid systems;

D O I：

10.1016/S0005-1098(02)00308-4

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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, as it allows the controller to be implemented online with small computational effort. The computation time is logarithmic in the number of regions in the PWA partition. (C) 2003 Elsevier Science Ltd. All rights reserved.

引用

页码：945 / 950

页数：6

共 24 条

[1]

Aho A. V., 1983, DATA STRUCTURES ALGO

[2] The explicit linear quadratic regulator for constrained systems [J].

Bemporad, A ;

Morari, M ;

Dua, V ;

Pistikopoulos, EN .

AUTOMATICA, 2002, 38 (01) :3-20

[3]

Bemporad A, 2002, LECT NOTES COMPUT SC, V2289, P105

[4] Model predictive control based on linear programming - The explicit solution [J].

Bemporad, A ;

Borrelli, F ;

Morari, M .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2002, 47 (12) :1974-1985

[5]

Bemporad A, 2000, IEEE DECIS CONTR P, P632, DOI 10.1109/CDC.2000.912837

[6]

Bemporad A, 2000, P AMER CONTR CONF, P872, DOI 10.1109/ACC.2000.876624

[7] Convexity recognition of the union of polyhedra [J].

Bemporad, A ;

Fukuda, K ;

Torrisi, FD .

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 18 (03) :141-154

[8]

BEMPORAD A, 2003, IN PRESS J OPTIMIZAT, V117, P1

[9]

BEMPORAD A, 2003, UNPUB IEEE T AUTOMAT

[10]

Borrelli F., 2001, Hybrid Systems: Computation and Control. 4th International Workshop, HSCC 2001. Proceedings (Lecture Notes in Computer Science Vol.2034), P162

← 1 2 3 →