arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.18554cs.DScs.LGcs.SYeess.SY
收藏

在线平滑需求管理

Online Smoothed Demand Management

University of Massachusetts Amherst(马萨诸塞大学阿姆赫斯特分校);Stanford University(斯坦福大学);California Institute of Technology(加州理工学院)

Adam Lechowicz, Nicolas Christianson, Mohammad Hajiesmaili, Adam Wierman, Prashant Shenoy

AI总结:

本文提出了一种在线平滑需求管理算法PAAD,通过分账与聚合决策策略,实现了最优竞争比率,并结合端到端学习提升性能。

摘要:

我们介绍并研究了一类名为在线平滑需求管理(OSDM)的在线问题,这源于电网整合和为大型能源消费者(如数据中心)的能源存储所带来的范式转变。在OSDM中,运营商在每个时间步做出两个决策:购买的能量量和交付的能量量(即用于计算)。这两个决策之间的差异对运营商的能源存储(例如电池)进行充放电。两种类型的需求在线到达:基础需求,必须在当前时间得到满足,以及灵活需求,可以在特定截止时间Δ_t之前满足。运营商的目标是通过上述约束条件最小化一个成本,该成本结合了购买能量的成本、交付能量的成本(如有)以及对购买和交付速率的平滑惩罚,以 discourage 波动并鼓励“电网健康”的决策。OSDM扩展了在线算法文献中的多个问题,同时是首次完全建模感兴趣应用的。我们提出了一种名为PAAD(分账与聚合决策)的OSDM竞争算法,并展示了它实现了最优的竞争比率。为了克服最坏情况分析中常见的悲观主义,我们还提出了一种新的学习框架,该框架在最坏情况下的竞争比率上提供保证(即为非平稳性提供鲁棒性),同时允许端到端可微的学习最佳算法在问题的历史实例上。我们在一个集成了电网的数据中心电池存储案例研究中评估了我们的算法,显示PAAD有效解决了该问题,端到端学习在与PAAD相比时实现了显著的性能提升。

英文摘要:

We introduce and study a class of online problems called online smoothed demand management $(\texttt{OSDM})$, motivated by paradigm shifts in grid integration and energy storage for large energy consumers such as data centers. In $\texttt{OSDM}$, an operator makes two decisions at each time step: an amount of energy to be purchased, and an amount of energy to be delivered (i.e., used for computation). The difference between these decisions charges (or discharges) the operator's energy storage (e.g., a battery). Two types of demand arrive online: base demand, which must be covered at the current time, and flexible demand, which can be satisfied at any time before a demand-specific deadline $Δ_t$. The operator's goal is to minimize a cost (subject to above constraints) that combines a cost of purchasing energy, a cost for delivering energy (if applicable), and smoothness penalties on the purchasing and delivery rates to discourage fluctuations and encourage ``grid healthy'' decisions. $\texttt{OSDM}$ generalizes several problems in the online algorithms literature while being the first to fully model applications of interest. We propose a competitive algorithm for $\texttt{OSDM}$ called $\texttt{PAAD}$ (partitioned accounting & aggregated decisions) and show it achieves the optimal competitive ratio. To overcome the pessimism typical of worst-case analysis, we also propose a novel learning framework that provides guarantees on the worst-case competitive ratio (i.e., to provide robustness against nonstationarity) while allowing end-to-end differentiable learning of the best algorithm on historical instances of the problem. We evaluate our algorithms in a case study of a grid-integrated data center with battery storage, showing that $\texttt{PAAD}$ effectively solves the problem and end-to-end learning achieves substantial performance improvements compared to $\texttt{PAAD}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