...
首页> 外文期刊>Automatic Control, IEEE Transactions on >Robust Online Algorithms for Peak-Minimizing EV Charging Under Multistage Uncertainty
【24h】

Robust Online Algorithms for Peak-Minimizing EV Charging Under Multistage Uncertainty

机译:多阶段不确定性下用于峰值最小化EV充电的鲁棒在线算法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this paper, we study how to utilize forecasts to design online electrical vehicle (EV) charging algorithms that can attain strong performance guarantees. We consider the scenario of an aggregator serving a large number of EVs together with its background load, using both its own renewable energy (for free) and the energy procured from the external grid. The goal of the aggregator is to minimize its peak procurement from the grid, subject to the constraint that each EV has to be fully charged before its deadline. Further, the aggregator can predict the future demand and the renewable energy supply with some levels of uncertainty. We show that such prediction can be very effective in reducing the competitive ratios of online control algorithms, and even allow online algorithms to achieve close-to-offline-optimal peak. Specifically, we first propose a 2-level increasing precision model (2-IPM), to model forecasts with different levels of accuracy. We then develop a powerful computational approach that can compute the optimal competitive ratio under 2-IPM over any online algorithm, and also online algorithms that can achieve the optimal competitive ratio. Simulation results show that, even with up to 20% day-ahead prediction errors, our online algorithms still achieve competitive ratios fairly close to 1, which are much better than the classic results in the literature with a competitive ratio of e. The second contribution of this paper is that we solve a dilemma for online algorithm design, e.g., an online algorithm with good competitive ratio may exhibit poor average-case performance. We propose a new Algorithm-Robustification procedure that can convert an online algorithm with good average-case performance to one with both the optimal competitive ratio and good average-case performance. We demonstrate via trace-based simulations the superior performance of the robustified version of a well-known heuristic algorithm based on model predictive control.
机译:在本文中,我们研究了如何利用预测来设计能够获得强大性能保证的在线电动汽车(EV)充电算法。我们考虑了使用自身的可再生能源(免费)和从外部电网采购的能源为聚合汽车提供大量电动汽车及其背景负荷的场景。聚合器的目标是最大程度地减少其从电网的高峰采购,但要遵守每个EV必须在其截止日期之前充满电的约束。此外,聚合器可以在某种程度的不确定性下预测未来需求和可再生能源供应。我们表明,这种预测可以有效地降低在线控制算法的竞争率,甚至可以使在线算法达到接近离线的最佳峰值。具体来说,我们首先提出2级精度提高模型(2-IPM),以对具有不同精度级别的预测进行建模。然后,我们开发了一种功能强大的计算方法,该方法可以在2-IPM下计算任何在线算法下的最佳竞争比,以及可以实现最佳竞争比的在线算法。仿真结果表明,即使日前预测误差高达20%,我们的在线算法仍能达到相当接近1的竞争率,这比文献中具有e的竞争率的经典结果要好得多。本文的第二个贡献是我们解决了在线算法设计的难题,例如,具有良好竞争比的在线算法可能表现出较差的平均案例性能。我们提出了一种新的算法强化程序,该程序可以将具有良好平均情况性能的在线算法转换为具有最佳竞争率和良好平均情况性能的在线算法。我们通过基于跟踪的仿真演示了基于模型预测控制的著名启发式算法的鲁棒版本的优越性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号