TY - JOUR
T1 - Online Convex Optimization of Multi-Energy Building-to-Grid Ancillary Services
AU - Lesage-Landry, Antoine
AU - Wang, Han
AU - Shames, Iman
AU - Mancarella, Pierluigi
AU - Taylor, Joshua A.
N1 - Publisher Copyright:
© 1993-2012 IEEE.
PY - 2020/11
Y1 - 2020/11
N2 - In this article, buildings with several sources of flexibility, subject to multiple energy requirements, and having access to different electricity markets are considered. A two-level algorithm for optimizing the building's energy management under uncertainty and limited information is presented in this article. A mixed-integer linear program scheduling level is first used to set an energy management objective for every hour using only averaged data. Then, an online convex optimization (OCO) algorithm is used to track in real time the objective set by the scheduling level. For this purpose, a novel penalty-based OCO algorithm for time-varying constraints is developed. The regret of the algorithm is shown to be sublinearly bounded above. This ensures, at least on average, the feasibility of the decisions made by the algorithm. A case study in which the two-level approach is used on a building located in Melbourne, Australia, is presented. The approach is shown to satisfy all constraints 97.32% of the time while attaining a positive net revenue at the end of the day by providing ancillary services to the power grid.
AB - In this article, buildings with several sources of flexibility, subject to multiple energy requirements, and having access to different electricity markets are considered. A two-level algorithm for optimizing the building's energy management under uncertainty and limited information is presented in this article. A mixed-integer linear program scheduling level is first used to set an energy management objective for every hour using only averaged data. Then, an online convex optimization (OCO) algorithm is used to track in real time the objective set by the scheduling level. For this purpose, a novel penalty-based OCO algorithm for time-varying constraints is developed. The regret of the algorithm is shown to be sublinearly bounded above. This ensures, at least on average, the feasibility of the decisions made by the algorithm. A case study in which the two-level approach is used on a building located in Melbourne, Australia, is presented. The approach is shown to satisfy all constraints 97.32% of the time while attaining a positive net revenue at the end of the day by providing ancillary services to the power grid.
KW - Ancillary services
KW - flexibility
KW - multi-energy systems (MESs)
KW - online convex optimization (OCO)
KW - time-varying constraints
UR - http://www.scopus.com/inward/record.url?scp=85075529703&partnerID=8YFLogxK
U2 - 10.1109/TCST.2019.2944328
DO - 10.1109/TCST.2019.2944328
M3 - Article
SN - 1063-6536
VL - 28
SP - 2416
EP - 2431
JO - IEEE Transactions on Control Systems Technology
JF - IEEE Transactions on Control Systems Technology
IS - 6
M1 - 8892672
ER -