Characterizing flexibility of an aggregation of deferrable loads

Flexibility from distributed deferrable loads presents an enormous potential to provide fast ramping resources that are necessary to vastly integrate renewable energy resources. In this paper, we study aggregation, characterization, and scheduling of a collection of deferrable loads to facilitate integrating renewable generation into the power system. A generation profile is called exactly adequate if there exists a scheduling policy that could allocate the power to satisfy the energy requirements of all deferrable loads without surplus or deficit. We provide sufficient and/or necessary characterizations on the adequacy of allocated generation profiles. Moreover, we propose a novel scheduling algorithm to service deferrable loads. Heuristic algorithms such as Earliest Deadline First (EDF) and Least Laxity First (LLF) policies are used in numerical experiments to compare with the proposed algorithm. Extensive simulations show that our scheduling policy generally can fulfill the energy requirements of all loads without surplus or deficit for exactly adequate generation profiles, while the EDF and LLF policies cannot meet this objective in most cases.

[1]  Johanna L. Mathieu,et al.  Planning and control of Electric Vehicles using dynamic energy capacity models , 2013, 52nd IEEE Conference on Decision and Control.

[2]  Aloysius K. Mok,et al.  Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks , 1989, IEEE Trans. Software Eng..

[3]  David D. Yao,et al.  Rearrangement, Majorization and Stochastic Scheduling , 1993, Math. Oper. Res..

[4]  Ugo Vaccaro,et al.  Supermodularity and subadditivity properties of the entropy on the majorization lattice , 2002, IEEE Trans. Inf. Theory.

[5]  Ana Busic,et al.  Ancillary service to the grid from deferrable loads: The case for intelligent pool pumps in Florida , 2013, 52nd IEEE Conference on Decision and Control.

[6]  Kameshwar Poolla,et al.  Duration-differentiated energy services with a continuum of loads , 2014, 53rd IEEE Conference on Decision and Control.

[7]  H. Ryser Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[8]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[9]  Kameshwar Poolla,et al.  Real-time scheduling of deferrable electric loads , 2012, 2012 American Control Conference (ACC).

[10]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[11]  Anthony Papavasiliou,et al.  Supplying renewable energy to deferrable loads: Algorithms and economic analysis , 2010, IEEE PES General Meeting.

[12]  Yi Jiang,et al.  MIMO Transceiver Design via Majorization Theory , 2007, Found. Trends Commun. Inf. Theory.

[13]  Sean P. Meyn,et al.  Ancillary Service to the Grid Through Control of Fans in Commercial Building HVAC Systems , 2014, IEEE Transactions on Smart Grid.

[14]  Pravin Varaiya,et al.  Aggregate flexibility of a collection of loadsπ , 2013, 52nd IEEE Conference on Decision and Control.

[15]  Pravin Varaiya,et al.  GRIP - Grids with intelligent periphery: Control architectures for Grid2050π , 2011, 2011 IEEE International Conference on Smart Grid Communications (SmartGridComm).

[16]  Tyrone L. Vincent,et al.  Aggregate Flexibility of Thermostatically Controlled Loads , 2015, IEEE Transactions on Power Systems.

[17]  Joseph Y.-T. Leung,et al.  Scheduling real-time tasks: algorithms and complexity , 2004 .

[18]  Wei Chen,et al.  When MIMO Control Meets MIMO Communication: A Majorization Condition for Networked Stabilizability , 2014, ArXiv.

[19]  D. R. Fulkerson A Network-Flow Feasibility Theorem and Combinatorial Applications , 1959, Canadian Journal of Mathematics.