On feasible sets for MPC and their approximations
From MaRDI portal
Publication:629062
DOI10.1016/J.AUTOMATICA.2010.10.022zbMATH Open1209.93016OpenAlexW2049023677MaRDI QIDQ629062FDOQ629062
Sorin Olaru, Morten Hovd, Francesco Scibilia
Publication date: 8 March 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2010.10.022
Recommendations
- On the Stability of the Feasible Set in Optimization Problems
- An approximation of feasible sets in semi-infinite optimization.
- A fast MPC algorithm using nonfeasible active set methods
- Approximation of reachable sets using optimal control algorithms
- The feasible set in generalized semi-infinite optimization
- On representations of the feasible set in convex optimization
- Large-Scale Scientific Computing
- Optimality of the methods for approximating the feasible criterion set in the convex case
- Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets
- On the stability of the feasible set in linear optimization
Attainable sets, reachability (93B03) Discrete-time control/observation systems (93C55) Geometric methods (93B27)
Cites Work
- Constrained model predictive control: Stability and optimality
- Linear systems with state and control constraints: the theory and application of maximal output admissible sets
- Ultimate boundedness control for uncertain discrete-time systems via set-induced Lyapunov functions
- Title not available (Why is that?)
- Set-theoretic methods in control
- The explicit linear quadratic regulator for constrained systems
- An algorithm for multi-parametric quadratic programming and explicit MPC solutions
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Title not available (Why is that?)
- On polyhedral projection and parametric programming
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Continuous selection and unique polyhedral representation of solutions to convex parametric quadratic programs
- An algorithm for approximate multiparametric convex programming
- Approximation of convex sets by polytopes
- Dropping a vertex or a facet from a convex polytope
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Linear time approximation of 3D convex polytopes
- Polytope Projection and Projection Polytopes
Cited In (12)
- Vertical hierarchical MPC for constrained linear systems
- Set operations and order reductions for constrained zonotopes
- Construction of invariant polytopic sets with specified complexity
- Numerical modeling and some optimal control problems of dynamic systems describing contact problems with friction in elasticity
- From Control Invariant Sets to an Inverse Optimality Perspective on the Constrained Control Design
- Control with constraints for linear stationary systems: an interpolation approach
- A fast MPC algorithm using nonfeasible active set methods
- A patchy approximation of explicit model predictive control
- A set-theoretic generalization of dissipativity with applications in tube MPC
- Explicit improved vertex control for uncertain, time-varying linear discrete-time systems with state and control constraints
- Minimizing setup in broadcast-optimal two round MPC
- A parametric characterization of mean-variance efficient solutions for general feasible action sets
Uses Software
This page was built for publication: On feasible sets for MPC and their approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629062)
