On Min-Max Robust Data-Driven Predictive Control Considering Non-Unique Solutions to Behavioral Representation
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917428434305024 |
|---|---|
| author | Wang, Yibo Liu, Qingyuan Shang, Chao |
| author_facet | Wang, Yibo Liu, Qingyuan Shang, Chao |
| contents | Direct data-driven control methods are known to be vulnerable to uncertainty in stochastic systems. In this paper, we propose a new robust data-driven predictive control (DDPC) framework. By analyzing non-unique solutions to behavioral representation, we gain insight into the inherent lack of robustness in subspace predictive control (SPC) and its projection-based regularized variant. This stimulates us to construct an uncertainty set that captures all admissible output trajectories deviating from nominal subspace predictions, which results in a min-max robust formulation of DDPC that endows control sequences with robustness against such unknown deviations. We establish theoretical performance guarantees under bounded additive noise and develop tractable convex reformulations. To mitigate the conservatism of robust design, a feedback robust DDPC scheme is further proposed by incorporating an affine feedback policy. Simulation studies show that the proposed methods effectively robustify SPC and outperform the projection-based regularization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17350 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Min-Max Robust Data-Driven Predictive Control Considering Non-Unique Solutions to Behavioral Representation Wang, Yibo Liu, Qingyuan Shang, Chao Optimization and Control Direct data-driven control methods are known to be vulnerable to uncertainty in stochastic systems. In this paper, we propose a new robust data-driven predictive control (DDPC) framework. By analyzing non-unique solutions to behavioral representation, we gain insight into the inherent lack of robustness in subspace predictive control (SPC) and its projection-based regularized variant. This stimulates us to construct an uncertainty set that captures all admissible output trajectories deviating from nominal subspace predictions, which results in a min-max robust formulation of DDPC that endows control sequences with robustness against such unknown deviations. We establish theoretical performance guarantees under bounded additive noise and develop tractable convex reformulations. To mitigate the conservatism of robust design, a feedback robust DDPC scheme is further proposed by incorporating an affine feedback policy. Simulation studies show that the proposed methods effectively robustify SPC and outperform the projection-based regularization. |
| title | On Min-Max Robust Data-Driven Predictive Control Considering Non-Unique Solutions to Behavioral Representation |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2501.17350 |