Brief paper: On feasible sets for MPC and their approximations

Authors:
Francesco Scibilia;Sorin Olaru;Morten Hovd
Affiliations:
Department of Engineering Cybernetics, Norwegian University of Science and Technology, N-7491 Trondheim, Norway;SUPELEC Systems Sciences (E3S), Automatic Control Department, Gif-sur-Yvette, 91192, France;Department of Engineering Cybernetics, Norwegian University of Science and Technology, N-7491 Trondheim, Norway
Venue:
Automatica (Journal of IFAC)
Year:
2011

Citing 7
Cited 1

Minkowski addition of polytopes: computational complexity and applications to Gro¨bner bases

SIAM Journal on Discrete Mathematics
Linear time approximation of 3D convex polytopes

Computational Geometry: Theory and Applications
An Algorithm for Approximate Multiparametric Convex Programming

Computational Optimization and Applications
Set-Theoretic Methods in Control

Set-Theoretic Methods in Control
Survey Constrained model predictive control: Stability and optimality

Automatica (Journal of IFAC)
The explicit linear quadratic regulator for constrained systems

Automatica (Journal of IFAC)
Brief An algorithm for multi-parametric quadratic programming and explicit MPC solutions

Automatica (Journal of IFAC)

Control with constraints for linear stationary systems: An interpolation approach

Automation and Remote Control

Quantified Score

Hi-index	22.14

Visualization

Abstract

In this paper we are interested in the computation of feasible sets for linear model predictive control techniques, based on set relations and not on the conventional orthogonal projection. Further, the problem of computing suitable inner approximations of the feasible sets is considered. Such approximations are characterized by simpler polytopic representations, and preserve essential properties as convexity, positive invariance, inclusion of the set of expected initial states.