A parametric branch and bound approach to suboptimal explicit hybrid MPC
DOI10.1016/J.AUTOMATICA.2013.10.004zbMATH Open1298.93156OpenAlexW2091238875MaRDI QIDQ463830FDOQ463830
Authors: Daniel Axehill, Thomas Besselmann, Manfred Morari, Davide Martino Raimondo 
Publication date: 17 October 2014
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105420
Recommendations
- An algorithm for multi-parametric quadratic programming and explicit MPC solutions
- Low-complexity control of hybrid systems using approximate multi-parametric MILP
- Theoretical and algorithmic advances in multi-parametric programming and control
- Suboptimal explicit receding horizon control via approximate multiparametric quadratic pro\-gramming
- Explicit hybrid model-predictive control: the exact solution
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Hybrid Systems: Computation and Control
- DC programming: overview.
- Title not available (Why is that?)
- Equivalence of hybrid dynamical models
- The explicit linear quadratic regulator for constrained systems
- Title not available (Why is that?)
- Model predictive control. With a foreword by M. J. Grimble and M. A. Johnson
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- An algorithm for the solution of multiparametric mixed integer linear programming problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Constrained optimal control of linear and hybrid systems
- Predictive control of hybrid systems: input-to-state stability results for sub-optimal solutions
- Using branch-and-bound algorithms to obtain suboptimal solutions
- A parametric branch and bound approach to suboptimal explicit hybrid MPC
- A Multiresolution Approximation Method for Fast Explicit Model Predictive Control
- Optimal Control of Piecewise Affine Systems: A Dynamic Programming Approach
Cited In (14)
- Low-Complexity Method for Hybrid MPC with Local Guarantees
- Real-time tunable approximated explicit MPC
- A solution method for stochastic multilevel programming problems. A systematic sampling evolutionary approach
- Hierarchical solution of non-convex optimal control problems with application to autonomous driving
- An algebraic and suboptimal solution of constrained model predictive control via tangent hyperbolic function
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- LMI-based robust mixed-integer model predictive control for hybrid systems
- A parametric branch and bound approach to suboptimal explicit hybrid MPC
- K-d tree based approach for point location problem in explicit model predictive control
- Low-complexity control of hybrid systems using approximate multi-parametric MILP
- A receding horizon event-driven control strategy for intelligent traffic management
- Explicit model predictive control: a connected-graph approach
- Explicit hybrid model-predictive control: the exact solution
- Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
Uses Software
This page was built for publication: A parametric branch and bound approach to suboptimal explicit hybrid MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463830)
