Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Optimal Complexity Reduction of Piecewise Affine Models Based on Hyperplane Arrangements


T. Geyer, F.D. Torrisi, M. Morari

American Control Conference, Boston, Massachusetts, pp. 1190 - 1195

This paper presents an algorithm that, given a piecewise affine (PWA) model, derives an equivalent PWA model that is minimal in the number of regions. The algorithm is based on the cells of the hyperplane arrangement that are already given when the PWA model is the result of the mode enumeration algorithm. In particular, the algorithm executes a branch and bound search on the markings of the cells of the hyperplane arrangement assuring optimality. As we refrain from solving additional LPs, the algorithm is not only optimal but also computationally attractive. The applicability of the algorithm can be extended to derive minimal PWA representations of general PWA models by first computing the hyperplane arrangement. An example illustrates the algorithm and shows its computational effectiveness.

Further Information

Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { GeyTor:2004:IFA_151,
    author={T. Geyer and F.D. Torrisi and M. Morari},
    title={{Optimal Complexity Reduction of Piecewise Affine Models
	  Based on Hyperplane Arrangements}},
    booktitle={American Control Conference},
    pages={1190 -- 1195},
    address={Boston, Massachusetts},
Permanent link