Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A fast and effective heuristic for the feedback arc set problem
Information Processing Letters
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Interconnected automata and linear systems: a theoretical framework in discrete-time
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Hierarchical Hybrid Modeling of Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Control of systems integrating logic, dynamics, and constraints
Automatica (Journal of IFAC)
Brief Model predictive control for max-plus-linear discrete event systems
Automatica (Journal of IFAC)
Brief Equivalence of hybrid dynamical models
Automatica (Journal of IFAC)
Optimal complexity reduction of polyhedral piecewise affine systems
Automatica (Journal of IFAC)
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
MARTHA: architecture for control and emulation of power electronics and smart grid systems
Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
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.