On the hyperplanes arrangements in mixed-integer techniques

This paper is concerned with the improved constraints handling in mixed-integer optimization problems. The novel element is the reduction of the number of binary variables used for expressing the complement of a convex (polytopic) region. As a generalization, the problem of representing the complement of a possibly non-connected union of such convex sets is detailed. In order to illustrate the benefits of the proposed improvements, a practical implementation, the problem of obstacle avoidance using receding horizon optimization techniques is considered.

[1]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[2]  Raffaello D'Andrea,et al.  Iterative MILP methods for vehicle-control problems , 2005, IEEE Transactions on Robotics.

[3]  Jonathan P. How,et al.  Model predictive control of vehicle maneuvers with guaranteed completion time and robust feasibility , 2003, Proceedings of the 2003 American Control Conference, 2003..

[4]  E. Campbell,et al.  Establishing Trajectories for Multi-Vehicle Reconnaissance , 2004 .

[5]  G. Ziegler.  Lectures on Polytopes , 1994 .

[6]  S. Olaru,et al.  Reference governor for tracking with fault detection capabilities , 2010, 2010 Conference on Control and Fault-Tolerant Systems (SysTol).

[7]  T. Zaslavsky.  Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[8]  Didier Dumur,et al.  Avoiding constraints redundancy in predictive control optimization routines , 2005, IEEE Transactions on Automatic Control.

[9]  Andrzej J. Osiadacz.  Integer and combinatorial optimization, George L. Nemhauser and Laurence A. Wolsey, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York, 1988, ISBN 0-471-82819-X, 763pp, £71.90 , 1990 .

[10]  Micha Sharir,et al.  On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..

[11]  David Q. Mayne,et al.  Constrained model predictive control: Stability and optimality , 2000, Autom..

[12]  Steven L. Waslander,et al.  Tunnel-MILP: Path Planning with Sequential Convex Polytopes , 2008, AIAA Guidance, Navigation and Control Conference and Exhibit.

[13]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[14]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[17]  Alberto Bemporad,et al.  Control of systems integrating logic, dynamics, and constraints , 1999, Autom..

[18]  Jonathan P. How,et al.  Receding horizon control of autonomous aerial vehicles , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[19]  R. D'Andrea,et al.  Modeling and control of a multi-agent system using mixed integer linear programming , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[20]  B. Moor,et al.  Mixed integer programming for multi-vehicle path planning , 2001, 2001 European Control Conference (ECC).