Low-Complexity Method for Hybrid MPC with Local Guarantees
From MaRDI portal
hybrid model predictive controliterative schemesnonsmooth and discontinuous problemsoperator splitting
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Nonsmooth analysis (49J52) Nonlinear programming (90C30) Operator-theoretic methods (93B28) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Abstract: Model predictive control problems for constrained hybrid systems are usually cast as mixed-integer optimization problems (MIP). However, commercial MIP solvers are designed to run on desktop computing platforms and are not suited for embedded applications which are typically restricted by limited computational power and memory. To alleviate these restrictions, we develop a novel low-complexity, iterative method for a class of non-convex, non-smooth optimization problems. This class of problems encompasses hybrid model predictive control problems where the dynamics are piece-wise affine (PWA). We give conditions such that the proposed algorithm has fixed points and show that, under practical assumptions, our method is guaranteed to converge locally to local minima. This is in contrast to other low-complexity methods in the literature, such as the non-convex alternating directions method of multipliers (ADMM), for which no such guarantees are known for this class of problems. By interpreting the PWA dynamics as a union of polyhedra we can exploit the problem structure and develop an algorithm based on operator splitting procedures. Our algorithm departs from the traditional MIP formulation, and leads to a simple, embeddable method that only requires matrix-vector multiplications and small-scale projections onto polyhedra. We illustrate the efficacy of the method on two numerical examples, achieving good closed-loop performance with computational times several orders of magnitude smaller compared to state-of-the-art MIP solvers. Moreover, it is competitive with ADMM in terms of suboptimality and computation time, but additionally provides local optimality and local convergence guarantees.
Recommendations
- A globally convergent, locally optimal MIN-\(H\) algorithm for hybrid optimal control
- Low-complexity control of hybrid systems using approximate multi-parametric MILP
- scientific article; zbMATH DE number 3929815
- scientific article; zbMATH DE number 3951413
- An efficient hybrid algorithm for the optimization of problems with several local minima
- scientific article; zbMATH DE number 1784934
- Local solvability of control systems with mixed constraints
- Convex dynamic programming for hybrid systems
- A parametric branch and bound approach to suboptimal explicit hybrid MPC
- Computation of local ISS Lyapunov functions with low gains via linear programming
Cites work
- A note on the measurability of convex sets
- A Parametric Nonconvex Decomposition Algorithm for Real-Time and Distributed NMPC
- A simple effective heuristic for embedded mixed-integer quadratic programming
- A Survey on Explicit Model Predictive Control
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Control of systems integrating logic, dynamics, and constraints
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Global convergence of splitting methods for nonconvex composite optimization
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Iterative approximation of fixed points
- Local differentiability of distance functions
- Mixed integer linear programming formulation techniques
- Model predictive control of magnetically actuated mass spring dampers for automotive applications
- Nonlinear optimization.
- On calculating the normal cone to a finite union of convex polyhedra†
- On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control
- On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
- Optimization-based autonomous racing of 1:43 scale RC cars
- Variational Analysis
This page was built for publication: Low-Complexity Method for Hybrid MPC with Local Guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232226)
