期刊
IEEE CONTROL SYSTEMS LETTERS
卷 4, 期 3, 页码 632-637出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCSYS.2020.2989110
关键词
Heuristic algorithms; Buildings; Power system dynamics; Fans; Real-time systems; Convex functions; Load management; Optimization algorithms; machine learning; power systems
资金
- Natural Sciences and Engineering Research Council of Canada
- National Science Foundation [1351900]
- Advanced Research Projects Agency-Energy [DE-AR0001061]
We extend the regret analysis of the online distributed weighted dual averaging (DWDA) algorithm from Hosseini et al. to the dynamic setting and provide the tightest dynamic regret bound known to date with respect to the time horizon for a distributed online convex optimization (OCO) algorithm. Our bound is linear in the cumulative difference between consecutive optima and does not depend explicitly on the time horizon. We use dynamic-online DWDA (D-ODWDA) and formulate a performance-guaranteed distributed online demand response approach for heating, ventilation, and air-conditioning (HVAC) systems of commercial buildings. We show the performance of our approach for fast timescale demand response in numerical simulations and obtain demand response decisions that closely reproduce the centralized optimal ones.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据