Method and a system for controlling energy supply to different units

Abstract

A method for controlling energy supply to different units includes receiving, by an aggregator, the demand request signal, and performing, by the aggregator, an allocation of the requested demand modification to the units based on a negotiating process with the units for minimizing an impact of the allocation on a future operation of another utility or of other utilities. Each unit is connected to multiple utilities for receiving enemy for operating its energy systems. A demand request signal is provided by at least one operational entity and/or by at least one utility for requesting a demand modification of a utility and/or of one form of energy.

Claims

1. A method for controlling supply of different utilities to different units, wherein each unit is connected to the different utilities, the method comprising: receiving, by an aggregator, a demand request signal from at least one operational entity and/or from at least one of the different utilities for requesting a demand modification of a first utility of the different utilities, the different utilities comprising at least an electrical utility for supplying electricity to the different units and at least one of a gas utility for supplying gas to the different units and a water utility for supplying water to the different units; performing, by the aggregator, an allocation of the requested demand modification to the different units based on a negotiating process with the different units for minimizing an impact of the allocation on a future operation of at least one other utility of the different utilities, the negotiating process including receiving feedback information from at least one unit in the different units, the feedback information comprising an estimation of a maximal possible modification of the first utility over a requested time period and an estimation of how the maximal possible modification of the first utility over the requested time period would affect loads of the at least one other utility connected to the at least one unit, the modification being a reduction or an increase; determining a probability that the at least one other utility will issue a demand request signal for requesting a demand modification of the at least one other utility in a time period during which the at least one other utility would be affected by the maximal possible modification of the first utility; providing the allocation of the requested demand modification to the different units based on the feedback information and the probability that the at least one other utility will issue a demand request signal.

2. The method according to claim 1, wherein the allocation is performed dynamically.

3. The method according to claim 2, wherein the allocation is performed in real-time.

4. The method according to claim 1, wherein the probability depends on one or more of weather, time, season, activity and historical data.

5. The method according to claim 4, wherein the probability depends at least in part on the historical data which comprises prior allocation processes per unit including amount, timeline and/or duration of prior allocated demand modifications.

6. The method according to claim 1, wherein the estimation of how the maximal possible modification of the first utility over the requested time period would affect loads of the at least one other utility connected to the at least one unit is based on a unit-specific correlation in size, amount and/or response time between the different utilities which has been learned for at least one of the different units.

7. The method according to claim 1, wherein the negotiating process considers an operation-specific priority level and/or a Key Performance Indicator requirement on a comfort level and/or scheduled operational conditions for activities or events.

8. The method according to claim 1, wherein the aggregator directly controls the utility distribution systems of the different units according to the allocated demand modification.

9. The method according to claim 1, wherein at least one of the different units is a building and/or wherein the at least one operational entity is an energy planning entity or a unit.

10. The method according to claim 1, wherein the first utility is the electrical utility and the at least one other utility is the gas utility and/or the water utility.

11. The method according to claim 1, wherein the first utility is the water utility and the at least one other utility is the electrical utility.

12. The method according to claim 1, wherein the first utility is the water utility and the at least one other utility is the gas utility.

13. The method according to claim 1, wherein the first utility is the gas utility and the at least one other utility is the electrical utility and/or the water utility.

