# US 2026/0100580 A1 · Energy System Scheduling Using Consumption and Production Prediction

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0100580 A1
- Document ID: US20260100580A1
- Status: Published application
- Kind: A1
- Application number: 18/907,253
- Filed: 2024-10-04
- Published: 2026-04-09
- Earliest claimed: 2024-10-04
- Inventors: Homayoun Yousefi'zadeh; Hamid Jafarkhani
- Web page: https://patentgrep.com/patent/US20260100580A1

## CPC

- H02J 3/003: {Load forecast, e.g. methods or systems for forecasting future load demand}
- G05B 13/027: {using neural networks only}
- H02J 3/381: {Dispersed generators}
- H02J 2103/30: Simulating, planning, modelling, reliability check or computer assisted design [CAD] of electric power networks
- H02J: ELECTRIC POWER NETWORKS; CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- G05B: CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS (systems for controlling or regulating non-electric variables G05D; systems for regulating electric or magnetic variables G05F; control devices or systems insofar as characterised by mechanical features only G05G)

## Abstract

Lowest cost usage scheduling of an energy system during a time interval of interest is achieved by utilizing two components of learning and optimization. First, several learning methods are used to forecast energy production and if needed energy consumption of a given group of energy components as a function of historical production data, weather, and solar irradiance data collected from weather and geo reports. A classification approach is used to select the learning model. A classification approach is used to select the learning model and approach. Then, an optimization problem is formulated and solved to create the optimal schedule of energy usage during time intervals of interests for the given group of energy components subject to scheduling and equipment constraints. Accordingly, integrated iterative methods, programs, and systems are described aiming at minimizing the cost of energy consumption for the given group of energy components within time intervals of interest.

## Claims

### Claim 1

A method of minimizing the total cost of energy consumption of a group of devices connected to a power grid over a daily, weekly, or monthly time interval wherein said group of devices comprises one or more remotely controlled smart plugs, one or more energy consuming components plugged to smart plugs, and zero or more components capable of producing and storing renewable forms of energy and wherein the method comprises:
a. importing per unit cost of energy charged according to a demand charge model in the form of time of use, maximum-noncoincidental, tiered, or flat by a utility operator operating said power grid;
b. importing per component energy consumption information at least comprising usage power of energy consuming components, usage pattern, and dynamic factors within said time interval affecting the rate of energy consumption;
c. generating, by a forecast-based classification structure, a consumption classification index;
d. choosing a consumption prediction algorithm based on the generated consumption classification index of step c;
e. predicting, by the chosen consumption prediction algorithm of step d, the consumed energy;
f. predicting, by the chosen consumption prediction model of step e, energy consumed during said time interval by the plurality of energy consuming components of the group;
g. if present, importing per component energy production information at least comprising per component energy storage capacity, and dynamic factors within said time interval affecting the rate of energy production and storage;
h. generating, by a forecast-based classification structure, a production classification index;
i. choosing a production prediction algorithm based on the generated production classification index of step h;
j. predicting, by the chosen production prediction algorithm of step i, the available generated energy;
k. predicting, by the chosen production prediction model, energy stored during said time interval by the plurality of energy storing components of the group;
l. choosing an optimization algorithm;
m. waiting for the expiration of a refresh timer at the beginning of said time interval;
n. Updating the consumed energy of the energy components of step b by importing additionally collected periodical measurements since the previous expiration of the refresh timer of step m;
o. Updating the produced energy of the energy components of step g by importing additionally collected periodical measurements since the previous expiration of the refresh timer of step m;
p. applying the algorithm chosen in step d to update predicted energy consumption during said time interval by the plurality of energy consuming components of the group;
q. applying the algorithm chosen in step i to update predicted energy production during said time interval by the plurality of energy producing components of the group;
r. adjusting maximum energy made available for consumption to said group produced by energy producing components and stored by energy storing components of the group within said time interval based on the variations of the imported information of step n, step o, step p, and step q;
s. setting optimization inputs comprising imported information of step n, imported information of step o, predicted energy consumption of step p, and predicted energy production of step q;
t. applying the optimization algorithm chosen in step/to minimize the cost of energy usage as the result of scheduling the use of energy over consecutive time slots by the plurality of group components to effectively redistribute the use of energy leading to lowest cost energy strategy subject to demand charge model of step a within said time interval;
u. collecting the schedule of energy usage generated by the optimization algorithm in step t;
v. utilizing local or remote network to directly signal network-controlled smart plugs at the beginning of every time slot within said time interval to turn on or turn off according to energy usage schedule of step u;
w. utilizing remote API calls to signal API-controlled plugs at the beginning of every time slot within said time interval to turn on or turn off according to energy usage schedule of step u; and
x. going back to step m to wait again for the expiration of said refresh timer.

