System and method for siting of energy storage systems in an electrical grid, including optimizing locations of energy storage systems based on technical parameters of an energy storage system or other parameters
11526188 · 2022-12-13
Assignee
Inventors
Cpc classification
H02J3/004
ELECTRICITY
Y04S10/50
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
Y02E40/70
GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
International classification
H02J3/00
ELECTRICITY
Abstract
Systems and methods for identifying optimal siting locations for an energy storage system. Siting locations are identified based on a value index derived from pricing data associated with a plurality of nodes on an electrical grid. An index is derived for each selected node of the plurality of nodes to produce a siting recommendation.
Claims
1. A system for managing energy dispatch comprising: an energy storage siting platform comprising: a local memory configured to store node data representing a plurality of nodes, wherein a node represents a specific location within an energy grid, said local memory being further configured to receive pricing data relating to said plurality of nodes from an external pricing data source; a user interface configured to allow a user to choose one or more node selection criteria; a node selection module configured to generate a subset of nodes from said plurality of nodes based on said one or more node selection criteria; and a node evaluation module configured to evaluate potential energy sales and energy purchases to generate an arbitrage value index for each node of said subset of nodes based on at least said pricing data, wherein said arbitrage value index for an evaluated node comprises the difference between a maximum average price of energy at said evaluated node over an interval of time given a specified energy storage duration and a minimum average price of energy at said evaluated node over said interval of time given said specified energy storage duration, wherein said node evaluation module is further configured to report said arbitrage value index for each node of said subset of nodes to the user via the user interface.
2. The system of claim 1 wherein said one or more node selection criteria comprises battery charge time and battery discharge time.
3. The system of claim 1 wherein said pricing data comprises historical pricing and usage data.
4. The system of claim 3 wherein said external pricing source comprises an independent system operator.
5. A method for managing energy dispatch comprising: choosing one or more node selection criteria on an energy storage siting platform; assembling a subset of nodes from a plurality of nodes based on said one or more node selection criteria, wherein a node of said plurality of nodes represents a specific location within an energy grid, wherein said energy storage siting platform is configured to receive pricing data and is operably coupled to a local memory configured to store node data representing said plurality of nodes, wherein said local memory is further configured to store said pricing data; retrieving said pricing data associated to each node in said subset of nodes; performing an analysis of said subset of nodes, wherein said analysis comprises evaluating an arbitrage value index for said each node, wherein said arbitrage value index for an evaluated node comprises the difference between a maximum average price of energy at said evaluated node over an interval of time given a specified energy storage duration and a minimum average price of energy at said evaluated node over said interval of time given said specified energy storage duration, wherein said evaluating includes consideration of potential energy sales and energy purchases based on at least said pricing data; and generating a siting recommendation based on at least said arbitrage value index.
6. The method of claim 5 wherein said one or more node selection criteria comprises battery charge time and battery discharge time.
7. The method of claim 5 wherein said pricing data comprises historical pricing and usage data.
Description
DESCRIPTION OF THE DRAWINGS
(1) The drawings accompanying and forming part of this specification are included to depict certain aspects of the invention. A clearer impression of the invention, and of the components and operation of systems provided with the invention, will become more readily apparent by referring to the exemplary, and therefore nonlimiting, embodiments illustrated in the drawings, wherein identical reference numerals designate the same components. Note that the features illustrated in the drawings are not necessarily drawn to scale.
(2)
(3)
(4)
DETAILED DESCRIPTION
(5) In the following description of the present invention there are multiple details established to provide a thorough understanding of the invention and the preferred implementations of the invention. It should be clear that the description is not intended to limit the invention to these specific embodiments and those variations, changes, substitutions, or equivalent components will be apparent to those skilled in the art and should not be considered significant differences from the intended scope of the invention.
(6) The invention and the various features and advantageous details thereof are explained more fully with reference to the nonlimiting embodiments that are illustrated in the accompanying drawings and detailed in the following description. Descriptions of well-known starting materials, processing techniques, components and equipment are omitted so as not to unnecessarily obscure the invention in detail. It should be understood, however, that the detailed description and the specific examples, while indicating some embodiments of the invention, are given by way of illustration only and not by way of limitation. Various substitutions, modifications, additions and/or rearrangements within the spirit and/or scope of the underlying inventive concept will become apparent to those skilled in the art from this disclosure.
(7) Embodiments of an energy storage siting system in accordance with the present disclosure may be deployed in various topologies for an electrical grid. Turning to
(8) The electrical grid 100 may thus include geographically or electrically distributed nodes 102, 103, 104, 105, 106, 107 which may, include, for example, producers (e.g., generators) of electricity to provide electricity into the electrical grid 100 or consumers (e.g., loads) of electricity from the grid 100. As discussed, each node 102, 103, 104, 105, 106, 107 may have an associated LMP price at a given point in time. These nodes 102, 103, 104, 105, 106, 107 on the electrical grid 100 may include potential energy storage systems 104, 106. An energy storage system 104, 106 may be capable of both producing energy to provide into the grid and consuming energy to store such energy for later provisioning into the grid 100. The energy stored by an energy storage system 104, 106 may be consumed from the electrical grid 100 itself or from another source coupled to the energy storage system 104, 106 (which may, or may not, be coupled directly to the electrical grid 100), such as solar panels, wind turbines, thermal generators or the like.
(9) A battery energy storage (BES) system is one example of such an energy storage system 104, 106. Other examples of energy storage systems (e.g., that are not batteries or BESs) are possible and are fully contemplated herein, as mentioned previously. Thus the terms battery energy storage and battery system are used herein interchangeably with the term energy storage system without loss of generality. Regardless of underlying battery chemistry, each battery energy storage (BES) system will incorporate the same basic design and may be housed in, for example, custom-build standalone warehouses or multiple standard shipping-size containers.
(10) These batteries 104, 106 may function differently from other energy resources 102, 103, 105, 107. For example, batteries 104, 106 may only be utilized for a limited amount of time during a given time period and operate as both producers and consumers on the electrical grid. Moreover, batteries 104, 106 may be depleted, and even exhausted, given power demands, or may cycle over long periods of time either alternating between charging and discharging, or charging or discharging at very low levels relative to the maximum charging and discharging rates. Additionally, batteries 104, 106 may be heavily subject to environmental or operational conditions. For example, the hotter or colder the environment, the less efficiently a battery may operate.
(11) The fact that batteries may operate as both producers (e.g., generators) and consumers (e.g., loads) on the electrical grid means such batteries 104, 106 may be utilized for a number of purposes. One of these purposes is for arbitrage of electrical power. Specifically, the markets that govern the price of power on the electrical grid 100 may be LMP-centric markets. In these types of markets, an entity utilizes the parameters associated with the electrical grid 100 such as demand, supply, supply offer and demand bid curves, network constraints, operational constraints capacity etc. to determine market clearing prices for every node 102, 103, 104, 105, 106, 107 on the electrical grid 100 while reliably serving the system load across each interval. This entity is the ISO 120 that is responsible for operating, planning and pricing the electricity market for the electrical grid 100. The determined prices may be the cost of serving an incremental MW of power from that node 102, 103, 104, 105, 106, 107. The determination of these prices may occur at each of a set of relatively closely spaced time intervals (e.g., 5 minutes) such that a new LMP price is determined for each node 102, 103, 104, 105, 106, 107 on the grid for each of those time periods. Accordingly, as the electrical grid 100 may be highly volatile and encounter both foreseen and unforeseen changes, the prices across the nodes may be highly volatile over the course of some period (e.g., a day).
(12) By taking advantage of the dual capabilities of batteries 104, 106 this volatility provides an opportunity to perform energy arbitrage. Thus, a battery 104, 106 may be charged by purchasing electricity at a first cost to charge the battery 104, 106 at a certain time and may provide energy to the electrical grid 100 at a second time such that operators of the battery 104, 106 get paid for that electricity at a second cost. The spread or difference between the charging cost and the discharging price is one of the factors to be taken into account when deciding on utilizing the batteries 104, 106 for energy arbitrage.
(13) However, not all nodes 102, 103, 104, 105, 106, 107 within the electrical grid 100 will support the use of batteries 104, 106 in this manner. As discussed, these nodes 102, 103, 104, 105, 106, 107 may be geographically and electrically diverse and are affected by different conditions and are subject to different pricing dynamics. As such, the spread between prices at certain nodes 102, 103, 104, 105, 106, 107 may not be enough to support the installation of batteries at those nodes from an energy arbitrage perspective (e.g., the cost of development and installation of a battery 104, 106 may be greater than the revenues that may be made through use of the battery 104, 106 in that installation). Especially in instances where the technical or operational aspects of battery 104, 106 are ill-suited to the conditions. Conversely, certain nodes 102, 103, 104, 105, 106, 107 on the electrical grid may be well suited to that use of batteries, even more so when the technical and operational parameters of such batteries 104, 106 are appropriately tailored to that use at that node.
(14) Accordingly, determining an appropriate or substantially optimal location, or locations, of batteries on electrical grid 100 can be a complicated and error prone process in part because of the complexity of the electrical grid and associated pricing markets and the number of options available for operation and design of batteries. To facilitate the creation of siting recommendations, an energy storage siting system 180 may be utilized.
(15) In one embodiment, the energy storage siting system 180 may be coupled to the ISO 120 or one or more third party data sources 122 using an electronic communication network 160 such as the Internet, an internet, an intranet, a wireless or wireline network of some combination of computer networks. The energy storage siting system may include a user interface 182, a computer network interface 184 and a siting data generator 188.
(16) Historical or forecast data (collectively historical data herein) may be obtained (e.g., through computer network interface 184) by the energy storage siting system 180 and stored in a local data store 190. This historical or forecast data 194 may, for example, be obtained directly from ISO 120 (e.g., using an ISO LMP interface or the like provided by the ISO 120), may be obtained from one or more third party data source 122 that may collect and organize such LMP pricing data from the ISO 120, or may be obtained from some combination of ISO 120 and one or more third party data sources 122.
(17) This historical or forecast data 194 may include historical ISO data including historical market prices for a particular time period at each node (or a subset of nodes) on the electrical grid 100. In other words, the historical or forecast data 194 may include the LMP prices determined for each time interval (e.g., 5 minutes, 15 minutes or hourly) over a time period (e.g., a quarter, a year, etc.). For example, the historical or forecast data 194 may be the historical price at each node on the electrical grid 100 for each interval (e.g., 5 minute) for each day for an entire year. The historical or forecast data 194 may also be forecast pricing for each node for each interval over some time period.
(18) The user interface 182 may offer a user the ability to interact with the siting data creator 188 to obtain a list of nodes (e.g., energy storage siting locations 176) on the electrical grid 100 ranked according to their suitability for installation of a battery for the use in energy arbitrage and to obtain associated data, including technical and operational parameters of the battery that should be installed at that node 102, 103, 104, 105, 106, 107 to achieve desired results.
(19) In one embodiment a user may interact with the user interface 182 to provide a set of criteria to be utilized by node selector 172 in the determination of historical data for a set of nodes 102, 103, 104, 105, 106, 107. Specifically, a user may wish to confine the set of nodes 102, 103, 104, 105, 106, 107 that will be evaluated and ranked by the energy storage siting system 180. The nodes may be confined, for example, based on geography or other criteria. The node selector 172 may utilize the criteria provided by the user through the user interface 182 to determine a set of nodes 102, 103, 104, 105, 106, 107 on the electrical grid 100 meeting the provided criteria from historical or forecast data 194 (e.g., which may be all, none or some subset of nodes 102, 103, 104, 105, 106, 107 of the electrical grid 100). Once the set of nodes to be ranked is determined by the node selector 172, the LMP data extractor 174 may determine the historical or forecast data 194 associated with the determined set of nodes. As discussed above, historical or forecast data 194 may comprise historical and/or forecast pricing data associated with the determined set of nodes. The siting data creator 188 may use this historical data for the set of nodes to rank the determined set of nodes and return the ranked list of nodes 176 to the user through the user interface 182.
(20) In particular, in one embodiment a user may specify a set of parameters for use in the determination of the ranked list 176 through the user interface 182, such as operational or technical parameters for a battery such as those regarding a desired lifecycle for a battery, the charge time for a battery, the discharge time or rate for a battery or other, how often per time period (e.g., per day) it is desired to charge or discharge the battery, whether the user desires to operate the battery consecutively (e.g., to charge all at once and discharge all at once) or non-consecutively (where charging and discharging may be spaced in time or interleaved), or other parameters.
(21) Siting data creator 188 may receive this user configuration and utilize AVI module 192 based on these user configurations and historical or forecast data 194 (e.g., as determined by LMP data extractor 174). Using this AVI module 192, a list of the set of nodes on the electrical grid 100 (e.g., as determined by node selector 172) ranked according to their suitability for installation of a battery for use in energy arbitrage may be determined, along with associated data including technical and operational parameters of the battery to be installed at such a node. The ranked list of results 176 and associated data may be returned to the user through the user interface 182.
(22) AVI module 192 may utilize an algorithm that is designed to determine AVI and thereby identify optimal siting locations for utility scale energy storage facilities on large LMP-centric electrical grids from an energy intensive arbitrage perspective considering a range of technical and operational parameters of an energy storage system. In one embodiment, this AVI algorithm may be formulated as:
(23) AVI.sub.n for an D-hr energy storage facility at node n=(P.sub.max-avg-n−P.sub.min-avg-n) where
P.sub.max-avg-n=(P.sub.max(1)-n+P.sub.max(2)-n+ . . . +P.sub.max(D)-n)/D
P.sub.min-avg-n=(P.sub.min(1)-n+P.sub.min(2)-n+ . . . +P.sub.min(D)-n)/D
P.sub.max(i)-n=Max({P.sub.0-n,P.sub.1-n,P.sub.2-n, . . . P.sub.T-n},i)
P.sub.max(j)-n=Max({P.sub.0-n,P.sub.1-n,P.sub.2-n, . . . P.sub.T-n},j) Such that if CF=1 then P.sub.max(1), P.sub.max(2) . . . P.sub.max(D) have to be consecutive hour prices and P.sub.min(1), P.sub.min(2) . . . P.sub.min(D) also have to be consecutive hour prices. D—duration of energy storage (hours) T—time period of evaluation for 1 charge/discharge cycle (hours) P.sub.max-avg-n maximum rolling average of node price across D hours over duration of T at node n P.sub.min-avg-n minimum rolling average of node price across D hours over duration of T at node n P.sub.max(i)-n—ith maximum price at node n (where i=1 implies highest price, i=2 implies second highest price etc.) These are prices at which energy would be sold. P.sub.min(j)-n—jth minimum price at node n (where j=1 implies lowest price, j=2 implies second lowest price etc.) These are prices at which energy would be bought. P.sub.x-n—price for interval x at node n CF—consecutive hour flag (on or off) n—node Within this embodiment of an AVI algorithm, there can be no instance where the same P.sub.x-n is utilized for both the P.sub.max(i)-n and P.sub.min(i)-n functions as called by the P.sub.max-avg-n and P.sub.min-avg-n functions, respectively. This is because each P.sub.x-n corresponds to a specific hour, and the energy storage system can only perform either a charge or discharge activity during that hour thereby corresponding to only either a buy (P.sub.min(i)-n) or sell (P.sub.max(i)-n) price.
(24) AVI module 192 can then determine the AVI, as outlined above, for the duration of the price data made available for each node and identifies the node or nodes exhibiting the highest AVI across the time-period associated with the historical or forecast data 194. In certain embodiments, the AVI compare the relative arbitrage potential based on the duration of the energy storage under consideration. Note, for example, that the AVI for a 2-hr energy storage could be different in comparison to the AVI for a 4-hr energy storage at the same node.
(25) Alternatively or additionally, nodes exhibiting a high 4-Hr arbitrage potential (or AVI) may differ from those exhibiting high 2-Hr arbitrage potential. It may also be noted that by changing the time-period T of evaluation for 1 charge/discharge cycle, AVI can gauge the arbitrage potential available at a given node (e.g., albeit with a slightly different usage pattern). For instance, if T is set at 24 hours and D at 4 hours, then the resulting AVI provides the 4-hr arbitrage potential assuming 1 charge/discharge cycle per day (i.e., 24 hours). Alternatively or additionally, if T is set at 48 hours and D at 4 hours, then the resulting AVI provides the 4-hr arbitrage potential assuming 1 charge/discharge cycle per every 2 days (i.e., 48 hours).
(26) Note that the AVI module 192 may utilize an iterative algorithm to ensure no overlap between the hours exhibiting most optimal charge and most optimal discharge potential bearing in mind that an energy storage facility 102 cannot charge and discharge at the same time. So the D-hr AVI determined for each window may be subject to this constraint.
(27) Moving to
(28) It may now be useful to look at examples of data that may be generated by a siting data creator 188 and accessed through a user interface 182 of the energy storage siting system 180.
(29) For this example, the input parameters (e.g., as set by a user through the user interface 182) have been set as follows: energy storage duration D=4 hours; time period of evaluation for 1 charge/discharge cycle (hours)=24 hours; CF—consecutive hour flag ON (e.g., discharge hours must occur consecutively, and charge hours must occur consecutively).
(30) In this case, the AVI assessment has been performed for generation resource nodes (“Nodes”) comprising the Texas grid for Quarter 1, 2019 (indicated under “Period of Assessment” column) along with the 4-Hr AVI assessment for that node, where the 4-Hr AVI assessment may be an average 4-Hr assessment as determined from a 4-Hr AVI assessment determined for that node for each time period (here day or 24 hours) during the period of assessment (here quarter 1). Each node has a corresponding particular geographic location.
(31) Thus, a user may interact with the user interface to select a particular node on the list to obtain more data regarding that particular node.
(32) A user may interact with the user interface to select a particular month on the list of months for the node to obtain more data regarding that particular node.
(33) Any restrictive language used in conjunction with any embodiments as disclosed herein such as “must,” “requires,” “needed,” or the like should be taken as applying only to those specific embodiments and not to embodiments as disclosed generally.
(34) The invention and the various features and advantageous details thereof are explained more fully with reference to the nonlimiting embodiments that are illustrated in the accompanying drawings and detailed in the following description. Descriptions of well-known starting materials, processing techniques, components and equipment are omitted so as not to unnecessarily obscure the invention in detail. It should be understood, however, that the detailed description and the specific examples, while indicating preferred embodiments of the invention, are given by way of illustration only and not by way of limitation. Various substitutions, modifications, additions and/or rearrangements within the spirit and/or scope of the underlying inventive concept will become apparent to those skilled in the art from this disclosure. Embodiments discussed herein can be implemented in suitable computer-executable instructions that may reside on a computer readable medium (e.g., a hard drive (HD)), hardware circuitry or the like, or any combination.
(35) Embodiments of a hardware architecture for implementing certain embodiments are described herein. One embodiment can include one or more computers communicatively coupled to a network.
(36) At least portions of the functionalities or processes described herein can be implemented in suitable computer-executable instructions. The computer-executable instructions may be stored as software code components or modules on one or more computer readable media (such as non-volatile memories, volatile memories, direct access storage drive (DASD) arrays, magnetic tapes, floppy diskettes, hard drives, optical storage devices, etc. or any other appropriate computer-readable medium or storage device). In one embodiment, the computer-executable instructions may include lines of compiled C++, Java, hypertext markup language (HTML), or any other programming or scripting code.
(37) Additionally, the functions of the disclosed embodiments may be shared/distributed among two or more computers in or across a network. Communications between computers implementing embodiments can be accomplished using any electronic, optical, radio frequency signals, or other suitable methods and tools of communication in compliance with known network protocols.
(38) As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a process, product, article, or apparatus that comprises a list of elements is not necessarily limited only those elements but may include other elements not expressly listed or inherent to such process, product, article, or apparatus. Further, unless expressly stated to the contrary, “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present) and B is false (or not present), A is false (or not present) and B is true (or present), and both A and B are true (or present).
(39) Additionally, any examples or illustrations given herein are not to be regarded in any way as restrictions on, limits to, or express definitions of, any term or terms with which they are utilized. Instead, these examples or illustrations are to be regarded as being described with respect to one particular embodiment and as illustrative only. Those of ordinary skill in the art will appreciate that any term or terms with which these examples or illustrations are utilized will encompass other embodiments which may or may not be given therewith or elsewhere in the specification and all such embodiments are intended to be included within the scope of that term or terms. Language designating such nonlimiting examples and illustrations includes, but is not limited to: “for example,” “for instance,” “e.g.,” “in one embodiment.”
(40) Benefits, other advantages, and solutions to problems have been described above with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any component(s) that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as a critical, required, or essential feature or component.