IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v12y2019i9p1642-d227110.html
   My bibliography  Save this article

Distributed Capacity Allocation of Shared Energy Storage Using Online Convex Optimization

Author

Listed:
  • Kan Xie

    (Key Laboratory of Ministry of Education, School of Automation, Guangdong University of Technology, Guangzhou 510006, China
    Guangdong Key Laboratory of IoT Information Technology, Guangzhou 510006, China)

  • Weifeng Zhong

    (Key Laboratory of Ministry of Education, School of Automation, Guangdong University of Technology, Guangzhou 510006, China
    Guangdong Key Laboratory of IoT Information Technology, Guangzhou 510006, China)

  • Weijun Li

    (Key Laboratory of Ministry of Education, School of Automation, Guangdong University of Technology, Guangzhou 510006, China
    State Key Laboratory of Precision Electronic Manufacturing Technology and Equipment, Guangzhou 510006, China)

  • Yinhao Zhu

    (School of Electronic and Information Engineering, South China University of Technology, Guangzhou 510641, China)

Abstract

This paper studies capacity allocation of an energy storage (ES) device which is shared by multiple homes in smart grid. Given a time-of-use (TOU) tariff, homes use the ES to shift loads from peak periods to off-peak periods, reducing electricity bills. In the proposed ES sharing model, the ES capacity has to be allocated to homes before the homes’ load data is completely known. To this end, an online ES capacity allocation algorithm is developed based on the online convex optimization framework. Under the online algorithm, the complex allocation problem can be solved round by round: at each round, the algorithm observes current system states and predicts a decision for the next round. The proposed algorithm is able to minimize homes’ costs by learning from home load data in a serial fashion. It is proven that the online algorithm can ensure zero average regret and long-term budget balance of homes. Further, a distributed implementation of the online algorithm is proposed based on alternating direction method of multipliers framework. In the distributed implementation, the one-round system problem is decomposed into multiple subproblems that can be solved by homes locally, so that an individual home does not need to send its private load data to any other. In simulation, actual home load data and a TOU tariff of the United States are used. Results show that the proposed online approach leads to the lowest home costs, compared to other benchmark approaches.

Suggested Citation

  • Kan Xie & Weifeng Zhong & Weijun Li & Yinhao Zhu, 2019. "Distributed Capacity Allocation of Shared Energy Storage Using Online Convex Optimization," Energies, MDPI, vol. 12(9), pages 1-15, April.
  • Handle: RePEc:gam:jeners:v:12:y:2019:i:9:p:1642-:d:227110
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/12/9/1642/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/12/9/1642/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang, Wenyi & Wei, Wei & Chen, Laijun & Zheng, Boshen & Mei, Shengwei, 2020. "Service pricing and load dispatch of residential shared energy storage unit," Energy, Elsevier, vol. 202(C).
    2. Yuzhe Xie & Yan Yao & Yawu Wang & Weiqiang Cha & Sheng Zhou & Yue Wu & Chunyi Huang, 2022. "A Cooperative Game-Based Sizing and Configuration of Community-Shared Energy Storage," Energies, MDPI, vol. 15(22), pages 1-17, November.
    3. Uyikumhe Damisa & Nnamdi I. Nwulu, 2022. "Blockchain-Based Auctioning for Energy Storage Sharing in a Smart Community," Energies, MDPI, vol. 15(6), pages 1-12, March.
    4. Despina S. Giakomidou & Athanasios Kriemadis & Dimitrios K. Nasiopoulos & Dimitrios Mastrakoulis, 2022. "Re-Engineering of Marketing for SMEs in Energy Market through Modeling Customers’ Strategic Behavior," Energies, MDPI, vol. 15(21), pages 1-20, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:12:y:2019:i:9:p:1642-:d:227110. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.