On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916525739343872 |
|---|---|
| author | Hartmann, Luca M. Karaca, Orcun Dorfling, Tinus Geyer, Tobias Kurpisz, Adam |
| author_facet | Hartmann, Luca M. Karaca, Orcun Dorfling, Tinus Geyer, Tobias Kurpisz, Adam |
| contents | This paper formulates a semidefinite programming relaxation for a long horizon direct-torque finite-control-set model predictive control problem. In parallel with this relaxation, a conventional branch-and-bound algorithm tailored for the original problem, but with an iteration limit to restrict its computational burden, is also solved. An input sequence candidate is extracted from the solution of the semidefinite program in the lifted space. This sequence is then compared with the so-called early-stopping branch-and-bound solution, and the best of the two is applied in a receding horizon fashion. In simulated case studies, the proposed approach exhibits significant improvements in torque transients, as the branch-and-bound alone struggles to find a meaningful solution due to the imposed limit. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_11666 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control Hartmann, Luca M. Karaca, Orcun Dorfling, Tinus Geyer, Tobias Kurpisz, Adam Optimization and Control Systems and Control This paper formulates a semidefinite programming relaxation for a long horizon direct-torque finite-control-set model predictive control problem. In parallel with this relaxation, a conventional branch-and-bound algorithm tailored for the original problem, but with an iteration limit to restrict its computational burden, is also solved. An input sequence candidate is extracted from the solution of the semidefinite program in the lifted space. This sequence is then compared with the so-called early-stopping branch-and-bound solution, and the best of the two is applied in a receding horizon fashion. In simulated case studies, the proposed approach exhibits significant improvements in torque transients, as the branch-and-bound alone struggles to find a meaningful solution due to the imposed limit. |
| title | On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2412.11666 |