Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
From MaRDI portal
Publication:6180277
Abstract: Mixed-integer model predictive control (MI-MPC) can be a powerful tool for modeling hybrid control systems. In case of a linear-quadratic objective in combination with linear or piecewise-linear system dynamics and inequality constraints, MI-MPC needs to solve a mixed-integer quadratic program (MIQP) at each sampling time step. This paper presents a collection of block-sparse presolve techniques to efficiently remove decision variables, and to remove or tighten inequality constraints, tailored to mixed-integer optimal control problems (MIOCP). In addition, we describe a novel heuristic approach based on an iterative presolve algorithm to compute a feasible but possibly suboptimal MIQP solution. We present benchmarking results for a C code implementation of the proposed BB-ASIPM solver, including a branch-and-bound (B&B) method with the proposed tailored presolve techniques and an active-set based interior point method (ASIPM), compared against multiple state-of-the-art MIQP solvers on a case study of motion planning with obstacle avoidance constraints. Finally, we demonstrate the computational performance of the BB-ASIPM solver on the dSPACE Scalexio real-time embedded hardware using a second case study of stabilization for an underactuated cart-pole with soft contacts.
Recommendations
- Fast Numerical Methods for Mixed-Integer Nonlinear Model-Predictive Control
- Mixed-integer formulations for optimal control of piecewise-affine systems
- LMI-based robust mixed-integer model predictive control for hybrid systems
- PRESAS: Block‐structured preconditioning of iterative solvers within a primal active‐set method for fast model predictive control
- Efficient online solution of multi-parametric mixed-integer quadratic problems
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A general system for heuristic minimization of convex functions over non-convex sets
- An abstract model for branching and its application to mixed integer programming
- Branching rules revisited
- Control of systems integrating logic, dynamics, and constraints
- Convex relaxations for mixed integer predictive control
- Detecting infeasibility in infeasible-interior-point methods for optimization
- Dynamic programming for constrained optimal control of discrete-time linear hybrid systems
- Explicit hybrid model-predictive control: the exact solution
- Improving the feasibility pump
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Mixed integer programming: analyzing 12 years of progress
- Mixed-integer formulations for optimal control of piecewise-affine systems
- Mixed-integer quadratic programming is in NP
- Online Mixed-Integer Optimization in Milliseconds
- PRESAS: Block‐structured preconditioning of iterative solvers within a primal active‐set method for fast model predictive control
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Reductions in Mixed Integer Programming
- The integer approximation error in mixed-integer optimal control
- Warm Start of Mixed-Integer Programs for Model Predictive Control of Hybrid Systems
This page was built for publication: Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180277)