14. A system for controlling supply of different utilities to different units, wherein each unit is connected to the different utilities and wherein a demand request signal is provided by at least one operational entity and/or by at least one of the different utilities for requesting a demand modification of a first utility of the different utilities, the different utilities comprising at least an electrical utility for supplying electricity to the different units and at least one of a gas utility for supplying gas to the different units and a water utility for supplying water to the different units, the system comprising: an aggregator for: receiving the demand request signal, performing an allocation of the requested demand modification to the different units based on a negotiating process with the different units for minimizing an impact of the allocation on a future operation of at least one other utility of the multiple utilities, wherein the negotiating process includes receiving feedback information from at least one unit in the different units, the feedback information comprising an estimation of a maximal possible modification of the first utility over a requested time period and an estimation of how the maximal possible modification of the first utility over the requested time period would affect loads of the at least one other utility connected to the at least one unit, the modification being a reduction or an increase, determining a probability that the at least one other utility will issue a demand request signal for requesting a demand modification of the at least one other utility in a time period during which the at least one other utility would be affected by the maximal possible modification of the first utility, and providing the allocation of the requested demand modification to the different units based on the feedback information and the probability that the at least one other utility will issue a demand request signal.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) The present invention will be described in even greater detail below based on the exemplary figures. The invention is not limited to the exemplary embodiments. All features described and/or illustrated herein can be used alone or combined in different combinations in embodiments of the invention. The features and advantages of various embodiments of the present invention will become apparent by reading the following detailed description with reference to the attached drawings which illustrate the following:

(2) FIG. 1 shows schematically an embodiment of a system for controlling energy supply to different units with a DR request distribution according to an embodiment of the invention,

(3) FIG. 2 shows a diagram explaining an embodiment of a method according to an embodiment of the invention for modification request distribution,

(4) FIG. 3 shows schematically an actuation enforcement of aggregator's optimization decision in different enforcement embodiments; and

(5) FIG. 4 shows schematically a possible communication between an aggregator server and units according to an embodiment of the invention.

DETAILED DESCRIPTION

(6) A method and a system for controlling energy supply to different units for allowing a reliable energy supply with high efficiency are described herein.

(7) According to an embodiment of the present invention, a method is characterized in that an aggregator receives the demand request signal and performs an allocation of the requested demand modification to the units based on a negotiating process with the units for minimizing an impact of said allocation on a future operation of another utility or of other utilities.

(8) According to an embodiment of the present invention, a system is characterized by an aggregator for receiving the demand request signal and performing an allocation of the requested demand modification to the units based on a negotiating process with the units for minimizing an impact of said allocation on a future operation of another utility or of other utilities.

(9) According to an embodiment of the invention, it is possible to allow a very reliable and effective energy supply by using or providing an aggregator which receives the demand request signal and performs an allocation of the requested demand modification to the units. Such an allocation is based on a negotiating process with the units for minimizing an impact of said allocation on a future operation of another utility or of other utilities. Thus, the negotiating process considers the impact of the allocation on other utilities for providing a balanced performance of involved utilities under consideration of dependencies between said utilities. This is an important feature, since utilities are not completely independent. For instance, reducing the amount of electricity used for heating of a large building or sport complex would affect the load of the district heating utility and the other way around. An impact of current modifications in consumption of one utility on other utilities can be considered by this method. As a result, a reliable energy supply with high efficiency can be realized using resources of utilities in an optimized way.

(10) Within a preferred embodiment the allocation can be performed dynamically. Such a dynamic allocation provides a very quick reaction to varying boundary conditions of the utilities and/or environmental context parameters for providing a very sensitive and efficient allocation of the requested demand modification. Such an allocation can be performed after definable time periods. Preferably, the allocation can be performed in real-time in a continuous way or triggered by monitored changes of boundary conditions and/or environmental context parameters, for example a change of weather conditions.

(11) Within a further preferred embodiment the negotiating process can consider a prediction and/or a probability of one or more possible future demand modification requests of said utility and/or another utility or of other utilities. Under consideration of such a prediction an allocation can for example consider that a specific utility will not be able to provide a sufficient amount of energy within a predicted future time period. Thus, selecting said specific utility for a supplementary energy supply would not be appropriate within this future time period for reliable and efficient energy supply. However, not only the prediction of one or more possible future demand modification requests of a utility is important, but also the probability for such a possible future demand modification request. The consideration of such a probability will further result in a reliable and effective energy supply to the units.

(12) The prediction and/or probability can depend on different boundary conditions and/or environmental parameters. Preferably, the prediction and/or probability can depend on weather, time, season and/or activity of a utility, unit or energy system of a unit.

