.png){kind=icon}
.png){kind=icon}
Return
Primal-dual interior-point algorithm for symmetric model predictive control
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2023.111157.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a primal-dual interior-point (pdIp) optimization algorithm for solving extremescale model predictive control (mpC) problems with linear dynamics, polytopic constraints, and quadratic/linear costs which are all invariant under the symmetric-group. We show that exploiting symmetry can reduce the computational and memory burden of extreme-scale or fast-paced applications of mpC. Our algorithm transforms the original inputs, states, and constraints of the mpC problem into a symmetric domain. The premise of our algorithm is that the numerical linear algebra used to solve the optimization problem has lower computational and memory complexity in the transformed domain. We demonstrate our algorithm for a heating, ventilation, and air-conditioning (hvAC) numerical example. We show that, for our largest hvAC control problem, our symmetry exploiting the pdIp algorithm reduces the computation-time from minutes to seconds in comparison with the baseline pdIp algorithm. Furthermore, we show that the presented symmetry exploiting pdIp algorithm outperforms a state-of-the-art symmetry exploiting optimization algorithm. & COPY; 2023 Elsevier Ltd. All rights reserved.
Keywords:
Symmetry
Model predictive control
Optimization
Interior-point