PATENT CLAIM ANALYSIS

Application Number: 15882128
Application Type: Utility
Filing Date: 2018-01
Publication Date: 2019-02
Patent Classification: ["705", "007120"]

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 ilevelized, 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.

Claim (Index 17):
A method for dispatching energy from a plurality of distributed mobile storage resources in a discharge event so that the energy stored in each of the plurality of distributed mobile storage resources is levelized, comprising:\n causing a computer to receive a dispatch request comprising an amount of power required during a dispatch event and a duration of the dispatch event; receiving the historical arrival times, departure times, and stored energy available, of each of the plurality of distributed mobile storage resources at a location; predicting the number of arrivals, departures, and the amount of stored energy available for the plurality of distributed mobile storage resources during the dispatch event, the prediction being based, in part, on the historical arrival times, departure times, and the stored energy available for each distributed mobile storage resource; weighting a distribution of the predicted arrival times of mobile resources with the predicted amount of stored energy available for the plurality of distributed mobile storage resources and combining the weighted distribution with the number of mobile resources actually available; computing the accomplishability of the dispatch request by aggregating the combined weighted distribution at multiple time steps during the predicted dispatch and determining if the aggregate rate of discharge capability of each of the plurality of mobile resources is sufficient to meet the amount of power required to satisfy the dispatch request at each time step in the dispatch event, and if so, identifying the dispatch event as accomplishable; causing, if the dispatch event is determined to be accomplishable the computer to determine the amount of energy to be discharged from each of the plurality of distributed mobile resources during the dispatch event so as to maximally reduce the variance among the stored energy levels of the plurality of distributed energy resources; p 1  scheduling the dispatch of each distributed mobile storage resource of the plurality of distributed mobile storage resources to participate in the dispatch event using a bin packing algorithm to select the start and stop times of the discharge of each of the plurality of distributed mobile storage resources; tilting the dispatch schedule by adding a fractional time offset to intervals in each bin used in the bin packing algorithm; sending the discharge instructions to the plurality of distributed resources according to the dispatch schedule; adding a ramp up time and a ramp down time to each distributed mobile storage resource participating in the dispatch event, ensuring that all ramp up and ramp down transitions of the plurality of distributed mobile storage resources occur in pairs; and, repeating the accomplishability step each time a new dispatch request is created or cancelled, and if a dispatch request that was previously determined not to be accomplishable is now determined to be accomplishable, providing an operator making the request a notification that the dispatch request is now accomplishable, and if a dispatch request that was previously determined to be accomplishable is now unaccomplishable, providing a utility operator making the request a notification that the dispatch request is no longer accomplishable.

Metadata:
- Claim Count in Document: 38.0
- Percentile: 86.0
- Lexical Diversity: 1.68519
- Patent Class: 705.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['12118644', '15065471', '13451851', '15425687', '14791420']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.0920760713967561
- 35 USC 102 Novelty (BERT): 0.590052839781159
- Combined Prediction Score: 0.1418737482351965
- Mean Citation Score: 236.220696
- Max Citation Score: 506.61853
- Similarity Product: 433.7478719354737

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test