Efficient mode enumeration of compositional hybrid systems

  • Authors:
  • Tobias Geyer;Fabio Danilo Torrisi;Manfred Morari

  • Affiliations:
  • Automatic Control Laboratory, Swiss Federal Institute of Technology, Zurich, Switzerland;Automatic Control Laboratory, Swiss Federal Institute of Technology, Zurich, Switzerland;Automatic Control Laboratory, Swiss Federal Institute of Technology, Zurich, Switzerland

  • Venue:
  • HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A hyperplane arrangement is a polyhedral cell complex where the relative position of each cell of the arrangement and the composing hyperplanes are summarized by a sign vector computable in polynomial time. This tool from computational geometry enables the development of a fast and efficient algorithm that translates the composition of hybrid systems into a piecewise affine model. The tool provides also information on the real combinatorial degree of the system which can be used to reduce the size of the search tree and the computation time of the optimization algorithms underlying optimal and model predictive control.