### Claim 2 (depends on 1)

The method of claim 1, wherein the length of scheduling time slots can vary to include hourly, half-hourly, quarter-hourly, and shorter intervals at every granularity of minutes.

### Claim 3 (depends on 1)

The method of claim 1, wherein energy producing components capable of capturing solar, wind, hydropower, geothermal, and biomass renewable energy forms comprise solar panels, wind turbines, hydraulic turbines, steam turbines, generators along with supporting equipment and energy storing components comprise batteries.

### Claim 4 (depends on 1)

The method of claim 1, wherein the dynamic factors of step b and step g comprise solar irradiance and hourly weather forecast information during said time interval including sun, cloud, temperature, wind, humidity, precipitation, UV index, and water pressure among other factors.

### Claim 5 (depends on 1)

The method of claim 1, wherein the forecast-based classification structures of step c and step h comprise support vector machines or K-mean classifiers.

### Claim 6 (depends on 1)

The method of claim 1, wherein the choices of prediction algorithms of step d and step i comprise Multi-Layer Perceptron Deep Learning (MLPDL), K Nearest Neighbor (KNN) machine learning, Auto Regressive Integrated Moving Average (ARIMA) machine learning, Random Forest (RF) machine learning, and Linear Least Square Regression (LLSR) machine learning techniques.

### Claim 7 (depends on 1)

The method of claim 1, wherein the choice of optimization algorithm of step l comprises the Simplex Branch and Bound (SBB) and Interior Point Branch and Bound (IPBB) algorithms.

### Claim 8

