Efficient min–max MPC: Achieving a large domain of attraction with short horizon (Q6154587)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient min–max MPC: Achieving a large domain of attraction with short horizon |
scientific article; zbMATH DE number 7816424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient min–max MPC: Achieving a large domain of attraction with short horizon |
scientific article; zbMATH DE number 7816424 |
Statements
Efficient min–max MPC: Achieving a large domain of attraction with short horizon (English)
0 references
12 March 2024
0 references
ADMM
0 references
invariant set
0 references
linear matrix inequalities (LMI)
0 references
state and input constraint
0 references
uncertain linear system
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