(13) Within a further preferred embodiment the impact on a future operation of another utility or of other utilities can comprise the impact on one or more possible and/or probable future demand modification requests of said other utility or utilities. In other words, the allocation can be performed under consideration of the impact on one or more possible and/or probable future demand modification requests of said other utility or utilities. In this way future possible and/or probable demand modification requests can be considered within the allocation.

(14) For providing a very efficient allocation the negotiating process can consider feedback information from at least one unit and/or historical data and/or weather forecast. By such a negotiating process different boundary conditions and environmental parameters can be considered.

(15) Preferably the feedback information from a unit can comprise an estimation of a maximal possible modification, i.e. reduction or increase, of the utility over a requested time period. Thus, the aggregator can use different individual information from different individual units regarding the maximal possible modification range of units with regard to the utility over a requested time period.

(16) Further preferred, the feedback information from a unit can comprise an estimation of how a maximal possible modification, i.e. reduction or increase, of the utility over a requested time period would affect loads of other utilities that the unit is connected to. This information will help in providing a very efficient allocation of the requested demand modification with minimal impact on other utilities.

(17) Within a preferred embodiment the historical data can comprise prior allocation processes per unit including amount and/or timeline and/or duration of allocated demand modification. Such historical data can help in providing a reliable prediction of energy supply within future situations.

(18) Alternatively or additionally the negotiating process can consider a preferably learned correlation between different utilities for at least one defined unit or for each unit, preferably in size or amount of allocated demand modification and/or of timely responsiveness. Such correlations will provide a realistic prediction of future situations.

(19) Within the negotiating process individual boundary conditions of the units can be considered. Preferably, the negotiating process can consider an operation-specific priority level and/or a Key Performance Indicator (KPI) requirement on a comfort level and/or scheduled operational conditions, preferably for activities or events regarding the units.

(20) For providing a very reliable energy supply the aggregator can inform the units about allocated modifications. Such allocated modifications are the result of a negotiating process with the units.

(21) Within a preferred embodiment the aggregator can directly control the energy systems of the units according to the allocated demand modification. Different ways for effecting the allocated demand modification are possible. Various communication systems can be used for the control of the energy systems of the units.

(22) The units can be realized by various entities. Within a preferred embodiment at least one unit can be a building. Multiple units can provide a building campus.

(23) The demand request signal can be provided by at least one utility. However, within a further preferred embodiment the demand request signal can be provided by at least one operational entity. Such an operational entity can be an energy planning entity or one of the units. Thus, a unit can initiate an allocation by providing a demand request signal, if, for example, a rearrangement within the unit has been performed. This could be an addition of a further energy system to the unit or an addition of a further room to a building, for example.

(24) Embodiments of the present invention can comprise a dynamic distribution method and system for multi-utility energy control aggregator between multiple independently operating energy management units, where energy modification requests can be retrieved from external utility systems and/or from connected unit's internal energy management systems, where aforementioned energy modification requests are communicated between an aggregator and the connected operating units, whereby the unit negotiates the modification tolerance per utility, and provides information of the applicable control systems or energy systems, and where the individual units authorize the aggregator actuation enforcement for appropriate control systems or energy systems, and where the aggregator executes the control system or energy system actuations upon the optimized distribution model, respecting (1) learned correlations between different utilities for each unit and the connected unit group in variables like size, amount, timely responsiveness, (2) history of modification adaptation of each unit (e.g. responsiveness and/or capacities in size, timeline, serving level, and duration), (3) operation-specific priority levels (e.g. KPI requirements based on comfort levels, scheduled operational conditions, e.g. activities/events), and (4) prediction of upcoming modification requests of same or different utility to unit group (e.g. dependent on flexible context like weather, time, season, activities), including the steps of prediction of the performance of the system with optional upcoming control signals, and calculation of optimized distribution scheme between multiple autonomously operated units.

