System level disturbance reachable sets and their application to tube-based MPC
نویسندگان
چکیده
Tube-based model predictive control (MPC) methods leverage tubes to bound deviations from a nominal trajectory due uncertainties in order ensure constraint satisfaction. This paper presents novel tube?based MPC formulation based on system level disturbance reachable sets (SL?DRS), which the affine parameterization (SLP). We show that imposing finite impulse response (FIR) SLP guarantees containment of all future sequence SL?DRS. allows us formulate tube?MPC (SLTMPC) method using SL?DRS as tubes, enables concurrent optimization and while positively invariant terminal set. Finally, we can also be computed offline.
منابع مشابه
Validating a Hamilton-Jacobi Approximation to Hybrid System Reachable Sets
We develop a general framework for solving the hybrid system reachability problem, and indicate how several published techniques fit into this framework. The key unresolved need of any hybrid system reachability algorithm is the computation of continuous reachable sets; consequently, we present new results on techniques for calculating numerical approximations of such sets evolving under genera...
متن کاملTube-Based MPC: a Contraction Theory Approach
The objective of this paper is to devise a systematic approach to apply the tube MPC framework to non-linear continuous-time systems. In tube MPC, an ancillary feedback controller is designed to keep the actual state within an invariant “tube” around a nominal trajectory computed neglecting disturbances. Our approach is to leverage recent results in contraction theory together with tools from c...
متن کاملReachable sets concept - a
A control problem over the infinite time horizon for periodical system is considered. Our aim is to analyze a special concept of solving problems of this type, based on the known idea of reachable sets. We try to consider this concept in a more general manner than it was done in earlier works and to find what is really essential in it. The algorithm corresponding to the proposed general descrip...
متن کاملComputing Reachable Sets : An Introduction
This paper provides a tutorial introduction to reachability computation, a new class of computational techniques developed in order to export verification technology toward continuous and hybrid systems.
متن کاملMinkowski Content for Reachable Sets
In 1955, Martin Kneser showed that the Minkowski content of a compact p-rectifiable subset M of Rn is equal to its p-Hausdorff measure: lim t→0,t>0 Ln ` B(M, t) ́ α(n− p) tn−p = H(M). We extend his result to the reachable sets of a linear control system
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Control
سال: 2022
ISSN: ['0947-3580', '1435-5671']
DOI: https://doi.org/10.1016/j.ejcon.2022.100680