A computer program product stored in a non-transitory computer readable storage medium to minimize the total cost of energy consumption of a group of devices connected to a power grid over a daily, weekly, or monthly time interval wherein said group of devices comprises one or more remotely controlled smart plugs, one or more energy consuming components plugged to smart plugs, and zero or more components capable of producing and storing renewable forms of energy and wherein the computer program product comprises:
a. importing per unit cost of energy charged according to a demand charge model in the form of time of use, maximum-noncoincidental, tiered, or flat by a utility operator operating said power grid;
b. importing per component energy consumption information at least comprising usage power of energy consuming components, usage pattern, and dynamic factors within said time interval affecting the rate of energy consumption;
c. generating, by a forecast-based classification structure, a consumption classification index;
d. choosing a consumption prediction algorithm based on the generated consumption classification index of step c;
e. predicting, by the chosen consumption prediction algorithm of step d, the consumed energy;
f. predicting, by the chosen consumption prediction model of step e, energy consumed during said time interval by the plurality of energy consuming components of the group;
g. if present, importing per component energy production information at least comprising per component energy storage capacity, and dynamic factors within said time interval affecting the rate of energy production and storage;
h. generating, by a forecast-based classification structure, a production classification index;
i. choosing a production prediction algorithm based on the generated production classification index of step h;
j. predicting, by the chosen production prediction algorithm of step i, the available generated energy;
k. predicting, by the chosen production prediction model, energy stored during said time interval by the plurality of energy storing components of the group;
l. choosing an optimization algorithm;
m. waiting for the expiration of a refresh timer at the beginning of said time interval;
n. Updating the consumed energy of the energy components of step b by importing additionally collected periodical measurements since the previous expiration of the refresh timer of step m;
o. Updating the produced energy of the energy components of step g by importing additionally collected periodical measurements since the previous expiration of the refresh timer of step m;
p. applying the algorithm chosen in step d to update predicted energy consumption during said time interval by the plurality of energy consuming components of the group;
q. applying the algorithm chosen in step i to update predicted energy production during said time interval by the plurality of energy producing components of the group;
r. adjusting maximum energy made available for consumption to said group produced by energy producing components and stored by energy storing components of the group within said time interval based on the variations of the imported information of step n, step o, step p, and step q;
s. setting optimization inputs comprising imported information of step n, imported information of step o, predicted energy consumption of step p, and predicted energy production of step q;
t. applying the optimization algorithm chosen in step/to minimize the cost of energy usage as the result of scheduling the use of energy over consecutive time slots by the plurality of group components to effectively redistribute the use of energy leading to lowest cost energy strategy subject to demand charge model of step a within said time interval;
u. collecting the schedule of energy usage generated by the optimization algorithm in step t;
v. utilizing local or remote network to directly signal network-controlled smart plugs at the beginning of every time slot within said time interval to turn on or turn off according to energy usage schedule of step u;
w. utilizing remote API calls to signal API-controlled plugs at the beginning of every time slot within said time interval to turn on or turn off according to energy usage schedule of step u; and
x. going back to step m to wait again for the expiration of said refresh timer.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein the length of scheduling time slots can vary to include hourly, half-hourly, quarter-hourly, and shorter intervals at every granularity of minutes.

### Claim 10 (depends on 8)

The computer program product of claim 8, wherein energy producing components capable of capturing solar, wind, hydropower, geothermal, and biomass renewable energy forms comprise solar panels, wind turbines, hydraulic turbines, steam turbines, generators along with supporting equipment and energy storing components comprise batteries.

### Claim 11 (depends on 8)

The computer program product of claim 8, wherein the dynamic factors of step c comprise hourly solar irradiance and weather forecast information during said time interval including sun, cloud, temperature, wind, humidity, precipitation, UV index, and water pressure among other factors.

### Claim 12 (depends on 8)

The computer program product of claim 8, wherein the forecast-based classification structure of step c and step h comprise support vector machines or K-mean classifiers.

### Claim 13 (depends on 8)

The computer program product of claim 8, wherein the choices of prediction algorithms of step d and step i comprise Multi-Layer Perceptron Deep Learning (MLPDL), K Nearest Neighbor (KNN) machine learning, Auto Regressive Integrated Moving Average (ARIMA) machine learning, Random Forest (RF) machine learning, and Linear Least Square Regression (LLSR) machine learning techniques.

### Claim 14 (depends on 8)

The computer program product of claim 8, wherein the choice of optimization algorithm of step h comprises the Simplex Branch and Bound (SBB) and Interior Point Branch and Bound (IPBB) algorithms.

### Claim 15

