On feasible sets for MPC and their approximations - Archive ouverte HAL Access content directly
Journal Articles Automatica Year : 2011

On feasible sets for MPC and their approximations

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.
Not file

Dates and versions

hal-00657848 , version 1 (09-01-2012)

Identifiers

Cite

F. Scibilia, Sorin Olaru, Morten Hovd. On feasible sets for MPC and their approximations. Automatica, 2011, 47 (1), pp.133-139. ⟨10.1016/j.automatica.2010.10.022⟩. ⟨hal-00657848⟩
16 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More