Whether to Charge an Electric Vehicle or Not? A Near-Optimal Online Approach

被引:0
|
作者
Deng, Ruilong [1 ]
Liang, Hao [1 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 1H9, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Demand response; EV charging; online scheduling; primal-dual approach; real-time price; smart grid; DEMAND RESPONSE; CONSUMPTION;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
The electric vehicle (EV), a promising technique to reduce transportation emissions, is one of the most important household appliances for demand response. Under the real-time pricing environment in smart grid, EV owners are faced with the EV charging scheduling problem to minimize electricity cost. Existing works focused on offline solutions or Markov decision processes which require full or statistical priori knowledge of future real-time prices (RTPs). This may not be practical as it is difficult to predict future RTPs especially for long horizons. In this paper, we propose a near-optimal online algorithm via primal-dual approach, requiring very little priori knowledge, i.e., the upper bound of future RTPs. The competitive ratio of the online algorithm is derived. It is demonstrated with real price data from Ameren Corporation that our proposed online algorithm can result in considerable economic savings, compared with existing schemes which only consider RTPs.
引用
收藏
页数:5
相关论文
共 50 条
  • [21] Energy Harvesting Multiple Access Channels: Optimal and Near-Optimal Online Policies
    Baknina, Abdulrahman
    Ulukus, Sennur
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (07) : 2904 - 2917
  • [22] Optimal Online Adaptive Electric Vehicle Charging
    Guo, Linqi
    Erliksson, Karl F.
    Low, Steven H.
    2017 IEEE POWER & ENERGY SOCIETY GENERAL MEETING, 2017,
  • [23] A Near-Optimal Exploration Exploitation Approach for Assortment Selection
    Agrawal, Shipra
    Avadhanula, Vashist
    Goyal, Vineet
    Zeevi, Assaf
    EC'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2016, : 599 - 600
  • [24] Near-optimal blacklisting
    Dimitrakakis, Christos
    Mitrokotsa, Aikaterini
    COMPUTERS & SECURITY, 2017, 64 : 110 - 121
  • [25] A Near-Optimal Approach for Online Task Offloading and Resource Allocation in Edge-Cloud Orchestrated Computing
    Liu, Tong
    Fang, Lu
    Zhu, Yanmin
    Tong, Weiqin
    Yang, Yuanyuan
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2022, 21 (08) : 2687 - 2700
  • [26] Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions
    Block, Adam
    Simchowitz, Max
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [27] Universally Near-Optimal Online Power Control for Energy Harvesting Nodes
    Shaviv, Dor
    Ozgur, Ayfer
    2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2016,
  • [28] Near-optimal online control of dynamic discrete-event systems
    Grigorov, Lenko
    Rudie, Karen
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2006, 16 (04): : 419 - 449
  • [29] Near-Optimal Online Control of Dynamic Discrete-Event Systems
    Lenko Grigorov
    Karen Rudie
    Discrete Event Dynamic Systems, 2006, 16 : 419 - 449
  • [30] Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
    Hajiaghayi, MohammadTaghi
    Liaghat, Vahid
    Panigrahi, Debmalya
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 576 - 587