Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints
This paper studies the problem of online performance optimization of constrained closed-loop control systems, where both the objective and the constraints are unknown black-box functions affected by exogenous time-varying contextual disturbances. A primal-dual contextual Bayesian optimization algorithm is proposed that achieves sublinear cumulative regret with respect to the dynamic optimal solution under certain regularity conditions. Furthermore, the algorithm achieves zero time-average constraint violation, ensuring that the average value of the constraint function satisfies the desired constraint. The method is applied to both sampled instances from Gaussian processes and a continuous stirred tank reactor parameter tuning problem; simulation results show that the method simultaneously provides close-to-optimal performance and maintains constraint feasibility on average. This contrasts current state-of-the-art methods, which either suffer from large cumulative regret or severe constraint violations for the case studies presented.
Cite this item
Xu, W., Jiang, Y., Svetozarevic, B., & Jones, C. N. (2023). Primal-Dual Contextual Bayesian Optimization for Control System Online Optimization with Time-Average Constraints. 2023 62Nd Ieee Conference on Decision and Control, Cdc, 4112–4117. https://doi.org/10.1109/CDC49753.2023.10383653
Click Copy to copy the citation, or select the text manually.
WOS:001166433803064
2023-01-01
New York
979-8-3503-0124-3
4112
4117
REVIEWED
EPFL
| Event name | Event place | Event date |
Singapore, SINGAPORE | DEC 13-15, 2023 | |
| Funder | Funding(s) | Grant Number | Grant URL |
Swiss National Science Foundation | NCCR Automation (phase I) | 180545 | |