(25) Preferred embodiments of a method and a system for multi-utility DR request distribution to a group of units include the following steps: (1) reception of a DR signal that requests a reduction for a given utility; (2) communication to the units in order to enquire maximal possible reductions or increases and the resulting effects on other utilities; (3) prediction of future DR reduction/increase requests and their probabilities; (4) optimization-based allocation of the current reduction or increase amount to the units so that the impact on highly probable future requests is minimized; (5) informing the units about their assigned reduction/increase amounts; and (6) enforcing utility actuation through the units' utility control systems.

(26) Embodiments of the present invention can manage simultaneously DR signals for multiple utilities in a multi-site environment maximizing the request fulfillment rate and minimizing side effects on other utilities. This is achieved by consideration of future highly probable requests in the process of request distribution.

(27) Embodiments of this invention propose a system and a method for energy control management over multiple cooperating units deploying demand reduction/increase control through a demand response request distribution that considers prediction of possible future DR requests and the impact of current modifications in consumption of one utility on other utilities. The distribution of demand response requests is considered between members of a group of units that participate in a demand response program(s) and carry the opportunity to serve more than one utility program simultaneously such as electricity, heating via hot water, gas, water. In order to achieve high request fulfillment rate, the method considers high probabilities for a proximate modification request when negotiating and allocating DR requests to the units.

(28) Though the aggregators and multi-utility systems have been investigated so far, it has not been solved how to minimize the impact of a load modification requested for one utility on future requests for other utilities. This is an important question, since utilities are not completely independent. For instance, reducing the amount of electricity used for heating of a large building or sport complex would affect the load of the district heating utility and the other way around. Within embodiments of this invention, it is aimed a maximization of request fulfillment rate of an aggregator that distributes DR signals for multiple utilities by consideration of the effects of the current assignment on the possible future DR signals.

(29) Within embodiments of this invention, the term negotiation preferably applies to an exchange of information through communication protocols and their mechanisms defined in the state of the art, e.g. OpenADR, by which the aggregator and the units can come to an agreement to which extent and during which period units can fulfill energy modification request. Negotiations can consist of one or more communication exchange rounds. In the broadest sense, an aggregator instructing units to reduce energy by a certain amount in a specific period of time is also considered a negotiation.

(30) FIG. 1 shows schematically a system for controlling energy supply to different units according to an embodiment of the invention. FIG. 1 depicts a system for a multi-utility energy control management function hosted via an aggregator to serve energy modification requestse.g. via DR signals, via campus-internal scheduling unitsdistributed under a set of independent energy control units flexible in multiplecorrelatedenergy dimensions. The modification requests are coming to the aggregator for m different utilities via a communication network, preferably Internet. End-customershere unitshave network connections to the mentioned utilities. The aggregator decides how to allocate the requested amount of reduction/increase based on feedback received from the units, historic data and additional information such as weather forecast. The main goal of the energy control management function at the aggregator is to fulfill the received modification request at high rate realizing a dynamic distribution scheme between multiple units respecting (1) history of modification adaptation of the units, e.g. size, timeline, serving level, (2) prediction of upcoming modification requests of same or different utility to unit group (preferably dependent on weather, time, season), (3) learning of unit-specific multi-utility correlation in size and amount, and (4) operation-specific priority levels, e.g. KPI requirements on comfort levels.

(31) We propose to predict coming energy modification requests while distributing a requested reduction/increase amount of an utility and try to minimize the effect of the current modification assignments on the utilities that might need a change in near future. The main idea of the proposed method is given in FIG. 2.

(32) In the following text, it is explained an example of the invention involving only consumption modification requests realized by DR signals which are of main interest in the current girds. Other sources for the modification requests can be an energy planning entity, for example, e.g. on a campus energy network.