A system comprising processors and memory coupled to processors, the memory storing instructions readable by a computing device that, when executed by processors, cause processors to perform operations to minimize the total cost of energy consumption of a group of devices connected to a power grid over a daily, weekly, or monthly time interval wherein said group of devices comprises one or more remotely controlled smart plugs, one or more energy consuming components plugged to smart plugs, and zero or more components capable of producing and storing renewable forms of energy and wherein the system comprises:
a. importing per unit cost of energy charged according to a demand charge model in the form of time of use, maximum-noncoincidental, tiered, or flat by a utility operator operating said power grid;
b. importing per component energy consumption information at least comprising usage power of energy consuming components, usage pattern, and dynamic factors within said time interval affecting the rate of energy consumption;
c. generating, by a forecast-based classification structure, a consumption classification index;
d. choosing a consumption prediction algorithm based on the generated consumption classification index of step c;
e. predicting, by the chosen consumption prediction algorithm of step d, the consumed energy;
f. predicting, by the chosen consumption prediction model of step e, energy consumed during said time interval by the plurality of energy consuming components of the group;
g. if present, importing per component energy production information at least comprising per component energy storage capacity, and dynamic factors within said time interval affecting the rate of energy production and storage;
h. generating, by a forecast-based classification structure, a production classification index;
i. choosing a production prediction algorithm based on the generated production classification index of step h;
j. predicting, by the chosen production prediction algorithm of step i, the available generated energy;
k. predicting, by the chosen production prediction model, energy stored during said time interval by the plurality of energy storing components of the group;
l. choosing an optimization algorithm;
m. waiting for the expiration of a refresh timer at the beginning of said time interval;
n. Updating the consumed energy of the energy components of step b by importing additionally collected periodical measurements since the previous expiration of the refresh timer of step m;
o. Updating the produced energy of the energy components of step g by importing additionally collected periodical measurements since the previous expiration of the refresh timer of step m;
p. applying the algorithm chosen in step d to update predicted energy consumption during said time interval by the plurality of energy consuming components of the group;
q. applying the algorithm chosen in step i to update predicted energy production during said time interval by the plurality of energy producing components of the group;
r. adjusting maximum energy made available for consumption to said group produced by energy producing components and stored by energy storing components of the group within said time interval based on the variations of the imported information of step n, step o, step p, and step q;
s. setting optimization inputs comprising imported information of step n, imported information of step o, predicted energy consumption of step p, and predicted energy production of step q;
t. applying the optimization algorithm chosen in step/to minimize the cost of energy usage as the result of scheduling the use of energy over consecutive time slots by the plurality of group components to effectively redistribute the use of energy leading to lowest cost energy strategy subject to demand charge model of step a within said time interval;
u. collecting the schedule of energy usage generated by the optimization algorithm in step t;
v. utilizing local or remote network to directly signal network-controlled smart plugs at the beginning of every time slot within said time interval to turn on or turn off according to energy usage schedule of step u;
w. utilizing remote API calls to signal API-controlled plugs at the beginning of every time slot within said time interval to turn on or turn off according to energy usage schedule of step u; and
x. going back to step m to wait again for the expiration of said refresh timer.

### Claim 16 (depends on 15)

The system of claim 15, wherein the length of scheduling time slots can vary to include hourly, half-hourly, quarter-hourly, and shorter intervals at every granularity of minutes.

### Claim 17 (depends on 15)

The system of claim 15, wherein energy producing components capable of capturing solar, wind, hydropower, geothermal, and biomass renewable energy forms comprise solar panels, wind turbines, hydraulic turbines, steam turbines, generators along with supporting equipment and energy storing components comprise batteries.

### Claim 18 (depends on 15)

The system of claim 15, wherein the dynamic factors of step c comprise solar irradiance and hourly weather forecast information during said time interval including sun, cloud, temperature, wind, humidity, precipitation, UV index, and water pressure among other factors.

### Claim 19 (depends on 15)

The system of claim 15, wherein the forecast-based classification structure of step c and step h comprise support vector machines or K-mean classifiers.

### Claim 20 (depends on 15)

The system of claim 15, wherein the choices of prediction algorithms of step d and step i comprise Multi-Layer Perceptron Deep Learning (MLPDL), K Nearest Neighbor (KNN) machine learning, Auto Regressive Integrated Moving Average (ARIMA) machine learning, Random Forest (RF) machine learning, and Linear Least Square Regression (LLSR) machine learning techniques.

### Claim 21 (depends on 15)

The system of claim 15, wherein the choice of optimization algorithm of step h comprises the Simplex Branch and Bound (SBB) and Interior Point Branch and Bound (IPBB) algorithms.
