Method and system for scheduling the discharge of distributed power storage devices and for levelizing dispatch participation
Claim Score by NHIP
Abstract
Disclosed is a computerized method for dispatching energy from distributed resources in a discharge event so that the energy stored in individual devices is levelized, or so that an operator request is met. Evaluation of event parameters may be deferred. The method may be utilized to dispatch energy from plug-in electric vehicles. Systems and methods to account for electricity dispatched to or from electric vehicles are disclosed. Systems and methods for incentivizing consumers to participate in a dispatch event or curtail energy use are disclosed.

Term
4.8 yearsto projected expiry
Projected expiry 9 July 2031, counted from filing; an application has no term until it is granted.
- Priority
- Filed
- Published
- Today
- Projected expiry
53 claims: 10 independent, 43 dependent
- 1A method for dispatching energy from distributed resources in a discharge event so that the energy stored in individual devices is levelized, comprising the steps of:receiving a dispatch request comprising an amount of power required during a dispatch event and a duration of the event;determining accomplishability of the dispatch request;determining individual resource participation in the dispatch event utilizing rules that set the amount of energy to be discharged from each participating resource so as to keep the level of energy stored in each individual resource equal relative to the energy level of other participating resources;and, scheduling individual resource dispatches.
- 7A method for dispatching energy from distributed resources to meet an operator request, comprising the steps of:receiving a dispatch request comprising an amount of power required during a dispatch event and a duration of the event;determining accomplishability of the dispatch request, determining individual resource participation in a planned dispatch event;scheduling individual resource dispatches at a future time;and, commanding said individual resources to dispatch energy at said future time;wherein said receiving, determining, scheduling, and commanding steps are performed by one or more computing devices.
- 15Broadest claimClaim Score 75, broad(NHIP)A method for dispatching energy from distributed resources that attempts to bring stored energies to level, comprising the steps of:receiving a dispatch request;determining accomplishability of the dispatch request;determining individual resource participation in a planned dispatch event utilizing rules which set the rate at which participating distributed resources discharge energy such that each said resource runs out of energy in substantially the same duration of time;and, scheduling individual resource dispatches.
- 17A method for dispatching energy from distributed resources that defers evaluation of event parameters, comprising the steps of:receiving a dispatch request;determining accomplishability of the dispatch request, determining individual resource participation in a planned dispatch event;scheduling individual resource dispatches at a future time;re-determining accomplishability of the dispatch request prior to said future time;and, commanding said individual resources to dispatch energy based upon said re-determination of accomplishability;wherein said receiving, determining, scheduling, re-determining and commanding steps are performed by one or more computing devices.
- 20A method for dispatching energy from plug-in electric vehicles, comprising the steps of:receiving a dispatch request;determining accomplishability of the dispatch request, using a data network to determine availability of individual PEVs at a requested future time for a dispatch event;determining resource participation in a planned dispatch event based upon said availability;scheduling individual PEV dispatches at the future time;and, commanding said individual resources to dispatch energy at said future time;wherein said receiving, determining, scheduling, and commanding steps are performed by one or more computing devices.
- 26A method of receiving and transmitting data to account for electricity flowing through a charging receptacle to or from a storage device in an electric vehicle, comprising the steps of:receiving at a clearinghouse a request for authorization that has been generated in response to connection of an electric vehicle to a charging receptacle, said request for authorization including identification data sufficient to identify a first account of a first utility company supplying electricity to said charging receptacle and to identify an electricity billing account associated with an account holder at a second utility company;determining that the account holder is authorized to charge said account for electricity drawn from said charging receptacle;transmitting data enabling the flow of electricity at said charging receptacle;receiving data indicating the amount of electricity drawn from said charging receptacle to charge said storage device in said electric vehicle;using said data to cause said account associated with the first utility company to be credited;and, using said data to cause said utility company account to be charged;wherein said receiving, determining, transmitting, receiving data, and using data steps are performed by one or more computers.
- 36A method for establishing the lowest clearing price of energy to be charged by one or more utility companies to customers, comprising the steps of:transmitting a message for display in a plurality of consumer user interfaces, said message indicating the utility company's desire to purchase an amount of energy;receiving data indicating a plurality of values for stored energy entered or selected through said consumer user interface;and, using said data indicating a plurality of values for stored energy to determine a lowest price at which a desired quantity of energy is purchasable from consumers who have entered or selected values via said plurality of consumer user interfaces.
- 38A method for motivating consumers to discharge energy from distributed energy resources as part of an energy dispatch event, comprising the steps of:transmitting data comprising an offer of an incentive to participate in an energy dispatch event to a plurality of consumers;receiving from one or more of said plurality of consumers data comprising an acceptance of said offer of said incentive;and, iteratively transmitting one or more further offers of increasing incentives to participate in said energy dispatch event and receiving one or more further acceptances until receipt of sufficient consumer acceptance to support a desired level of participation in said energy dispatch event.
- 42A method of incentivizing consumer participation in an energy dispatch event, comprising the steps of:transmitting data to a plurality of consumer user interfaces, said data comprising an offer of a monetary incentive in exchange for curtailment of energy use by the consumer;receiving data from a plurality of said consumer interfaces, said data comprising an indication of acceptance of said offer of said monetary incentive;and, causing said monetary incentive to be provided to consumers who have transmitted said data comprising an indication of acceptance;wherein said steps of transmitting data, receiving data, and causing said monetary incentive to be provided are performed by one or more computers.
- 48A method of incentivizing consumer participation in an energy dispatch event, comprising the steps of:transmitting data to a plurality of consumer user interfaces, said data comprising an offer of a monetary incentive in exchange for making a distributed energy resource available on an electrical power grid;receiving data from a plurality of said consumer interfaces, said data comprising an indication of acceptance of said offer of said monetary incentive;and, causing said monetary incentive to be provided to consumers who have transmitted said data comprising an indication of acceptance;wherein said steps of transmitting data, receiving data, and causing said monetary incentive to be provided are performed by one or more computers.
Independent claims10
148 paragraphs in 5 sections, as filed
0001This application claims the benefit of U.S. Provisional Application No. 60/916,861, entitled Method and System for Scheduling The Discharge Of Distributed Power Storage Devices And For Levelizing Dispatch Participation, filed May 9, 2007, which is herein incorporated by reference in its entirety.
0002This application includes material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent disclosure, as it appears in the Patent and Trademark Office files or records, but otherwise reserves all copyright rights whatsoever.
FIELD OF THE INVENTION
0003The present invention relates in general to the field of electric power distribution systems, and in particular to methods and systems for the discharge of stored energy from distributed energy resources.
BACKGROUND OF THE INVENTION
0004Work scheduling of centralized electricity generation, such as from electricity power plants, is known. Such work scheduling includes, e.g., scheduling of discharge and curtailment events. However, known solutions are poorly applicable for determining optimal schedules for distributed energy resources, such as distributed consumer electrical power generation devices and distributed power storage devices such as batteries in consumer power control appliances. Such distributed energy resources are described in U.S. patent application Ser. No. 11/968,941 entitled “Utility Console for Controlling Aggregated Energy Resources” filed Jan. 3, 2008, which is incorporated herein by reference in its entirety. Known solutions for scheduling discharge and curtailment events are particularly inapplicable to distributed energy resources where the quantity of such resources is relatively large and where the discharge capability varies for each unit.
0005One distributed energy resource is plug-in electric vehicles (“PEVs”). A PEV is any vehicle such as a car, truck, bus, motorcycle, etc that draws electricity from a power distribution network (“grid”), stores the electricity through some means, and uses electricity to power the vehicle. A PEV may come in a variety of forms, including hybridized drivetrain and electric-only drivetrain vehicles.
0006Hybridized drivetrain vehicles use a combination of electricity drawn from the grid and on-board motive force that may be used to both drive the vehicle and/or as a generation source to extend the range of the vehicle by augmenting the on-board electricity storage. The on-board motive force/generation source can include a variety of power plants including gasoline, diesel, bio-fuel combustion engines driving a generator. Or the on-board electricity generation may come from more advanced means such as fuel cells that use hydrogen, or other fuels to generate a flow of electricity. In the future, it is possible that some part of the electricity generation will come from photo-voltaic generation, kinetic energy capture, or advanced technology means. In general, most hybridized drivetrains generate additional electricity for on-board storage through regeneration by using the motor as a generator during coasting and braking operations.
0007Electric-only drivetrain vehicles use only an electric motor(s) to provide motive force coupled with sufficient electricity storage to provide suitable driving characteristics and range. As with the hybridized drivetrain, the energy storage may be in a variety of forms: chemical batteries, electrostatic capacitive storage, or a combination of the two. Other forms of energy storage may include electro-kinetic such as flywheels, or thermal methods that rely upon the energy captured and released during phase-change operations. The electric-only drivetrain may use regeneration (see above) to capture electricity for storage to extend the range of the vehicle. In addition, there is the potential to use extra-vehicular means to generate or transfer electricity into the car for direct motive force or to supplement the energy storage. Examples of this include magneto-coupling built into roadways, linear generators embedded into roadways, or other means not yet contemplated that involve interaction between the vehicle and its environment.
0008The amount of electricity storage on the vehicle varies as to whether it is a hybridized or an all-electric configuration. Current development efforts by the automotive community indicate that a hybridized drivetrain requires 12-16 kWh of on-board energy storage and that all electric vehicles will require 50-60 kWh of energy storage, depending upon desired range and performance characteristics. The primary limiting factors of the storage capacity remain both physical size, weight, and cost of the storage medium. The secondary limiting factors will be crashworthiness, replenishment times, and electrical infrastructure within the home or at commercial charging stations. As new materials and methods come to market, the on-board storage capacity will increase over time with the significant possibility that an all-electric drivetrain will be prevalent in the daily transportation vehicles on the road.
0009While the PEV has tremendous consumer and societal benefits, it potentially has a significant negative impact on electric grid operations. This is due to the charging requirements of the vehicle and innate consumer behavior. For example, a PEV that has 16 kWh of energy storage that is depleted 80% every day will require 12.8 kWh of replenishment before use again the next day. A typical 110V wall outlet of 20 amp capacity—with many only at 15 amps—limits the current draw to roughly 2000 watts. Charge management algorithms for chemical batteries are non-linear with a decrease in current flow into the batteries when they are both near empty and near full. As such, the charge time is extended beyond the six hours normally expected in this case if the charging cycle was linear. The amount of “stretch” required for optimal charge management varies by battery type and manufacturer.
0010The combination of the high draw rate (2000 watts), the time required (6-8 hours) to replenish the stored energy, and the timing of the consumer places a significant burden on the electric power delivery system when millions of PEVs are on the road. Once the energy storage device is in “bulk charge” mode—neither almost empty nor almost full—it is drawing current at a 100% duty cycle. This is unlike any other major consumption item within most households except lighting, which generally accounts for a relatively small percentage of electricity consumption.
0011Consumer driving habits factor into the problem as well. Assuming that PEVs are used as commuter vehicles, then the typical driving pattern is to unplug in the morning, drive 30-50 miles per day round trip, and then come home between 6 pm and 7 pm to plug the vehicle back into the grid for replenishment. When compared to the average peak draw of a household over the period of one hour, the PEV at 110V/20 A current flow effectively doubles the consumption of the house during a typical evening peak demand period. This level of consumption is not planned for in the generation or distribution capacity of electric service providers. With as little as a few hundred PEVs on a distribution feeder, there can be significant delivery issues for the electric utility. With as little as a few thousand within a service territory charging at peak, there can be significant issues related to generation capacity.
0012Electric only drivetrains with 50-60 kWh of storage exacerbate this problem further. Normal daily driving habits will probably not drain the stored energy beyond that expected by the hybridized drivetrain. However, a longer daily use pattern, or long trips will require up to three times the replenishment time at 110V/20 A, which results in up to 18 hours of charge time, which is not practical for most applications. While the circuits to support replenishment can be upgraded to 220V at high current limits, the energy storage characteristics will determine how much current can be flowed into the device without damage. However, the larger the current draw, the larger the problem for effective grid management.
SUMMARY OF THE INVENTION
0013In an embodiment, the invention provides a computerized method for dispatching energy from distributed resources in a discharge event so that the energy stored in individual devices is levelized. A dispatch request including an amount of power required during a dispatch event and a duration of the event is received, and accomplishability of the dispatch request is determined. Individual resource participation in the dispatch event is determined utilizing rules that set the amount of energy to be discharged from each participating resource so as to keep the level of energy stored in each individual resource equal relative to the energy level of other participating resources. Individual resource dispatches are then scheduled, and the resources are commanded to dispatch energy at their appointed time.
0014In another embodiment, the invention provides a computerized method for dispatching energy from distributed resources to meet an operator request. A dispatch request including an amount of power required during a dispatch event and a duration of the event is received, and accomplishability of the dispatch request is determined. Individual resource participation in a planned dispatch event is then determined, and individual resource dispatches are scheduled at a future time. At that time, the individual resources are commanded to dispatch energy.
0015In another embodiment, the invention provides a computerized method for dispatching energy from distributed resources that defers evaluation of event parameters. A dispatch request is received, and a determination is made of the accomplishability of the dispatch request. Individual resource participation in a planned dispatch event is then determined. Individual resource dispatches are scheduled at a future time. Accomplishability of the dispatch request is redetermined prior to said future time, and individual resources are commanded to dispatch energy based upon such re-determination of accomplishability.
0016In another embodiment, the invention provides a computerized method for dispatching energy from plug-in electric vehicles. A dispatch request is received, and accomplishability of the dispatch request is determined. A data network is used to determine availability of individual PEVs at a requested future time for a dispatch event. Resource participation in a planned dispatch event is determined based upon such availability. Individual PEV dispatches are scheduled at the future time. Individual resources are commanded to dispatch energy at such time.
0017In another embodiment, the invention provides a method of receiving and transmitting data to account for electricity flowing through a charging receptacle to or from a storage device in an electric vehicle. A clearinghouse receives a request for authorization that has been generated in response to connection of an electric vehicle to a charging receptacle, the request for authorization including identification data sufficient to identify a first account of a first utility company supplying electricity to said charging receptacle and to identify an electricity billing account associated with an account holder at a second utility company. A determination is made that the account holder is authorized to charge said account for electricity drawn from the charging receptacle. Data is transmitted to enable the flow of electricity at the charging receptacle. Data indicating the amount of electricity drawn from the charging receptacle to charge the storage device in said electric vehicle is received by the clearinghouse. The data is used to cause the account associated with the first utility company to be credited and the utility company account to be charged.
0018In other embodiments, the invention provides systems and methods for incentivizing consumers to participate in a dispatch event or curtail energy use.
BRIEF DESCRIPTION OF THE DRAWINGS
0019The foregoing and other objects, features, and advantages of the invention will be apparent from the following more particular description of preferred embodiments as illustrated in the accompanying drawings, in which reference characters refer to the same parts throughout the various views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating principles of the invention.
0020<figref idref="DRAWINGS">FIG. 1</figref> illustrates one embodiment of a system which is capable of supporting the dispatch of energy from distributed energy resources;
0021<figref idref="DRAWINGS">FIG. 2</figref> shows a block flow diagram illustrating the steps of levelizing and scheduling the dispatch of distributed energy resources;
0022<figref idref="DRAWINGS">FIG. 3A</figref> illustrates the dispatch of hypothetical distributed resources;
0023<figref idref="DRAWINGS">FIG. 3B</figref> shows a representation of hypothetical dispatch requests for distributed resources;
0024<figref idref="DRAWINGS">FIG. 3C</figref> illustrates a levelized dispatch of distributed resources;
0025<figref idref="DRAWINGS">FIG. 4</figref> shows a block flow diagram of a method of scheduling the dispatch of distributed resources;
0026<figref idref="DRAWINGS">FIG. 5</figref> illustrates a method of scheduling the dispatch of distributed resources;
0027<figref idref="DRAWINGS">FIG. 6</figref> shows another method of scheduling the dispatch of distributed resources;
0028<figref idref="DRAWINGS">FIG. 7</figref> illustrates a system capable of supporting the dispatch of energy from mobile distributed energy resources;
0029<figref idref="DRAWINGS">FIG. 8</figref> shows a block flow diagram of a method of accounting for a transaction involving the dispatch of energy from distributed energy resources;
0030<figref idref="DRAWINGS">FIG. 9</figref> shows one example of a user interface; and
0031<figref idref="DRAWINGS">FIG. 10</figref> shows another example of a user interface.
DETAILED DESCRIPTION
0032The present invention is described below with reference to figures, block diagrams and operational illustrations of methods and devices to manage power generation, consumption, and storage. It is understood that each block of the block diagrams or operational illustrations, and combinations of blocks in the block diagrams or operational illustrations, can be implemented by means of analog or digital hardware and computer program instructions. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, ASIC, or other programmable data processing apparatus, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, implements the functions/acts specified in the block diagrams or operational block or blocks. In some alternate implementations, the functions or acts noted in the blocks can occur out of the order noted in the operational illustrations. For example, two blocks shown in succession can in fact be executed substantially concurrently or the blocks can sometimes be executed in the reverse order, depending upon the functionality or acts involved.
0033The operator of a utility control system, if given a request to dispatch or curtail some aggregate total amount of energy (or power) at some point in the future, may attempt to meet this request by commanding a distributed set of energy resources to individually produce or curtail at such future point a certain amount of energy (or power). Examples of energy resources may include various types of batteries. Energy resources may also include devices or systems for generating electricity. Other examples of energy resources may include power consuming devices, such as appliances, which if turned off or removed from the grid reduce the amount of demand for power from the grid, thus freeing up grid capacity. These may all be referred to as “distributed resources” as well.
0034<figref idref="DRAWINGS">FIG. 1</figref> illustrates one embodiment of a system and network which is capable of supporting the dispatch of energy from distributed energy resources. An electrical utility has an operations control center <b>105</b>. Within the control center <b>105</b>, one or more servers <b>110</b> host applications software which implement various applications including a utility console. The servers <b>110</b> provide information to a display device <b>115</b> capable of supporting a user interface. The servers <b>110</b> are additionally connected to one or more storage devices <b>120</b> which may provide for storage of one or more actively used databases or which may provide backup or archiving of data collected by the servers. An example of applications software described above is disclosed in U.S. patent application Ser. No. 11/968,941 entitled “Utility Console for Controlling Aggregated Energy Resources” filed Jan. 3, 2008, which is incorporated herein by reference in its entirety.
0035The servers are connected to the local network <b>125</b> of the operations control center. The local network <b>125</b> is connected to the Internet <b>350</b> though conventional routers and/or firewalls <b>130</b>. The local network <b>125</b> may also be connected to a common carrier wireless network or a private network <b>300</b>. The local network <b>125</b> is also connected to a wide area network <b>200</b> which is connected to one or more power generation points <b>210</b>.
0036Power consumers <b>400</b> in the service territory of the utility have one or more power control appliances <b>410</b>. Power control appliances <b>410</b> may include one or more energy storage units, such as batteries (not shown). Power is transmitted to the consumer <b>400</b> over transmission lines <b>220</b> which form part of the local power grid. Power drawn by a consumer from the grid may be supplied, in part, by one or more power generation points <b>210</b>, or may originate in remote locations (not shown). Power enters the consumer premises at a meter <b>420</b> and is routed to the power control appliance <b>410</b>, which may comprise an onboard computer, energy storage, and an inverter/charger.
0037Power transmission lines <b>220</b> can additionally support transmission of data between the power generation point <b>210</b> and power consumers <b>400</b>. The power generation point <b>210</b> is connected to the operations control center <b>105</b> through the wide area network (WAN) <b>200</b> and is connected to consumers <b>400</b> though power transmission lines <b>220</b>. Thus, the servers <b>110</b> may receive data from or transmit data or commands to distributed energy management controllers <b>410</b> using the Internet <b>350</b>, the wireless network <b>300</b>, or the WAN <b>200</b>.
0038The power control appliance <b>410</b> may be configured to control one or more electrical circuits which supply power to one or more power consuming devices <b>430</b>, such as household appliances. Power control appliance <b>410</b> may also be configured to supply electricity to, or to draw electricity from, a mobile device capable of energy storage, such as a plug-in electric vehicle (PEV) <b>460</b>. In one embodiment, the system uses a number of load controllers with integrated measurement and/or a communicating thermostat (not shown). Load controllers with integrated measurement can be installed by placing them inline with the circuit to be measured and controlled, and may be installed near the main load panel (though there is no requirement to do so). Any number of load controllers with integrated measurement may be installed at a site. The power control appliance <b>410</b> may additionally have control connections to the power consuming devices <b>430</b> which allow the power control appliance <b>410</b> to control the operation of the power consuming devices <b>430</b>.
0039The power control appliance <b>410</b> may be further connected to one or more power generation devices <b>440</b>, such as solar panels, which are capable of generating power. Power generated by the power generation devices <b>440</b> may is routed to the power control appliance <b>410</b> for use by the consumer. Under the control of the power control appliance <b>410</b> power generated by the power generation devices <b>440</b> may also be routed, in whole or in part, to the power grid <b>220</b>. It may also be stored in storage batteries, or in the storage capacity of a PEV.
0040The power control appliance <b>410</b> may be controlled at least in part by the consumer using a user interface displayed on a display device <b>450</b>. Display device <b>450</b> may be a mobile device capable of supporting a user interface. Device <b>450</b> may connect directly to the Internet <b>350</b>, the wireless network <b>300</b>, or the WAN <b>200</b>, or it may connect through power appliance <b>410</b>. Power control appliance <b>410</b> may be further controlled remotely by the utility control center <b>105</b>, for example, over the Internet <b>350</b>, or over a common carrier wireless network <b>300</b>. In one embodiment, the servers <b>110</b> at the utility control center <b>105</b> may receive and transmit data and commands to the power appliance using the Internet <b>350</b>, the wireless network <b>300</b>, or the WAN <b>200</b>.
0041Further examples of power control appliances which may be used in embodiments of the system illustrated in <figref idref="DRAWINGS">FIG. 1</figref> are described in U.S. Pat. No. 7,274,975, entitled “Optimized Energy Management System.”
0042In order to match electricity supply and demand, a utility control system operator may desire to curtail load or dispatch energy from distributed energy resources. One method of meeting a request to dispatch or curtail energy is to command individual distributed energy resources differently, based on the state of each energy resource at the time the command is executed, while at the same time attempting to ensure that the sum of all the individual actions meets the requirements of the overall request. In addition, it is desirable to dispatch stored energy in such a way so as to preserve as much as possible the ability to meet subsequent dispatch requests.
0043<figref idref="DRAWINGS">FIG. 2</figref> shows a block flow diagram illustrating the steps of levelizing and scheduling the dispatch of distributed energy resources <b>500</b>. Using information provided to the utility control center <b>105</b> by distributed energy resources, such as, for example, current stored capacity and rate of discharge, a utility creates a dispatch event <b>510</b> using a control system such as that described above in, for example, the utility control center <b>105</b>. Specifications for the dispatch event include the amount of power desired during the event and the duration of the dispatch event. Next, the accomplishability of the requested dispatch event is determined <b>520</b>. Next, if the dispatch request is accomplishable, the amount of energy to be discharged from each participating unit is determined <b>530</b>. Then, the energy dispatch of individual units is scheduled and the instructions for each distributed resource are determined <b>540</b>. These steps are further described below. It should be understood that distributed energy resources can mean any device capable of storing and discharging electricity and communicating with a system such as shown in <figref idref="DRAWINGS">FIG. 1</figref>. Distributed energy resources include the energy storage batteries of power control appliance <b>410</b>, consumer power generation devices such as solar panels or generators, and the mobile energy storage capabilities of PEV <b>460</b> or any other mobile energy storage device.
0044Given the specifications for a dispatch event, the accomplishability of the requested dispatch event is determined in step <b>520</b>. One example of determining the accomplishability of a dispatch event is discussed below.
0045For example, with reference to <figref idref="DRAWINGS">FIG. 3A</figref>, consider three energy storage devices <b>610</b>, <b>620</b>, and <b>630</b>. Devices <b>620</b> and <b>630</b> contain 1.8 kWh of stored energy, and device <b>610</b> contains 10.8 kWh of stored energy. Each device is capable of releasing (dispatching) its stored energy at 3.6 kW. A request for a constant 10.8 kW dispatch over a 1 hour period may at first seem accomplishable because there is sufficient stored energy to meet the dispatch request.
0046However, in fact the dispatch is not accomplishable because all three units would be required to dispatch at 3.6 kW (their maximum rate), and at that rate devices <b>620</b> and <b>630</b> would run out of energy in half an hour. This is shown by the inequality
0000<maths id="MATH-US-00001" num="00001"><math overflow="scroll"><mrow><mn>10.8</mn><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo>=</mo><mrow><mrow><mi>K</mi><mo>></mo><mrow><munderover><mo>∑</mo><mi>i</mi><mi>n</mi></munderover><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mrow><mi>min</mi><mo></mo><mrow><mo>(</mo><mrow><mi>Y</mi><mo>,</mo><mfrac><mrow><mi>E</mi><mo></mo><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></mrow><mi>d</mi></mfrac></mrow><mo>)</mo></mrow></mrow></mrow></mrow><mo>=</mo><mrow><mrow><mn>1.8</mn><mo>+</mo><mn>1.8</mn><mo>+</mo><mn>3.6</mn></mrow><mo>=</mo><mn>7.2</mn></mrow></mrow></mrow></math></maths><img file="US2008281663A1_D0001.tif" />
0000where the rate is given by K and the duration given by d, for n distributed energy storage devices capable of releasing stored energy at a constant rate Y, where the amount of energy stored in the i'th device (fuel) is given by E(i). In other words, if the conditions expressed in the inequality are met, a dispatch request is accomplishable.
0047If the energy level in every device were equal, then the above formula would become
0000<maths id="MATH-US-00002" num="00002"><math overflow="scroll"><mrow><mrow><mi>K</mi><mo>≤</mo><mrow><munderover><mo>∑</mo><mi>i</mi><mi>n</mi></munderover><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mrow><mi>min</mi><mo></mo><mrow><mo>(</mo><mrow><mi>Y</mi><mo>,</mo><mfrac><mi>E</mi><mi>d</mi></mfrac></mrow><mo>)</mo></mrow></mrow></mrow></mrow><mo>=</mo><mrow><mrow><mi>min</mi><mo></mo><mrow><mo>(</mo><mrow><mi>nY</mi><mo>,</mo><mrow><munderover><mo>∑</mo><mi>i</mi><mi>n</mi></munderover><mo></mo><mfrac><mi>E</mi><mi>d</mi></mfrac></mrow></mrow><mo>)</mo></mrow></mrow><mo>.</mo></mrow></mrow></math></maths><img file="US2008281663A1_D0002.tif" />
0048This result has several implications. First, when the energy levels in storage devices are kept equal, the rate at which energy can be dispatched over a fixed duration is maximized. Second, when the energy stored in each individual device is levelized (i.e. kept equal relative to the energy level of other available resources), a set of distributed generation or stored energy resources may be treated as a single large aggregate energy storage device, with a maximum dispatch rate equal to the sum of all the individual dispatch rates, and the stored energy equal to the sum of all the stored energies. Third, over multiple dispatch events where energy is dispatched from different sub-groups of energy storage devices, minimizing the variance in energy storage levels maximizes the ability to meet future dispatch requests.
0049In step <b>530</b>, if a dispatch request is accomplishable, the amount of energy to be discharged from each participating unit is determined. For example, with reference to <figref idref="DRAWINGS">FIG. 3B</figref>, consider a hypothetical situation where two dispatch requests are made for three distributed resources, A, B, and C, each capable of dispatching energy at 3.6 kW and all initially filled with 10.8 kWh of energy. The first request is for 7.2 kW for 3 hours starting at time t, and the second request is for 10.8 kW, lasting for 1 hour, to begin at t+3 hours.
0050Whether the second dispatch is accomplishable depends on how the first dispatch is performed. The first dispatch could be performed by instructing devices A and B to dispatch at their maximum rate for the full three hour period, as shown in <figref idref="DRAWINGS">FIG. 3B</figref>. However, in that case the second dispatch is not accomplishable because units A and B have been drained of all their stored energy, and unit C is only capable of dispatching at a rate of 3.6 kW. If, however, the first dispatch levelized the stored energy of each of the three units, one example of which is shown in <figref idref="DRAWINGS">FIG. 3C</figref>, then the second dispatch would be accomplishable.
0051One example of an algorithm for determining participation information for an accomplishable dispatch that maximally reduces variance among the stored energy in the distributed resources is provided. Other equivalent embodiments of this specific method should be readily apparent to one of ordinary skill in the art without departing from the scope of the method disclosed here.
0052n=number of units that can be considered, Y=the rate in kW that an individual unit can dispatch, and E(i)=a function returning the initial energy in each unit. The specification for a dispatch request (assumed to be accomplishable) include the number of kW requested (K) and the duration of the dispatch, (d).
0000<tables id="TABLE-US-00001" num="00001"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217pt" align="left" /><thead><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry>M := S := { }</entry></row><row><entry>U := All available units</entry></row><row><entry>c := 0</entry></row><row><entry>D[i] := 0</entry></row><row><entry>let R(i) = E(i) − D[i]</entry></row><row><entry>while(c < dK)</entry></row><row><entry> if (|S| = 0)</entry></row><row><entry> I = {i ε U : R(i) = max(R(i))} ; S = I ; U = U − I</entry></row><row><entry> r := R(i) : i ε S</entry></row><row><entry> e := min((dK − c)/|S|,dY − max(D[i]) : i ε S,r − max(R(i)) : i ε U)</entry></row><row><entry> c := c + e|S|</entry></row><row><entry> ∀i ε S : D[i] = D[i] +e</entry></row><row><entry> if (c < dK)</entry></row><row><entry> I := {i ε S : D[i] = dY} ; M := M ∪ I ; S := S − I</entry></row><row><entry> r := R(i) : i ε S</entry></row><row><entry> I := {i ε U : R(i) = r} ; S := S ∪ I ; U := U − I</entry></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0053Once completed, every unit for which i∈M∪S will be scheduled to dispatch for
0000<maths id="MATH-US-00003" num="00003"><math overflow="scroll"><mfrac><mrow><mi>D</mi><mo></mo><mrow><mo>[</mo><mi>i</mi><mo>]</mo></mrow></mrow><mi>Y</mi></mfrac></math></maths><img file="US2008281663A1_D0003.tif" />
0000hours in order to meet the dispatch request.
0054Next, in step <b>540</b>, when participation information has been determined for distributed resources in an accomplishable discharge event, the energy dispatch of individual units is scheduled and the instructions for each distributed resource are determined. One example of a method of scheduling the dispatch is provided. Other equivalent embodiments of this specific method should be readily apparent to one of ordinary skill in the art without departing from the scope of the method disclosed here.
0055Let ScheduleDispatch(i,t<sub>start</sub>,t<sub>end</sub>)be a function which commands unit i to dispatch between the times t<sub>start </sub>and t<sub>end </sub>
0000<tables id="TABLE-US-00002" num="00002"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="21pt" align="left" /><colspec colname="1" colwidth="196pt" align="left" /><thead><row><entry /><entry namest="offset" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /><entry>t := t<sub>0</sub></entry></row><row><entry /><entry> foreach (i ∈ I)</entry></row><row><entry /><entry></entry></row><row><entry /><entry> <maths id="MATH-US-00004" num="00004"><math overflow="scroll"><mrow><mi>if</mi><mo></mo><mrow><mo>(</mo><mrow><mrow><mi>t</mi><mo>-</mo><msub><mi>t</mi><mn>0</mn></msub><mo>+</mo><mfrac><mrow><mi>D</mi><mo></mo><mrow><mo>[</mo><mi>i</mi><mo>]</mo></mrow></mrow><mi>Y</mi></mfrac></mrow><mo><</mo><mi>d</mi></mrow><mo>)</mo></mrow></mrow></math></maths><img file="US2008281663A1_D0004.tif" /></entry></row><row><entry /><entry></entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="49pt" align="left" /><colspec colname="1" colwidth="168pt" align="left" /><tbody valign="top"><row><entry /><entry><maths id="MATH-US-00005" num="00005"><math overflow="scroll"><mrow><mi>ScheduleDispatch</mi><mo></mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo></mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><mi>t</mi><mo>,</mo><mrow><mi>t</mi><mo>+</mo><mfrac><mrow><mi>D</mi><mo></mo><mrow><mo>[</mo><mi>i</mi><mo>]</mo></mrow></mrow><mi>Y</mi></mfrac></mrow></mrow><mo>)</mo></mrow></mrow></math></maths><img file="US2008281663A1_D0005.tif" /></entry></row><row><entry /><entry></entry></row><row><entry /><entry><maths id="MATH-US-00006" num="00006"><math overflow="scroll"><mrow><mi>t</mi><mo>:=</mo><mrow><mi>t</mi><mo>+</mo><mfrac><mrow><mi>D</mi><mo></mo><mrow><mo>[</mo><mi>i</mi><mo>]</mo></mrow></mrow><mi>Y</mi></mfrac></mrow></mrow></math></maths><img file="US2008281663A1_D0006.tif" /></entry></row><row><entry /><entry></entry></row><row><entry /><entry>else</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="77pt" align="left" /><colspec colname="1" colwidth="140pt" align="left" /><tbody valign="top"><row><entry /><entry>ScheduleDispatch (i, t, t<sub>0 </sub>+ d)</entry></row><row><entry /><entry></entry></row><row><entry /><entry><maths id="MATH-US-00007" num="00007"><math overflow="scroll"><mrow><mi>ScheduleDispatch</mi><mo></mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo></mo><mrow><mo>(</mo><mrow><mi>i</mi><mo>,</mo><msub><mi>t</mi><mn>0</mn></msub><mo>,</mo><mrow><mi>t</mi><mo>+</mo><mfrac><mrow><mi>D</mi><mo></mo><mrow><mo>[</mo><mi>i</mi><mo>]</mo></mrow></mrow><mi>Y</mi></mfrac><mo>-</mo><mi>d</mi></mrow></mrow><mo>)</mo></mrow></mrow></math></maths><img file="US2008281663A1_D0007.tif" /></entry></row><row><entry /><entry></entry></row><row><entry /><entry><maths id="MATH-US-00008" num="00008"><math overflow="scroll"><mrow><mi>t</mi><mo>:=</mo><mrow><mi>t</mi><mo>+</mo><mfrac><mrow><mi>D</mi><mo></mo><mrow><mo>[</mo><mi>i</mi><mo>]</mo></mrow></mrow><mi>Y</mi></mfrac><mo>-</mo><mrow><mi>d</mi><mo>.</mo></mrow></mrow></mrow></math></maths><img file="US2008281663A1_D0008.tif" /></entry></row><row><entry /><entry namest="offset" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0056However, the method described above does not take into account any minimum dispatch time which a given resource may have (e.g., because of the physical constraints of the storage unit). It also does not address the “splitting” of the dispatch of units from the end of the dispatch back to the beginning, as shown occurring with unit B in <figref idref="DRAWINGS">FIG. 3C</figref>, which shows unit B scheduled for discharge from time t to time t+1, and again from time t+2 to t+3. A method of scheduling accomplishable discharges which addresses these issues is provided below. Other equivalent embodiments of this specific method should be readily apparent to one of ordinary skill in the art without departing from the scope of the method disclosed here.
0057<figref idref="DRAWINGS">FIG. 4</figref> shows a block flow diagram of a method <b>700</b> of scheduling the dispatch of distributed resources. First, resources are allocated for the discharge event <b>710</b>. Next, in step <b>720</b> the start and stop times of the allocated resources are redistributed to minimize any coincidental starting or stopping of the discharge of resources. This is done to minimize the “ripple” (i.e., fluctuations in power) on the electrical grid which may be caused by multiple resources starting or stopping simultaneously. Finally, the start time of each resource is further changed by the addition of a factor, to further minimize ripple. Each step is further described below.
0058In step <b>710</b>, resources are allocated for the discharge event. One way to schedule resources over time is by use of a “bin-packing” method. Resources are selected to fulfill the power and duration requirements of the dispatch request. Referring to <figref idref="DRAWINGS">FIG. 5</figref>, in one embodiment, discharge intervals I(i) are scheduled for the number of participating storage devices (N) using a bin-packing algorithm where T is the maximum length of a bin. In <figref idref="DRAWINGS">FIG. 5</figref>, a filled bin is shown at reference number <b>810</b>. Many known bin-packing algorithms may be applied to step <b>710</b>, such as the first-fit-first-descending algorithm.
0059The purpose of step <b>710</b> is to create full bins, since intervals in a full bin will not require splitting. I(i) must be equal to or less than T, and both quantities must be specified as positive non-zero integers. Each storage unit is assumed to have constant and identical discharge rates, and thus the only parameter needed for each device is the duration of discharge. Units should be chosen such that the time quantum is also the minimum allowable discharge time of any unit.
0060Discharge intervals I(i) are redistributed in step <b>720</b>. Full intervals (F) are reordered to remove even ordering which may be imposed by the allocation in step <b>710</b>. In one embodiment, a hash function may be applied to each interval to sort the intervals, for example, by the vector (hash(bin),hash(interval+bin)). This effectively randomizes the start and stop times of each distributed resource to minimize “ripple” in the rate of discharge.
0061Next, in step <b>730</b>, a bin index B(i) and a starting offset time S(i) are assigned to each interval in F. Intervals for non-full bins (G) are scheduled by stacking them end-to-end, and letting them wrap around the time window T shown in <figref idref="DRAWINGS">FIG. 5</figref>:
0000<tables id="TABLE-US-00003" num="00003"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="77pt" align="left" /><colspec colname="1" colwidth="140pt" align="left" /><thead><row><entry /><entry namest="offset" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /><entry>Let b = max(B) + 1</entry></row><row><entry /><entry>Let p = 0</entry></row><row><entry /><entry>For each G:</entry></row><row><entry /><entry> if p >= T:</entry></row><row><entry /><entry> p := p − T</entry></row><row><entry /><entry> b := b + 1</entry></row><row><entry /><entry> B(i) := b</entry></row><row><entry /><entry> S(i) := p</entry></row><row><entry /><entry> p := p + I(i)</entry></row><row><entry /><entry>NumBins := b + 1</entry></row><row><entry /><entry namest="offset" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0062If S(i)+I(i)>T, the event is split across the time window such that two discharge events are created with start time and duration: (S(i), T−S(i)) and (0, S(i)+I(i)−T). Otherwise the discharge event is simply (S(i), I(i)).
0063At the end of this step, discharge events can be created from all intervals such that the total dispatch at any time does not vary more than a ratio of (1/NumBins) across the time interval T.
0064Next, the start and stop times are further redistributed <b>730</b>. Since the intervals are of discrete size, their boundaries will tend to line up at discrete time intervals. Multiple simultaneous discharge start or stop events may create undesirable “ripple” on the grid. This can be smoothed by “tilting” the schedule. Each interval has been assigned a start time S(i) and a bin index B(i). The tilt is defined by adding a fractional part F(i) to each interval:
0000<br /><i>F</i>(<i>i</i>)=<i>B</i>(<i>i</i>)/NumBins
0065The final start time for an interval is defined as: S(i)+F(i). This will add a ramp-up and ramp-down period for all discharging resources. The ramp-up and ramp-down time lasts exactly one time unit, and the total dispatch power will approach a linear curve. By adding this offset, the number of device transitions over each time quantum is no more than (NumBins*2). Also, by adding this offset, there will never be more than two device transitions that are less than (1/NumBins) time units apart (device transitions will always occur in pairs).
0066<figref idref="DRAWINGS">FIG. 5</figref> shows a graphical view illustrating scheduling of the dispatch of multiple resources over time, where over 25% of intervals were required to split, such as interval <b>820</b>. <figref idref="DRAWINGS">FIG. 6</figref> shows a graphical view illustrating scheduling of the dispatch of multiple resources over time, where interval lengths are uniformly distributed. Note that no intervals were required to split.
0067The discharge scheduling method disclosed above can include several variations from that described. The method of redistributing intervals after the bin-packing step can be varied. Also, the “tilt” step may be omitted, eliminating the ramp-up and ramp-down time at the expense of uneven state transitions.
0068The examples above assume that distributed resources have constant and identical dispatch rates. However, the method may be adapted to distributed energy resources with varying discharge rates. For example, a slightly modified definition of accomplishability may be used in step <b>520</b>. Similarly, in the step of determining participation information <b>530</b>, distributed resources may be levelized on the basis of their potential discharge duration. In addition, the step of scheduling <b>540</b> may be modified to account for variable discharge rates.
0069In one embodiment, slightly modifying the step of determining accomplishability <b>520</b>,
0000<maths id="MATH-US-00009" num="00009"><math overflow="scroll"><mrow><mi>K</mi><mo>≤</mo><mrow><munder><mo>∑</mo><mi>i</mi></munder><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mrow><mi>min</mi><mo></mo><mrow><mo>(</mo><mrow><mfrac><msub><mi>E</mi><mi>i</mi></msub><mi>d</mi></mfrac><mo>,</mo><msub><mi>Y</mi><mi>i</mi></msub></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></maths><img file="US2008281663A1_D0009.tif" />
0000permits a comparison of each distributed resources' individual dispatch rate Y<sub>i</sub>.
0070Similarly, in one embodiment, in the step of determining individual resource participation <b>530</b>, to levelize distributed resources with varying dispatch rates, the stored energy in every resource should be brought to a state where each resource has a fraction of the total remaining energy of all available resources proportional to its dispatch rate:
0000<maths id="MATH-US-00010" num="00010"><math overflow="scroll"><mrow><msub><mi>E</mi><mi>i</mi></msub><mo>=</mo><mrow><mfrac><msub><mi>Y</mi><mi>i</mi></msub><mrow><munder><mo>∑</mo><mi>i</mi></munder><mo></mo><msub><mi>Y</mi><mi>i</mi></msub></mrow></mfrac><mo></mo><msub><mi>E</mi><mi>total</mi></msub></mrow></mrow></math></maths><img file="US2008281663A1_D0010.tif" />
0000Participation information for each available resource may thus be determined by prioritizing resources based on each unit's potential discharge duration, such that the longer a resource may discharge its stored energy, the greater its level of participation.
0071In addition, in one embodiment, in the step of scheduling the dispatch of individual resources <b>540</b>, resources may be grouped by individual rate of dispatch and “bin-packed” by group in accordance with the method described above. This may result in a difference between the amount of energy requested in the dispatch request and the amount actually delivered in the dispatch event; however, the difference in the dispatch duration and dispatch rate decreases as the number of participating resources increases. Specifically, the maximum %-error is:
0000<maths id="MATH-US-00011" num="00011"><math overflow="scroll"><mrow><mrow><mi>%</mi><mo></mo><mstyle><mspace width="0.8em" height="0.8ex" /></mstyle><mo></mo><mi>error</mi></mrow><mo>=</mo><mfrac><msub><mi>Y</mi><mi>max</mi></msub><mi>K</mi></mfrac></mrow></math></maths><img file="US2008281663A1_D0011.tif" />
0000where Y<sub>max </sub>is the maximum output rate of any unit and K is the total dispatch rate. For example, if 100 resources are scheduled for dispatch of a total dispatch of 330 kW and the maximum discharge rate is 6.6 kW, then the percentage error is only 2%. It will be evident that as the number of participating resources increases, the margin of error will decrease.
0072Dispatch events may be requested in advance of the time of the desired dispatch. However, the longer the interval of time, the greater the chance that the condition of at least some distributed resources may change. For example, distributed resources may have become disabled, or in the case of mobile energy storage, the distributed resources may be removed from the grid.
0073It is therefore desirable to re-evaluate the accomplishability of a utility-commanded dispatch event repeatedly between the time the dispatch request is initially made and the start of the dispatch event. Such re-evaluation provides the utility control system operator lead time to act on a notification that a previously accomplishable event is now no longer accomplishable because of a change in circumstances. Conversely, repeated evaluation of accomplishability may also show that an event that was unaccomplishable when scheduled has become accomplishable without any further interaction by the operator. For example, distributed resources may have been charged, or additional mobile energy storage may have become available for dispatch.
0074It is also desirable to perform an accomplishability check when a new dispatch event is created or canceled. When a new event is created, it may affect the accomplishability of subsequent dispatch events. For example, creating a new dispatch event before other dispatch events may cause the later dispatch events to become unaccomplishable (for example, due to a lack of available energy). On the other hand, the cancellation of a dispatch event may make later dispatch events accomplishable.
0075Instructions for dispatching energy from distributed resources may be computed based upon the state of each distributed energy resource at a specified point in time. The determination and generation of these instructions may be referred to as processing the event. The generation of instructions for individual resources may be deferred until as near to the desired start time of the event as possible, and then evaluated for accomplishability up to the time of event execution.
0076Reevaluation of accomplishability allows use of the best possible data as an input (e.g. the data closest to the start time of the event). Reevaluation also facilitates the implementation of event cancellation, out of order event scheduling (i.e. the ability to submit events in an order other than the one in which they will be executed); and maximum lead-time notification that an event has become unaccomplishable.
0077The latest possible moment that a background task can process an event and still expect that all the resources will be able to download and execute the corresponding instructions successfully is a function of how frequently the control system communicates with the distributed resources. If individual resource instructions are determined too late, then there may not be enough time for the participating resources to receive instructions prior to the dispatch event start time, and the event will fail to fully execute.
0078In an embodiment, in order to both defer event evaluation and repeatedly evaluate the accomplishability of events, a process, such as a software process (co-located with the control system in utility control center <b>105</b> in one embodiment) may perform event evaluation. Instructions for individual distributed resources are determined no later than the sum of the following durations prior to the start of the event: (a) the frequency at which the background task runs (evaluation frequency); (b) the duration it takes for the background task to complete; (c) the communication frequency of participating resources; (d) the time it takes for the instruction transmission to complete; and (e) other implementation-specific delays. Since some of these intervals may vary, implementation-specific maximum values should be chosen.
0079Deferred evaluation and re-evaluation of accomplishability allows the cancellation of events that have been submitted to the control system, but for which individual resource instructions have not yet been determined and transmitted to distributed resources. Re-evaluation of accomplishability also permits the scheduling of events that are currently unaccomplishable, but which the operator knows will become accomplishable by the desired execution time, increasing the operator's flexibility in scheduling events.
0080It is important for a control system operator to know what upcoming events are not currently deemed accomplishable and thus require remediation. In order to confirm a cancellation of an event, a confirmation dialog may be presented, for example, that identifies the event and displays the event's duration, start time, and end time. An operator may similarly be notified of a successful or an unsuccessful cancellation of an event. For example, notifications can be displayed to the system operator on display <b>115</b>, for example, in a list that is always visible. Notification may also be done, for example, on a schedule or dashboard view, which quickly conveys information to an operator about events scheduled to take place in a given time period. Notifications may also be presented through visible cues on the schedule that indicate unaccomplishable events in the time period of interest. Notification may also be performed via messaging, such as by email, fax, pager, instant messaging, or automated voice mail. In an embodiment, unaccomplishable events are distinguished from accomplishable ones by color, highlighting at-risk events to a system operator.
0081The systems and methods heretofore described may be applied to mobile distributed resources, such as PEVs. However, the mobility of such resources creates issues not posed by non-mobile resources.
0082Individual owners of PEVs may use the storage capability of the PEV as part of an electricity use management system, such as that shown in <figref idref="DRAWINGS">FIG. 1</figref>. Mobile energy storage may be charged during non-peak hours, thus reducing the total cost of electricity, and electricity can be sold back to the grid during favorable conductions. An example of a system which permits the rescheduling of deferrable electrical consumption to off-peak hours is described in U.S. patent application Ser. No. 11/144,834, entitled “Optimized Energy Management System,” filed on Jun. 6, 2005.
0083Individual owners of mobile energy storage systems may also permit utilities to control when the systems are charged or discharged. Mobile energy storage may be connected to a system such as that illustrated in <figref idref="DRAWINGS">FIG. 1</figref>. In addition, mobile energy storage may be connected to a system such as that illustrated in <figref idref="DRAWINGS">FIG. 7</figref>. Mobile energy storage may thus become another distributed energy resource on the electric grid.
0084However, the integration of mobile energy storage into the system introduces additional issues of availability of the resources and accomplishability of a utility-commanded dispatch event. By its very nature, mobile energy storage is connected and disconnected from the electrical grid. A dispatch might be accomplishable with the mobile energy resources that are connected at one point in time, but may cease to be accomplishable if enough resources are removed from the grid without offsetting arrivals. Minor modifications to the steps of method <b>500</b> address these issues.
0085To levelize and schedule the dispatch of mobile energy resources, for example, use of a statistical method in step <b>520</b>, supplemented by information regarding the historical arrival and departure of mobile energy resources from a specific location, permits the determination of the probability that a utility-commanded event utilizing mobile energy storage is accomplishable. Such a statistical method may be used to determine the availability of energy from mobile resources at a given location. In an embodiment, a statistical method may use data such as the number of mobile resources which historically enter and leave a location during a given time period, the price of electricity (which may be a price offered by a utility, as further described below), and weather conditions (such as rain or snow) or seasons (such as whether is it summer or winter) which may affect mobile resource availability. A statistical method may also account for the day of the week and the time of day, which may affect availability of mobile resources, for example, at a shopping mall or at a commuter mass transit station parking lot. A statistical method may also account for holidays and for other events which may affect the availability of mobile resources at given locations.
0086In an embodiment, a statistical method may use a historical distribution for a given time period, to determine the available resources for intervals of time within the duration of a requested dispatch (each interval being a “timestep”), then to compute the accomplishability of a requested dispatch by determining accomplishability at each timestep.
0087In another embodiment, the number of arrivals may be modeled as a Poisson distribution, and the number of departures may be modeled as a set of Bernoulli trials, to provide a prediction of the number of arrivals and departures of mobile resources at a given location. Historical arrival data, for example, for the distribution of resources, and the amount of stored energy available, may then be used to weight the distribution of the predicted arrivals and combine their distribution with the number of mobile resources actually available at a given time. The predicted distribution is then used to compute accomplishability for each timestep. In an embodiment, a Markov Chain Monte Carlo simulator is used to rapidly compute accomplishability.
0088In another embodiment, the techniques described above may be combined, so that the result of the calculations is a weighted average of the results.
0089Relatively small timesteps may be used in the determination of participation information and the scheduling of dispatch events to minimize the probability that distributed resources may become unavailable.
0090In an embodiment, a dispatch event using mobile distributed resources is created in utility control center <b>105</b>, including specifications as discussed above. Next, the accomplishability of the dispatch request is determined using a statistical method to determine the availability of mobile distributed resources. Next, if the dispatch request is accomplishable, the amount of energy to be discharged from each participating unit is determined, and then the energy dispatch of individual units is scheduled and the instructions for each distributed resource are determined. The length of the timesteps should be selected to minimize as much as possible the number of resources which may be removed from the electrical grid during a dispatch event, and yet reasonably minimize the computation time required. The precise length of the timesteps can be determined, for example, with reference to historical data about the arrival and departure of resources from a location. In an embodiment, the accomplishability of a dispatch event may be increased by the inclusion in the calculations of a “reserve” of mobile resources, to provide a buffer of redundancy in the determination of accomplishability.
0091To account for transactions in which utilities buy stored energy from or sell energy to PEV consumers, a method is required for settling an account with an owner of mobile energy storage for electricity charged or discharged at any location.
0092With reference to <figref idref="DRAWINGS">FIG. 8</figref>, when a transaction is requested <b>1010</b>, first the PEV owner is authenticated <b>1020</b>. Next, the transaction is authorized <b>1030</b>. Finally, the accounting for the transaction is performed <b>1030</b>. These steps are further described below.
0093For example, a PEV owner may drive to work and park in an office parking lot, as may be represented by the grouping of PEVs <b>910</b> shown in <figref idref="DRAWINGS">FIG. 7</figref>. The PEV owner may plug in his vehicle and identify himself to the charger. This could be accomplished, for example, by use of a charging receptacle <b>920</b>, enabled with a device permitting the owner of the mobile storage unit to use, for example an account number or other unique identifier, or swipe a credit card, for identification. Similarly, the mobile resource itself may provide identifying information to the charging receptacle. The mobile resource may communicate with the charging receptacle using a wired connection, or using a wireless protocol such as WiFi, Bluetooth, or ZigBee. In an embodiment, a unique identifier is associated with the mobile energy resource. Examples of unique identifiers include an IP address (such as using IETF RFC 2460); a vehicle identification number or VIN (such as using ISO standard 3779); a credit card number; and a personal identification code. The unique identifier may be associated with the electricity billing account of the PEV owner's home. Or, it might be associated with an account established expressly for the purposes of the mobile energy resource. The unique identifier is also associated with the record of electricity consumption or dispatch, which may include the amount of electricity consumed or dispatched, the location, the time, and the applicable rate or rates for the electricity.
0094Receptacle <b>920</b> may be any type of location configured to charge or discharge energy from a mobile energy resource, and can be, for example, at a commuter train station, or a shopping mall, or a public performance venue, or an athletic stadium, or any other similar location. Receptacle <b>920</b> may be in any location capable of accommodating mobile energy resources, and the exemplary use of a municipal or public parking location is in now way intended to be limiting.
0095In step <b>1030</b>, a transaction is authorized. For example, if the mobile resource is plugged in to recharge outside of its home service territory, the utility providing the electricity may use the unique identifier to confirm with the consumer's billing entity that a transaction should be permitted. A variety of levels of permission may be granted. For example, the home billing utility might approve a transaction, but only up to a certain amount; or, the transaction could receive blanket approval; or, authorization could be denied, for example if the consumer is delinquent in bill payment, or if the consumer's billing utility does not have an arrangement with the utility requested to sell or purchase electricity. Similarly, mobile devices reported stolen may appear on a blacklist, and can be denied authorization to charge or dispatch. Ideally authorization should occur in real or nearly real-time.
0096A transaction may also be authorized if a utility requests the dispatch of energy from the mobile resource. In that case, information about the mobile resource and the owner's account information is verified, to permit a credit to be made to the mobile resource owner's account if energy is purchased and discharged from the mobile resource.
0097In step <b>1040</b>, accounting for the transaction is performed. If the mobile resource is physically within the service territory of the utility associated with the billing account, a record of the unique identifier and electricity exchange may be readily attached to the resource owner's billing account. However, the location of charging receptacle may be in the service territory of a different electrical utility company, and settlement of a transaction in another service territory may be handled directly between utility companies. Alternatively, multiple electrical utilities may provide and receive information from a central clearing house <b>930</b>, which may receive, store, and provide unique identifier and transaction information to the relevant utilities. Information relevant to the transaction may be provided to the central clearing house over the Internet <b>350</b>. Central clearing house <b>930</b> may, for example, have a database of unique identifiers matched to billing electrical utilities. The central clearing house may sort records appropriately, and on a batch or real-time basis distribute them to the correct electrical billing company for billing to the consumer. A consumer's bill could thus contain roaming records from multiple companies combined by the home company and presented to the consumer. Utilities may charge different electricity rates for residential or commercial customers. In an embodiment, a separate rate may be applied for “roaming” charges.
0098Similarly, a credit maybe applied to the mobile resource owner's account if energy is purchased by a utility and discharged from the mobile resource. In an embodiment, a mobile resource owner parks her vehicle at a parking lot in an office building in a parking space enabled with a charging receptacle as described above. The owner swipes her credit card on the charging receptacle to identify herself. The mobile resource then establishes a wireless connection to the charging receptacle and provides information about itself. The energy stored in the mobile resource is now available for discharge. Later that day, the utility in whose service area the mobile resource is parked initiates a dispatch request to the owner's mobile resource. Using the information earlier provided, the transaction is authorized and energy is dispatched from the mobile resource. A credit is applied to the mobile resource owner's account for the amount of energy dispatched. The system may take into consideration multiple charge or discharge conditions. For example, the owner may have indicated to the system, through an interface on the mobile resource, or through user interface an interface such as on display device <b>450</b>, that she wishes to fully charge the mobile resource. Alternatively, the mobile resource owner may have granted access to the mobile resource such that the utility, in order to prepare for a discharge event, the utility may charge the mobile resource. The systems and methods described above may account for multiple charge and discharge events, and thus multiple transactions.
0099The pre-existing onboard systems of the vehicle may be leveraged to provide roam charging capabilities such that a single invoice can be presented to the customer independent of where they recharge their vehicle. An automobile's on-board telemetry system for navigation and safety monitoring, an example of which is the GM OnStar system, can be utilized in this respect. These systems have cellular telephone-based communications systems combined with on-board diagnostics that can convey the health and status of the vehicle along with “black box” data such as speed and g-force load sensor information prior to an airbag deployment. For smart charging and roam charging applications of PEVs, these on-board telemetry systems combined with an on-board user interface such as the navigation system, can be used to have the PEV interact with the grid.
0100Such systems may be configured to operate as follows. When a user turns off the car, a pop up menu within the navigation screen asks the user if they will be plugging the vehicle in for re-charging at home or at another location. If the user responds in the affirmative, then the system further asks if the user is going to “smart charge” the vehicle. If the response is again affirmative, the vehicle communicates with the network operations center for the on-board telemetry system to request the charging parameters for that particular instance. The network operations center interfaces with a private service provider's network operations center (NOC), which in turn interfaces with the integrated resource planning system of a utility company to determine the optimum charging routine for the vehicle based upon least cost algorithms across the fleet of PEVs within the service territory of the utility.
0101Once the vehicle receives the charge timing parameters, and the user has plugged the vehicle into the electrical outlet, the vehicle will not draw power from the outlet until the start time is achieved. Using the on-board clock of the vehicle, it begins charging according to the set parameters through direct control of the power electronics onboard the vehicle. If the user selects not to use the smart charging, then the onboard display within the vehicle may notify the use that they may be paying a premium rate to charge the vehicle, with appropriate acknowledgement, specific to the utility-defined program.
0102If the user has chosen to roam charge the vehicle at a location other than their billing address, then the onboard system may ask the user to verify their location as determined by the GPS system. User verification of address is then captured, transmitted to the vehicle system NOC, and on to the service provider's NOC for capture of a billing event data set. This information is then sent on to the utility's billing system to debit the account of the user while crediting the account of the customer where the vehicle is being charged. This solution can be applied within residential, commercial or municipal parking areas.
0103The onboard menu system may also allow the combination of roam charge management with smart charge parameters to delay the start of vehicle charging to match the tariff schedule of the user as defined by the utility program.
0104Within this approach, there is required modified software on the on-board vehicle system, a NOC to NOC interface between the vehicle systems operations center and the service-provider's operations center and a systems integration with the utility operational environment. In this manner, no end point hardware is required.
0105The systems and methods described above further permit numerous additional applications. For example, utility operators may command distributed mobile energy resources as they might other resources on a network, to reduce load or to add capacity to the electrical grid. One benefit of integrating mobile energy storage in such a manner is that mobile energy storage can be used to provide additional stability to the electrical grid.
0106However, owners of mobile storage must choose to make their mobile energy storage available to utility operators. Market applications of the system and method are therefore not only possible but highly desirable. Moreover, incentives may be offered not only to individual consumers but also to entities controlling more than one mobile resource, such as municipalities, car rental companies, taxi companies, or any owner of a fleet of PEVs. The systems and methods disclosed herein may thereby provide incentives related to fleet management. The examples described below may therefore be applicable to consumers and to entities, and the use of one in an example is not intended to exclude any applications or use with the other.
0107For example, with reference to <figref idref="DRAWINGS">FIG. 7</figref>, a parking lot, such as a municipal parking lot at a mass transit station, can be enabled with charging facilities <b>920</b> for mobile storage, such as PEVs <b>910</b>. Further, the charging facilities (such as a “smart charger” device) may be enabled to identify the consumer or the specific resource, as described above. By identifying themselves to the charging facility, consumers may choose to make the storage capacity of their mobile storage available for command as a distributed energy resource. A plurality of PEVs able to be commanded by a utility operator may serve as a significant source of stored electricity available for dispatch, and can be dispatched using the systems and methods described above. Indeed, a number of commandable PEVs may collectively serve a utility as a “virtual power plant,” providing a significant amount of energy available for dispatch.
0108The utility has a clear motivation to incentivize consumers to participate, because the amount of energy made available to the utility for dispatch is potentially substantial. The utility may reap financial benefit from the arrangement, for example, because it may avoid bringing additional generation capacity online to provide needed electricity. The additional capacity made available by numerous available distributed mobile resources may also aid in stabilizing the electrical grid through the availability of the stored capacity. The use of the methods of levelizing and scheduling the requested dispatches conserves the capacity of multiple distributed mobile resources, as well as minimizing “ripple” across the grid which may occur as a result of closely occurring dispatch starts or stops.
0109A variety of incentives may be offered. For example, a municipality may offer discounted mass transit tickets or other discounts to consumers who park their PEVs at municipal parking lots and take public transportation. Such discounts or coupons can be offered at particular times of day. The discounts or coupons can also be offered seasonally, or at any time when the need for the availability of additional electricity exists. For example, hot summer weather may create demand for additional electricity to meet the needs of numerous HVAC units in operation. Consumer incentives may be offered to draw PEV owners to make their mobile energy capacity available, for example, at a municipal parking lot. The utility stands to gain by purchasing the PEV stored capacity at a fraction of the cost of bringing additional generating capacity online.
0110The owners of private parking facilities may also provide incentives to consumers to make their mobile storage capacity available. For example, the owner of a parking lot at a shopping mall may offer consumers a discount at a store or stores within the shopping mall to PEV owners who park their vehicle at the shopping mall lot and make their mobile storage capacity available for dispatch. In an embodiment, a consumer receives a message on user interface <b>1100</b> offering a discount at a particular store in a shopping mall in exchange for making the storage capacity of his mobile device available for dispatch, for example, on Saturday between 10:00 AM and 2:00 PM. The consumer uses the user interface <b>1100</b> to accept the offer, which causes data indicating such acceptance to be transmitted back to the utility company or a third party service provider. The consumer then drives to and parks at the shopping mall at a charging facility at the appointed time, provides identification information to the charging facility, and makes his mobile resource available for dispatch, as described above. The shopping discount may be applied in any number of ways. For example, the consumer's identifying information may be provided electronically to the store so that if the consumer makes a purchase, the discount is immediately applied to the transaction. The consumer may be required to make his mobile resource available for a minimum amount of time in order to receive the discount.
0111The available energy may be used in any number of ways. For example, the energy made available may be used to power a store, or a building. The mobile energy resources available in an office building parking lot, for example, may be used to power the office building at peak prices times, or to at least decrease the load on the grid created by the building. Private parking facilities may require retrofitting of existing parking, or the provision of new parking, equipped with charging receptacles and the means to identify consumers, as described above. However, the incentive of a utility to enter into economic arrangements with private parking lot owners is high, and a utility may subsidize or pay entirely for the creation of new parking or the retrofitting of old parking to accommodate PEVs as described herein.
0112Utilities and other entities may therefore use consumer incentives to draw mobile energy resources to specific locations or at specific times. Specific locations and times may be determined on the basis of historical or predicted need, or on predicted availability of mobile energy resources, using the method described above. Furthermore, incentives may be offered to PEV owners to discourage driving.
0113Incentives may be built around considerations such as environmental factors. For example, if a weather report indicates that a particular day is going to be smoggy, utilities may offer incentives to PEV owners to park at municipal lots and ride public transportation. Similarly, a utility or other entity may offer an incentive to consumers not to drive at all on such a day. Such incentives may be offered, for example, on the same day at different price points. For example, on a day of heavy smog, consumers may be offered a lower incentive for parking at a municipal lot and using public transportation, and a higher incentive for staying home and not driving at all. It may be that consumers capable of telecommuting may benefit more than other consumers. This may in turn create pressure on employers to permit greater telecommuting, which may have an additional and incrementally greater environmental benefit. Similarly, the emissions of a PEV may depend on the state of health of the battery, or on its level of charge. By taking environmental variables into account, the systems and methods may be used to provide behavioral incentives which tend to control auto emissions.
0114With reference to <figref idref="DRAWINGS">FIGS. 9 and 10</figref>, in an embodiment, the utility sends a message to participating consumers in its service area. Such message may appear, for example, on user interface <b>1100</b> in <figref idref="DRAWINGS">FIG. 9</figref>, which displays messages <b>1110</b> to a user. A consumer may choose to participate by making a selection in user interface <b>1200</b>. Similarly, a consumer may choose to participate by making her mobile resource available at a parking location as described above.
0115One way to permit incentives to be included in the systems and methods described herein is to include a cost value in the step of determining participation information. Cost values may be assigned by a utility, or by the owner of a mobile resource. Cost values may also be determined algorithmically. For example, an electrical utility may determine a value for the energy discharged from, or used to charge, a mobile energy resource. As shown in <figref idref="DRAWINGS">FIG. 10</figref>, a utility may, for example, offer a lower cost value for electricity discharged from a mobile resource at a downtown office location, a higher cost value for electricity discharged from a mobile resource at a mass transit parking lot, and a yet-higher cost value for electricity discharged from a mobile resource at the owner's home (<b>1220</b>). The variable pricing thus provides an incentive for the mobile resource owner to reduce driving (by only driving from home to a public transportation lot) or to eliminate it (by not driving). Additional incentives are possible. For example, a utility may enter into an agreement with a municipality, and may offer additional incentives to ride public transportation, such as discounted mass transit tickets, or discounted parking at a mass transit station. A utility may thereby create incentives for mobile resource owners to make their mobile resources available at particular locations and at particular times.
0116A utility may also enter into arrangements with other commercial entities, or with municipalities or other governmental organizations, and provide incentives to such larger entities. For example, a utility may offer an incentive, such as discounted electricity, or favorable billing rates, to a municipality to make its vehicle fleet of mobile energy resources available at a particular location or at a particular time. The utility make provide levels of incentives, for example, in accordance with the greatest need for electricity at on a particular day, or at a particular time. The utility may thus use incentives to align the needs of a private or public entity with the needs of the utility to match energy supply to energy demand.
0117Utilities and other entities may apply other incentive schemes to motivate consumer behavior. For example, a utility may offer a sweepstakes style incentive, wherein, for example, the first five thousand consumers who “enter”—by making the mobile energy capacity available for discharge—eligible for a prize of monetary value, or of some other value. A message <b>1110</b> may be sent to consumers, who may elect to participate, for example, by making a selection in a user interface <b>1220</b>. Similarly, utilities seeking to motivate consumers to participate in a dispatch event may offer incentives in increasing steps until the desired amount of participation capacity is met. For example, a utility seeking to dispatch the amount of energy that may be stored in, for example, one thousand PEVs, may offer to pay one price for energy, which may draw four hundred participants. The utility may later offer a higher price, for which an additional three hundred participants may join. The utility may offer a yet higher price for stored energy at a later point in time, at which price the remaining three hundred participants are motivated to make available their mobile stored energy capacity. A Dutch auction method may also be employed to determine the lowest clearing price of energy desired by a utility. For example, a utility may send a message, to be displayed in user interface <b>1100</b>, stating its desire to purchase 5 MW of energy. Consumers may enter a value for their stored energy and place bids <b>1230</b> through user interface <b>1100</b>. The utility may then purchase the desired 5 MW of energy at the lowest price at which the entire 5 MW is purchasable from the consumers who have placed bids.
0118Where owners of mobile energy resources are permitted to indicate a cost value for their stored energy, utilities may respond to owner-indicated values, and an electronic marketplace for stored energy may thus be enabled by the systems and methods herein described. For example, an owner may place a value at which the owner is willing to sell energy to a utility and make it available for discharge. The owner may indicate a value through a user interface on the mobile resource, or through user interface <b>1200</b>. A utility seeking to dispatch energy from mobile resources may, for example, order the available resources in its service territory by the average price of energy per resource, then select resources for participation in a dispatch event from among the lowest price set of resources with a high probability of accomplishability. A utility may also discharge smaller amounts of energy from resources with higher priced energy and larger amounts of energy from higher priced energy. A utility may respond to owner-set prices by increasing or decreasing the price it is willing to pay to purchase stored energy from mobile resource owners, for example by increasing the price it is willing to pay in order to gain access to a larger number of resources, or decreasing the price it is wiling to pay if a surplus of lower cost mobile storage is available. Mobile resource owners may similarly vary the cost values which they assign to their stored energy.
0119Cost values may be determined for other criteria as well. For example, a value may be assigned based on the source of energy used to generate the stored electricity, such as a from a coal power plant, or from a nuclear power plant, or from a renewable energy source such as wind or solar. The distribution of types of energy stored may be presented <b>1120</b>, and mobile resource owners and utilities may, for example, select preferences for energy generated using cleaner forms of generation. For example, a utility may offer to purchase at a higher price stored energy generated from renewable sources, such as energy generated from solar panels on a resource owner's home. Similarly, a resource owner may, for example, offer to purchase from the utility energy generated from renewable sources at a higher price, creating an incentive for the utility to use renewable energy over non-renewable sources.
0120A cost value for energy may also be determined algorithmically by the system. The cost value may take many variables into account, including time-of-day pricing, the price of gasoline, and the usage of gasoline in charging the battery. A value may also be assigned or determined based on the carbon emissions associated with the energy stored. Similarly, carbon credits may also be assigned a value, or the system may be configured to account for carbon credits independent of an assigned value.
0121Utilities may thus provide incentives to reduce emissions, by providing an incentive to consumers to curtail driving. A utility may similarly use incentives offered to larger entities, such as companies, parking lot owners, and municipalities, for similar aims. In addition, a municipality may employ incentives in a similar fashion. For example, a municipality wishing to decrease smog during a particular summer week may offer an incentive to consumers to curtail driving, or to the utility to similarly incentivize consumers. For example, a municipality may make its vehicle fleet available to the utility for dispatch in exchange for the utility offering incentives to consumers to curtail driving, in order to drive down emissions.
0122The interface of <figref idref="DRAWINGS">FIGS. 9 and 10</figref> may also be used to allow a utility to borrow stored energy in PEVs when they are plugged into the grid with a promise to return the energy at a later time with no consequence to either the driving pattern or cost to the consumer. The interfaces can allow the consumer to define their parameters for participation along with appropriate economic incentives and verification procedures. For instance, the consumer might define that they always want enough energy to get home under all electric power and that they live 15 miles away from work and leave work at 6 pm. The boundary condition defined by the consumer provides a window of opportunity for the utility, and when multiplied by hundreds of thousands of available PEVs can amount to significant peak energy availability.
0123In addition to providing an interface to the incentive functions discussed above, a user interface such as that shown in <figref idref="DRAWINGS">FIGS. 9 and 10</figref> can also be used to allow the owners of mobile energy resources such as PEVs to define their driving requirements such as typical morning departure time, typical return time and their tolerance for peak vs. off peak pricing. A variation of this definition can include environmental requirements such that a consumer can specify the source of electricity used to replenish the stored energy in the PEV. Through software algorithms, the utility can match their resource planning needs to the needs of the consumer. It is possible to predict the daily load duration requirements of the PEV by measuring the actual energy consumed by the device and normalizing to day of week or other patterns of usage. This information can then be aggregated within the control system to load level a fleet of PEVs through staggered charge management routines. A more-advanced version of this scenario includes getting information directly from the energy storage device to state the need to the control system at that point in time, again with a staggered approach to the fleet of PEVs to load level the system. From a utility's perspective, the load leveling may be highly locational in nature to deal with distribution capacity and congestion issues. Therefore, the PEV must be provisioned within the control system in such a way that localized capacity can be managed properly.
0124The timing of when the PEV replenishes its energy storage may be controlled based upon a combination of time-of-use (TOU) pricing schedules and the integrated resource plan (IRP) of the electric utility. A schedule may be set for controlling the charge on or off state that matches the TOU schedule or the goals of the IRP. Separately, due to the seasonal nature of available capacity in many areas, direct price signals may also be used alone or in conjunction with TOU pricing schedules to control when a PEV is re-charged. This would allow a utility to provide unfettered re-charging during most of the year but utility-controlled during peak seasons. No human interaction or interface required.
0125While the TOU schedule is simple and effective, it may not be adequate for incentivizing consumers to participate in a smart charging program. Peak price schemas along with corresponding pricing signals broadcast to the network of participating devices may be required. Another method includes using value-based pricing in which the PEV is separately metered and has a unique tariff apart from the other devices within the home. This reduced tariff for the PEV (for example, $0.05 rather than the nominal $0.12) can provide a strong incentive to participate in a smart charging program while also optimizing the cost-benefit to the utility.
0126The gasoline tax is a major source of revenue for federal, state and local taxing authorities. Typically funds collected through the gas tax are applied (at least in part) toward maintaining roadways and other vehicle infrastructure. However, the increased adoption of PEVs will result in decreased use of gasoline, and thus a decrease in the associated tax revenues. To offset the loss of the ability to collect funds to maintain the roadway infrastructure, a method is required to tax the electricity used in powering PEVs.
0127The overall size of the tax may be determined by taking into account the funds required to maintain infrastructure, spread over the expected electricity required to power the extant PEV fleet. In the event that a carbon tax is also imposed, the pollution component of PEV use may be included in the marginal cost of energy.
0128However, simply levying a tax on electricity used to charge PEVs is unfeasible, because of the PEV's capability of discharging—and reselling—its stored energy back to the grid. Systems and methods such as those disclosed herein facilitate the tracking of the charging and discharging of mobile storage connected to the power grid. For example, information about the tax associated with the charging and discharging of electricity from a PEV's storage capacity may be stored by the PEV owner's electrical utility, or by a government entity, or at the point of sale of electricity, or at the point of sale of gasoline for the PEV, or through a network communication system such as OnStar. Such information may be transmitted, for example, between the PEV and the charging receptacle, as described above. Similarly, a gasoline point of sale may also have the capability to transmit and receive information from a PEV, for example, a WiFi, Bluetooth or Zigbee enabled device or hotspot, and may exchange such information with a PEV.
0129A range of options are available to a taxing authority for recapturing gasoline consumption tax revenue lost to PEV use. In an embodiment, the electricity delivered into PEVs is differentiated from that delivered to other devices. A system such as that described above may permit the identification of a PEV or its owner. A utility, or a data clearing house, or a credit card company, or a government entity, or another entity, may record data on how much electricity is delivered to a specified PEV. The data regarding charging may be reconciled against any discharges of energy to the grid performed by the identified consumer or PEV.
0130In an embodiment, a national transportation electricity accounting system may be provided. All electricity flowing into a uniquely identifiable PEV may be aggregated into a single account for the purposes of the transportation tax. This electricity could be further tagged with the appropriate regional tax information in the accounting system. The PEV electricity tax is a net tax, as electricity delivered back to the grid will be subtracted from the account so as to accumulate an amount equal to that which is used for transportation. The account will be separate from whatever process is used to pay the utility or utilities delivering the electricity. At the end of a given period, be it weekly, monthly, or quarterly, the net electricity used for transportation may be taxed electronically by the relevant parties.
0131In an embodiment, a differentiated tax may be imposed on gasoline purchased for a PEV owner than for a gasoline-only vehicle. The differentiated tax may be lower or higher than the tax imposed for a gasoline-only vehicle.
0132In an embodiment, a PEV owner may receive a reduction in his home electricity bill based on the tax imposed on electricity purchased for the PEV.
0133While the invention has been described in detail and with reference to specific embodiments thereof, it will be apparent to those skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope thereof. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.
Contents5
35 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19 Sheet 20 Sheet 21 Sheet 22 Sheet 23 Sheet 24 Sheet 25 Sheet 26 Sheet 27 Sheet 28 Sheet 29 Sheet 30 Sheet 31 Sheet 32 Sheet 33 Sheet 34 Sheet 35
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| WO2013053394A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US11203355B2 | Cited by | United States of America | Applicant |
| US8918336B2 | Cited by | United States of America | Applicant |
| US9881259B2 | Cited by | United States of America | Search report |
| US2011202217A1 | Cited by | United States of America | Pre-grant |
| US9731615B2 | Cited by | United States of America | Applicant |
| US8725625B2 | Cited by | United States of America | Applicant |
| US10839451B2 | Cited by | United States of America | Applicant |
| US12407219B2 | Cited by | United States of America | Applicant |
| WO2012161993A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US10554759B2 | Cited by | United States of America | Applicant |
| US8068938B2 | Cited by | United States of America | Search report |
| US11396240B2 | Cited by | United States of America | Applicant |
| US9881033B2 | Cited by | United States of America | Applicant |
| US2011288712A1 | Cited by | United States of America | Pre-grant |
| US10839433B2 | Cited by | United States of America | Applicant |
| US10185978B2 | Cited by | United States of America | Applicant |
| US2013158727A1 | Cited by | United States of America | Pre-grant |
| US2009313174A1 | Cited by | United States of America | Pre-grant |
| US2010023178A1 | Cited by | United States of America | Pre-grant |
| US2015240784A1 | Cited by | United States of America | Pre-grant |
| US2013103221A1 | Cited by | United States of America | Search report |
| US12332677B2 | Cited by | United States of America | Search report |
| US2011004358A1 | Cited by | United States of America | Pre-grant |
| US11391600B2 | Cited by | United States of America | Applicant |
| US9873345B2 | Cited by | United States of America | Applicant |
| US11820250B2 | Cited by | United States of America | Search report |
| US11912153B2 | Cited by | United States of America | Applicant |
| WO2011124298A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US8504227B2 | Cited by | United States of America | Search report |
| WO2011022390A3 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US12337716B2 | Cited by | United States of America | Applicant |
| US8583551B2 | Cited by | United States of America | Search report |
| US9925882B2 | Cited by | United States of America | Applicant |
| US10861066B2 | Cited by | United States of America | Applicant |
| US2018170204A1 | Cited by | United States of America | Search report |
| US2009313032A1 | Cited by | United States of America | Pre-grant |
| US9525285B2 | Cited by | United States of America | Applicant |
| US2011061014A1 | Cited by | United States of America | Pre-grant |
| EP2537225A4 | Cited by | European Patent Office (EPO) | Search report |
| US8508058B2 | Cited by | United States of America | Applicant |
| WO2011022390A2 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| EP2258582A3 | Cited by | European Patent Office (EPO) | Search report |
| US2010191489A1 | Cited by | United States of America | Pre-grant |
| CN103597423A | Cited by | China | Search report |
| US2009195349A1 | Cited by | United States of America | Pre-grant |
| EP4106138A1 | Cited by | European Patent Office (EPO) | Search report |
| CN113169579A | Cited by | China | Search report |
| CN113428048A | Cited by | China | Search report |
| US2009177580A1 | Cited by | United States of America | Search report |
| US8458014B2 | Cited by | United States of America | Search report |
| US10821850B2 | Cited by | United States of America | Applicant |
| US2010100342A1 | Cited by | United States of America | Pre-grant |
| US9393877B2 | Cited by | United States of America | Applicant |
| US2015367740A1 | Cited by | United States of America | Pre-grant |
| US2011196692A1 | Cited by | United States of America | Pre-grant |
| US2010161469A1 | Cited by | United States of America | Pre-grant |
| US2010082464A1 | Cited by | United States of America | Pre-grant |
| US9627891B2 | Cited by | United States of America | Search report |
| US11407320B2 | Cited by | United States of America | Applicant |
| US8447707B2 | Cited by | United States of America | Applicant |
| EP2579417A4 | Cited by | European Patent Office (EPO) | Search report |
| US11993170B2 | Cited by | United States of America | Applicant |
| US2023417568A1 | Cited by | United States of America | Search report |
| US11794601B2 | Cited by | United States of America | Applicant |
| US2008040223A1 | Cited by | United States of America | Pre-grant |
| US9762060B2 | Cited by | United States of America | Applicant |
| US10083448B2 | Cited by | United States of America | Search report |
| JP2017138997A | Cited by | Japan | Search report |
| EP2633599A4 | Cited by | European Patent Office (EPO) | Search report |
| US10282708B2 | Cited by | United States of America | Applicant |
| US12107455B2 | Cited by | United States of America | Applicant |
| US2012221473A1 | Cited by | United States of America | Pre-grant |
| US2010292857A1 | Cited by | United States of America | Pre-grant |
| US10793013B2 | Cited by | United States of America | Search report |
| US9608446B2 | Cited by | United States of America | Search report |
| US2009184689A1 | Cited by | United States of America | Pre-grant |
| US2008294387A1 | Cited by | United States of America | Pre-grant |
| US2010217485A1 | Cited by | United States of America | Pre-grant |
| US2022009370A1 | Cited by | United States of America | Search report |
| US9342850B2 | Cited by | United States of America | Applicant |
| US2011231028A1 | Cited by | United States of America | Pre-grant |
| CN114069620A | Cited by | China | Search report |
| US7917251B2 | Cited by | United States of America | Applicant |
| US2017331333A1 | Cited by | United States of America | Search report |
| US8810192B2 | Cited by | United States of America | Applicant |
| EP4250511A1 | Cited by | European Patent Office (EPO) | Search report |
| US10286875B2 | Cited by | United States of America | Applicant |
| CN107086668A | Cited by | China | Search report |
| US11427101B2 | Cited by | United States of America | Applicant |
| US2011087384A1 | Cited by | United States of America | Pre-grant |
| US12083920B2 | Cited by | United States of America | Search report |
| US2012046795A1 | Cited by | United States of America | Pre-grant |
| US9152202B2 | Cited by | United States of America | Applicant |
| US12243989B2 | Cited by | United States of America | Applicant |
| CN118306255A | Cited by | China | Search report |
| WO2011124298A2 | Cited by | World Intellectual Property Organization (WIPO) | Applicant |
| US9600010B2 | Cited by | United States of America | Applicant |
| US10124691B1 | Cited by | United States of America | Applicant |
| US10572123B2 | Cited by | United States of America | Applicant |
13 members in 6 offices; this record represents the family
Priority claims1
| Document | Office | Kind | Date |
|---|---|---|---|
| 91686107 | United States of America | P |
Members13
| Document | Office | Kind | |
|---|---|---|---|
| US2008281663A1 | United States of America | A1 | |
| AU2008251352A1 | Australia | A1 | |
| CA2687037A1 | Canada | A1 | |
| WO2008141246A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2008141246A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2008141246A3 | World Intellectual Property Organization (WIPO) | A3 | |
| WO2008141246A3 | World Intellectual Property Organization (WIPO) | A3 | |
| EP2147359A2 | European Patent Office (EPO) | A2 | |
| KR20100040275A | Republic of Korea | A | |
| KR20100040275A | Republic of Korea | A | |
| US8849687B2 | United States of America | B2 | |
| US2015160672A1 | United States of America | A1 | |
| US2019041886A1 | United States of America | A1 |
74 transactions on the USPTO file
Allowed after 2 non-final rejections, 1 final rejection and 1 RCE.
- Non-final rejections
- 2
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| 7.5 yr surcharge - late pmt w/in 6 mo, Small EntityM2555 | M2555 | |
| Payment of Maintenance Fee, 8th Yr, Small EntityM2552 | M2552 | |
| Payment of Maintenance Fee, 4th Yr, Small EntityM2551 | M2551 | |
| Mail-Petition Decision - Accept Late Payment of Maintenance Fees - GrantedMPMFG | MPMFG | |
| Petition Decision - Accept Late Payment of Maintenance Fees - GrantedPMFG | PMFG | |
| Petition to Accept Late Payment of Maintenance Fee Payment FiledPMFP | PMFP | |
| Petition for delayed maintenance fee payment, 2 years or lessM2558 | M2558 | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Email NotificationEML_NTR | EML_NTR | |
| Printer Rush- No mailingTCPB | TCPB | |
| Mailing Corrected Notice of AllowabilityMCNOA | MCNOA | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Corrected Notice of AllowabilityCNOA | CNOA | |
| Pubs Case Remand to TCPUBTC | PUBTC | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Reasons for AllowanceEX.R | EX.R | |
| Examiner's Amendment CommunicationEX.A | EX.A | |
| Interview Summary - Examiner Initiated - TelephonicEXET | EXET | |
| Interview Summary - Examiner InitiatedEXIE | EXIE | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Correspondence Address ChangeC.AD | C.AD | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response to Election / Restriction FiledELC. | ELC. | |
| Request for Extension of Time - GrantedXT/G | XT/G | |
| Mail Miscellaneous Communication to ApplicantMM327 | MM327 | |
| Miscellaneous Communication to Applicant - No Action CountM327 | M327 | |
| Mail Restriction RequirementMCTRS | MCTRS | |
| Restriction/Election RequirementCTRS | CTRS | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| IFW TSS Processing by Tech Center CompleteTSSCOMP | TSSCOMP | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Sent to Classification ContractorPGPC | PGPC | |
| Filing Receipt - UpdatedFLRCPT.U | FLRCPT.U | |
| Application Is Now CompleteCOMP | COMP | |
| Payment of additional filing fee/PreexamFLFEE | FLFEE | |
| A statement by one or more inventors satisfying the requirement under 35 USC 115, Oath of the ApplicOATHDECL | OATHDECL | |
| Applicant has submitted new drawings to correct Corrected Papers problemsCORRDRW | CORRDRW | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Notice Mailed--Application Incomplete--Filing Date AssignedINCD | INCD | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX |
16 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITYFEPP | FEPP | |
| Fee payment procedure7.5 YR SURCHARGE - LATE PMT W/IN 6 MO, SMALL ENTITY (ORIGINAL EVENT CODE: M2555); ENTITY STATUS OF PATENT OWNER: SMALL ENTITYFEPP | FEPP | |
| Maintenance fee paymentMAFP | MAFP | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Fee payment procedurePETITION RELATED TO MAINTENANCE FEES FILED (ORIGINAL EVENT CODE: PMFP); ENTITY STATUS OF PATENT OWNER: SMALL ENTITYFEPP | FEPP | |
| Fee payment procedurePETITION RELATED TO MAINTENANCE FEES GRANTED (ORIGINAL EVENT CODE: PMFG); ENTITY STATUS OF PATENT OWNER: SMALL ENTITYFEPP | FEPP | |
| Fee payment procedureSURCHARGE, PETITION TO ACCEPT PYMT AFTER EXP, UNINTENTIONAL. (ORIGINAL EVENT CODE: M2558); ENTITY STATUS OF PATENT OWNER: SMALL ENTITYFEPP | FEPP | |
| Maintenance fee paymentMAFP | MAFP | |
| Patent reinstated due to the acceptance of a late maintenance feePRDP | PRDP | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.)FEPP | FEPP | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- 20080281663
- Application
- 12118644
Titles
- English
- METHOD AND SYSTEM FOR SCHEDULING THE DISCHARGE OF DISTRIBUTED POWER STORAGE DEVICES AND FOR LEVELIZING DISPATCH PARTICIPATION
Patent term adjustment
- A delay
- +762 daysthe office missed an examination deadline
- B delay
- +660 dayspendency past three years
- Overlap
- −22 daysdelays counted once
- Applicant delay
- −244 days
- Net adjustment
- 1,156 days
Classification
- CPC, 31
- G05F1/66
- H01M10/44
- B60L2200/26
- G06Q10/06315
- H02J3/008
- Y04S10/126
- Y04S50/10
- B60L2240/72
- Y04S30/14
- Y02T10/7072
- B60L53/64
- B60L55/00
- B60L53/63
- B60L53/65
- B60L53/665
- H02J3/381
- B60L53/305
- Y02E10/56
- Y02E60/00
- Y02T10/72
- Y02T90/12
- Y02T90/167
- Y02T90/16
- Y02T10/70
- H02J3/466
- Y02E60/10
- H02J2101/24
- G05D3/12
- Y02T90/14
- G05B15/02
- G06N5/048
- IPC, 1
- G06F9 48