(33) The aggregator receives a DR request that specifies the utility k and the period over which the utility k should be reduced, together with the desired reduction amount. Upon this DR signal, the aggregator requests from each unit an estimation of the maximal possible reduction of the utility k over the specified period and an estimation of how this reduction would affect loads of other utilities that the unit is connected to. This feedback is provided by DR modules that can model how a decrease in one utility affects other utilities. The aggregator also predicts future DR that can happen over a time period relevant to the current request, as well as the probabilities of these events. This is done based on historic data and weather forecasts. Having all this data ready, in the next step the aggregator assigns reductions in the utility k to the units, trying to minimize their effect on the utilities that are highly probable to be the subject of near-futurereductionrequests who in turn would be translated by this invention into corresponding control commands to be enacted. In the last step, the aggregator informs the units about reductions that are requested from them and control enforcement of the units' utility control systems is executed.

(34) The communication process happening between the aggregator and units is shown in FIG. 4 step by step. In the first step, the aggregator sends to all units the specifications of the aggregated DR request that has just arrived. These specifications include the utility that needs to be reducedk, the time period over which the reduction is requestedgiven through t.sub.start and t.sub.endand the desired reduction amount A. Each unit i sends back their maximal possible reductions of the utility k (u.sub.k.sub._.sub.maxi) and an estimation of the impact of this reduction on all other utilities, given as u.sub.1.sup.i, . . . , u.sub.m.sup.i. In the last step, the aggregator sends to each unit i, its allocated reduction amount .sub.i*u.sub.k.sub._.sub.max.sup.i where .sub.i (0,1).

(35) In one preferred embodiment, we claim that each unit is connected to different controllable systems relating to the different utilities. Each unit's control module interacts with the aggregator and retrieves the management information [ctrl (.sub.i*u.sub.k.sub._.sub.max.sup.i)] in DELEGATE ENFORCED mode, and will actuate [act (.sub.i*u.sub.k.sub._.sub.max.sup.i)] the controllable systems directly through communication protocols defined in the state of the art or indirectly through intermediate interconnected systems.

(36) In another preferred embodiment, the controllable systems are connected directly to the aggregator, i.e. the aggregator is granted control of the controllable systems through communication protocols defined in the state of the art. For this embodiment, the aggregator control unit might send the management information [ctrl (.sub.i*u.sub.k.sub._.sub.max.sup.i)] to the unit's control module for information of actuationor might be skipped, however actuates directly via [act (.sub.i*u.sub.k.sub._.sub.max.sup.i)] the controllable systems in either DIRECT ENFORCED modefrom aggregator serveror through the aggregator control unit remotely hosted at the unit's site in REMOTE ENFORCED, see FIG. 3 for details.

(37) In a variation of the invention, the units can initiate communication with the aggregator, informing the aggregator of an additional or a reduced need of e.g. energy over a specified time horizonthis information may stem from past energy usage statistics, energy forecasts etc. This information the aggregator then uses to request appropriate energy modifications to other units connected to the aggregator as claimed in this invention.

(38) If there are n large-scale buildings B.sub.1, . . . , B.sub.n participating in a mutility DR program and being coordinated by the same aggregator, after receiving a signal for reduction of utility k during the period (t.sub.start,t.sub.end) by the amount of Requested, the aggregator enquires about each building's maximal possible reductiondenoted as u.sub.k.sub._.sub.max.sup.i for the building iand the resulting cost of this reduction on other utilities u.sub.1.sup.i, . . . , u.sub.m.sup.i. The resulting cost u.sub.j.sup.i is an estimation of the building i, how much the reduction of the utility k by u.sub.k.sub._.sub.max.sup.i would affect the utility j. The value of u.sub.j.sup.i can be both positive and negative, depending on the implications caused by a reduction in utility k. If a decrease in the utility k leads to an increase in the utility j, the value would be positive. But the other way around is also possible, if the utilities k and j are combined together as an input of a process that can be replaced by a third utility.

(39) In the next step, the aggregator needs to predict future DR events based on historic data and possibly, a weather forecast. This prediction is restricted only to the period of time during which utilities would be affected due to the reduction in the utility k over the period (t.sub.start,t.sub.end) Besides probable events, the aggregator should predict their probabilities as well. For this type of prediction, Bayesian networks can be used. In this way, the set of highly probable events and their probabilities is obtained (E={(e.sub.1,p.sub.1), . . . (e.sub.j,p.sub.j)}). A certain threshold p.sub.border can be used to consider events with probability higher than p.sub.border as highly probably. Let's denote as H the set of all utility indices h such that the probability p.sub.h of the event e.sub.h requesting a decrease in the utility h is at least p.sub.border.

