Hyperplane Arrangements in Mixed-Integer Programming Techniques. Collision Avoidance Application with Zonotopic Sets

Abstract : The current paper addresses the problem of minimizing the computational complexity of optimization problems with non-convex and possibly non-connected feasible region of polyhedral type. Using hyperplane arrangements and Mixed-Integer Programming we provide an efficient description of the feasible region in the solution space. Moreover, we exploit the geometric properties of the hyperplane arrangements and adapt this description in order to provide an efficient solution of the mixed-integer optimization problem. Furthermore, a zonotopic representation of the sets appearing in the problem is considered. The advantages of this representation are highlighted and exploited through proof of concepts illustrations as well as simulation results.
Document type :
Conference papers
Complete list of metadatas

https://hal-supelec.archives-ouvertes.fr/hal-00827206
Contributor : Josiane Dartron <>
Submitted on : Wednesday, May 29, 2013 - 8:38:37 AM
Last modification on : Saturday, September 15, 2018 - 1:03:06 AM

Identifiers

Collections

Citation

Florin Stoican, Ionela Prodan, Sorin Olaru. Hyperplane Arrangements in Mixed-Integer Programming Techniques. Collision Avoidance Application with Zonotopic Sets. 2013 European Control Conference (ECC), Jul 2013, Zurich, Switzerland. pp.CD-Rom, ⟨10.23919/ECC.2013.6669645⟩. ⟨hal-00827206⟩

Share

Metrics

Record views

184