Complexity reduction in explicit MPC: a reachability approach (Q1729125)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7030076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity reduction in explicit MPC: a reachability approach |
scientific article; zbMATH DE number 7030076 |
Statements
Complexity reduction in explicit MPC: a reachability approach (English)
0 references
27 February 2019
0 references
model predictive control
0 references
complexity
0 references
reachability
0 references
parametric optimization
0 references
mixed-integer optimization
0 references
0 references
0.8184307813644409
0 references
0.7741067409515381
0 references
0.7683262825012207
0 references
0.7611193060874939
0 references
0.7591400742530823
0 references
