Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.03482 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917231772827648 |
|---|---|
| author | Gao, Yulong Yan, Shuhao Zhou, Jian Cannon, Mark |
| author_facet | Gao, Yulong Yan, Shuhao Zhou, Jian Cannon, Mark |
| contents | In this paper, we study homothetic tube model predictive control (MPC) of discrete-time linear systems subject to bounded additive disturbance and mixed constraints on the state and input. Different from most existing work on robust MPC, we assume that the true disturbance set is unknown but a conservative surrogate is available a priori. Leveraging the real-time data, we develop an online learning algorithm to approximate the true disturbance set. This approximation and the corresponding constraints in the MPC optimisation are updated online using computationally convenient linear programs. We provide statistical gaps between the true and learned disturbance sets, based on which, probabilistic recursive feasibility of homothetic tube MPC problems is discussed. Numerical simulations are provided to demonstrate the efficacy of our proposed algorithm and compare with state-of-the-art MPC algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_03482 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learning-based Homothetic Tube MPC Gao, Yulong Yan, Shuhao Zhou, Jian Cannon, Mark Systems and Control Optimization and Control In this paper, we study homothetic tube model predictive control (MPC) of discrete-time linear systems subject to bounded additive disturbance and mixed constraints on the state and input. Different from most existing work on robust MPC, we assume that the true disturbance set is unknown but a conservative surrogate is available a priori. Leveraging the real-time data, we develop an online learning algorithm to approximate the true disturbance set. This approximation and the corresponding constraints in the MPC optimisation are updated online using computationally convenient linear programs. We provide statistical gaps between the true and learned disturbance sets, based on which, probabilistic recursive feasibility of homothetic tube MPC problems is discussed. Numerical simulations are provided to demonstrate the efficacy of our proposed algorithm and compare with state-of-the-art MPC algorithms. |
| title | Learning-based Homothetic Tube MPC |
| topic | Systems and Control Optimization and Control |
| url | https://arxiv.org/abs/2505.03482 |