• DocumentCode
    1999240
  • Title

    Negotiation-based task scheduling and storage control algorithm to minimize user´s electric bills under dynamic prices

  • Author

    Ji Li ; Yanzhi Wang ; Xue Lin ; Nazarian, Shahin ; Pedram, Massoud

  • Author_Institution
    Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
  • fYear
    2015
  • fDate
    19-22 Jan. 2015
  • Firstpage
    261
  • Lastpage
    266
  • Abstract
    Dynamic energy pricing is a promising technique in the Smart Grid to alleviate the mismatch between electricity generation and consumption. Energy consumers are incentivized to shape their power demands, or more specifically, schedule their electricity-consuming applications (tasks) more prudently to minimize their electric bills. This has become a particularly interesting problem with the availability of residential photovoltaic (PV) power generation facilities and controllable energy storage systems. This paper addresses the problem of joint task scheduling and energy storage control for energy consumers with PV and energy storage facilities, in order to minimize the electricity bill. A general type of dynamic pricing scenario is assumed where the energy price is both time-of-use and power-dependent, and various energy loss components are considered including power dissipation in the power conversion circuitries as well as the rate capacity effect in the storage system. A negotiation-based iterative approach has been proposed for joint residential task scheduling and energy storage control that is inspired by the state-of-the-art Field-Programmable Gate Array (FPGA) routing algorithms. In each iteration, it rips-up and re-schedules all tasks under a fixed storage control scheme, and then derives a new charging/discharging scheme for the energy storage based on the latest task scheduling. The concept of congestion is introduced to dynamically adjust the schedule of each task based on the historical results as well as the current scheduling status, and a near-optimal storage control algorithm is effectively implemented by solving convex optimization problem(s) with polynomial time complexity. Experimental results demonstrate the proposed algorithm achieves up to 64.22% in the total energy cost reduction compared with the baseline methods.
  • Keywords
    computational complexity; convex programming; cost reduction; field programmable gate arrays; iterative methods; power consumption; power convertors; power generation economics; power generation scheduling; pricing; secondary cells; smart power grids; solar cells; FPGA routing algorithm; PV power generation; convex optimization problem; dynamic energy pricing; electricity consumption; electricity generation; electricity-consuming application schedule; energy cost reduction; energy loss component; energy storage Control Algorithm; negotiation-based iterative approach; negotiation-based task scheduling; polynomial time complexity; power conversion circuitries; power dissipation; power-dependent; residential photovoltaic power generation; smart grid; state-of-the-art field- programmable gate array routing algorithm; time-of-use; user electric bill minimization; Energy storage; Heuristic algorithms; Minimization; Power demand; Power generation; Routing; Scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference (ASP-DAC), 2015 20th Asia and South Pacific
  • Conference_Location
    Chiba
  • Print_ISBN
    978-1-4799-7790-1
  • Type

    conf

  • DOI
    10.1109/ASPDAC.2015.7059015
  • Filename
    7059015