zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
An ellipsoidal off-line MPC scheme for uncertain polytopic discrete-time systems. (English) Zbl 1153.93363
Summary: An off-line Model Predictive Control (MPC) method based on ellipsoidal calculus and viability theory is described in order to address control problems in the presence of state and input constraints for uncertain polytopic linear plants subject to persistent disturbances. In order to reduce the computational burdens and conservativeness of traditional polytopic MPC schemes, the present approach carries out off-line most of the computations and it makes use of closed-loop predictions to improve the control performance. This is done by recursively pre-computing suitable ellipsoidal inner approximations of the exact controllable sets and solving on-line a simple and numerically low-demanding optimization problem subject to a set-membership constraint. Comparisons with three other recent off-line MPC approaches are also provided in the final example.
93B40Computational methods in systems theory
93C55Discrete-time control systems