A min-max robust DDPC method is introduced via uncertainty sets derived from non-unique behavioral solutions, yielding convex reformulations, feedback extensions, and performance guarantees under bounded noise.
Bridging direct and indirect data-driven control formulations via regularizations and relaxations,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Min-Max Robust Data-Driven Predictive Control Considering Non-Unique Solutions to Behavioral Representation
A min-max robust DDPC method is introduced via uncertainty sets derived from non-unique behavioral solutions, yielding convex reformulations, feedback extensions, and performance guarantees under bounded noise.