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 条
  • [1] Whether to Charge or Discharge an Electric Vehicle? An Optimal Approach in Polynomial Time
    Deng, Ruilong
    Liang, Hao
    2017 IEEE 86TH VEHICULAR TECHNOLOGY CONFERENCE (VTC-FALL), 2017,
  • [2] HYBRID APPROACH TO NEAR-OPTIMAL LAUNCH VEHICLE GUIDANCE
    LEUNG, MSK
    CALISE, AJ
    JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1994, 17 (05) : 881 - 888
  • [3] Near-Optimal Online Auctions
    Blum, Avrim
    Hartline, Jason D.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 1156 - 1163
  • [4] Caching in Dynamic Environments: A Near-Optimal Online Learning Approach
    Zhou, Shiji
    Wang, Zhi
    Hu, Chenghao
    Mao, Yinan
    Yan, Haopeng
    Zhang, Shanghang
    Wu, Chuan
    Zhu, Wenwu
    IEEE TRANSACTIONS ON MULTIMEDIA, 2023, 25 : 792 - 804
  • [5] Near-optimal online routing in opportunistic networks
    Arastouie, Narges
    Sabaei, Masoud
    Bakhshi, Bahador
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2019, 32 (03)
  • [6] NEAR-OPTIMAL ALGORITHMS FOR ONLINE MATRIX PREDICTION
    Hazan, Elad
    Kale, Satyen
    Shalev-Shwartz, Shai
    SIAM JOURNAL ON COMPUTING, 2017, 46 (02) : 744 - 773
  • [7] Near-optimal online multiselection in internal and external memory
    Barbay, Jeremy
    Gupta, Ankur
    Satti, Srinivasa Rao
    Sorenson, Jon
    JOURNAL OF DISCRETE ALGORITHMS, 2016, 36 : 3 - 17
  • [8] DOTS: An online and near-optimal trajectory simplification algorithm
    Cao, Weiquan
    Li, Yunzhao
    JOURNAL OF SYSTEMS AND SOFTWARE, 2017, 126 : 34 - 44
  • [9] BOLA: Near-Optimal Bitrate Adaptation for Online Videos
    Spiteri, Kevin
    Urgaonkar, Rahul
    Sitaraman, Ramesh K.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2020, 28 (04) : 1698 - 1711
  • [10] BOLA: Near-Optimal Bitrate Adaptation for Online Videos
    Spiteri, Kevin
    Urgaonkar, Rahul
    Sitaraman, Ramesh K.
    IEEE INFOCOM 2016 - THE 35TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, 2016,