(40) In this stage, in order to allocate reductions in utility k to the buildings, the aggregator needs to solve the optimization problem described below. The control variables are .sub.1, . . . .sub.n which represent fractions of the maximal possible reductions u.sub.k.sub._.sub.max.sup.1, . . . , u.sub.k.sub._.sub.max.sup.n that will be requested from the buildings B.sub.1, . . . , B.sub.n, respectively. Any of standard optimization methods, such as genetic algorithms or simulated annealing, can be used to solve the problem. Since for this specific embodiment, the problem formulation is linear, linear programming can be used to solve it.

(41) An Objective function can be expressed as:
min .sub.H(w.sub.*.sub.i=1.sup.n.sub.i*u.sub..sup.i).

(42) The objective is to minimize the impact of the requested reductions on the utilities for which there is a high probability that their reduction will be requested in near future (h H). w.sub.h is a weight factor used to give different importance to different utilities. The weight factors should be selected depending on the specific application case, but one option is to use the event probabilities p.sub.h as a measure of their relative importance. The cost for the utility h is estimated as .sub.i=1.sup.n .sub.i*u.sub.h.sup.i where .sub.i is a control variabledetermining the amount of reduction .sub.i*u.sub.k.sub._.sub.max.sup.i to be requested from the building B.sub.iand u.sub.h.sup.i is the cost in the utility u.sub.h for the reduction u.sub.k.sub._.sub.max.sup.i of the utility k in the building B.sub.i. This function makes an estimation of the costs assuming that the cost in the utility i scales linearly with the reduction of the utility k.

(43) The entire desired amount of reduction should be allocated according to:
|.sub.i=1.sup.n.sub.i*u.sub.k.sub._.sub.max.sup.iRequested|AD

(44) where AD represents the allowed deviation from the requested amount of reduction. Another possible approach that would behave better in the case that the required reduction is not achievable, would be to add this absolute value to the objective function with its weight factor. The approach using the constraint would require rerunning the problem for a lower requested value in the case that the problem is not feasible.

(45) There are two more groups of constraints that require control variables to be from the range [0,1]: 1.) For all i: .sub.i0 2.) For all i: .sub.i1

(46) Once the problem is solved, the units responsible for each building B.sub.i are informed about the requested reduction of .sub.i*u.sub.k.sub._.sub.max.sup.i and control the Building Management System accordingly. In a variation of this embodiment, the aggregator isafter having solved the optimization problemallowed to directly control the Building Management System and thus the information of the reduction requests for each individual unit can be skipped.

(47) While the invention has been illustrated and described in detail in the drawings and foregoing description, such illustration and description are to be considered illustrative or exemplary and not restrictive. It will be understood that changes and modifications may be made by those of ordinary skill within the scope of the following claims. In particular, the present invention covers further embodiments with any combination of features from different embodiments described above and below.

(48) The terms used in the claims should be construed to have the broadest reasonable interpretation consistent with the foregoing description. For example, the use of the article a or the in introducing an element should not be interpreted as being exclusive of a plurality of elements. Likewise, the recitation of or should be interpreted as being inclusive, such that the recitation of A or B is not exclusive of A and B, unless it is clear from the context or the foregoing description that only one of A and B is intended. Further, the recitation of at least one of A, B and C should be interpreted as one or more of a group of elements consisting of A, B and C, and should not be interpreted as requiring at least one of each of the listed elements A, B and C, regardless of whether A, B and C are related as categories or otherwise. Moreover, the recitation of A, B and/or C or at least one of A, B or C should be interpreted as including any singular entity from the listed elements, e.g., A, any subset from the listed elements, e.g., A and B, or the entire list of elements A, B and C.