IP Library Granted Patent US 9,946,235
Granted Patent B2
US 9,946,235 · App. 13/960,619 · Granted Apr 17, 2018

Scheduling operation of groups of residential devices

Inventors: Ondrej Holub (Prague, CZ); Marek Sikora (Trinec, CZ)
Assignee: Honeywell International Inc.
G05B15/02G06Q10/04G06Q10/0631G05B2219/2614G05B2219/2642G06Q50/06
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,946,235
App. No.
13/960,619
Granted
Apr 17, 2018
Kind
B2
Abstract

Methods and devices for scheduling operation of residential energy consumption devices are described herein. One device includes a memory and a processor. The processor can be configured to execute executable instructions stored in the memory to form a number of chains of residential energy consumption devices, wherein each of the number of chains includes different devices, determine which of the number of chains has a largest total energy consumption over a particular period of time, and determine, for the devices in the chain having the largest total energy consumption over the particular period of timed of time, an operational schedule having a lowest possible cost.

Claims (54)

1. A computing device for scheduling operation of residential energy consumption devices, comprising:

a memory; and

a processor configured to execute executable instructions stored in the memory to:

form a number of chains of residential energy consumption devices, wherein each of the number of chains includes a plurality of different devices, and wherein:

at least one of the number of chains includes a plurality of devices whose operations are dependent on each other, wherein the plurality of devices whose operations are dependent on each other include a device in one of the number of chains having a start time for operation that is defined with respect to an end time for operation of another device in that chain; and

one of the number of chains includes a plurality of devices whose operations are independent of each other and have a largest energy consumption of the plurality of different devices not included in any of the chains that include the devices whose operations are dependent on each other;

sort the number of chains in descending order corresponding to their total energy consumption over a particular period of time to determine which of the number of chains has a largest total energy consumption over a particular period of time;

determine, for the devices in the chain having the largest total energy consumption over the particular period of time, an operational schedule having a lowest possible cost; and

operate the devices in the chain having the largest total energy consumption over the particular period of time according to the determined operational schedule.

2. The computing device of claim 1 , wherein the processor is configured to execute the instructions to:

determine which of the number of chains has a next largest total energy consumption over the particular period of time; and

determine, for the devices in the chain having the next largest total energy consumption over the particular period of time, an operational schedule having a lowest possible cost.

3. The computing device of claim 1 , wherein the processor is configured to execute the instructions to determine, for the devices in the chain having the largest total energy consumption over the particular period of time, an operational schedule having a highest possible profit based on an energy tariff or weather forecast for a location of the devices in the chain having the largest total energy consumption over the particular period of time.

4. The computing device of claim 1 , wherein the processor is configured to execute the instructions to:

receive, from a user, a time frame for operation of the residential energy consumption devices; and

determine, for the devices in the chain having the largest total energy consumption over the particular period of time, the operational schedule having the lowest possible cost within the time frame for the operation of the devices in the chain.

5. The computing device of claim 1 , wherein the processor is configured to execute the instructions to:

determine, from an energy consumption profile associated with the residential energy consumption devices, a time frame for operation of the devices; and

determine, for the devices in the chain having the largest total energy consumption over the particular period of time, the operational schedule having the lowest possible cost within the time frame for the operation of the devices in the chain.

6. The computing device of claim 1 , wherein the processor is configured to execute the instructions to:

receive an energy tariff; and

determine, for the devices in the chain having the largest total energy consumption over the particular period of time, the operational schedule having the lowest possible cost based on the energy tariff.

7. The computing device of claim 1 , wherein the processor is configured to execute the instructions to:

receive a weather forecast; and

determine, for the devices in the chain having the largest total energy consumption over the particular period of time, the operational schedule having the lowest possible cost based on the weather forecast.

8. A computer implemented method for scheduling operation of residential energy consumption devices, comprising:

forming a number of chains of residential energy consumption devices, wherein each of the number of chains includes a plurality of different devices, and wherein:

at least one of the number of chains includes a plurality of devices whose operations are dependent on each other, wherein the plurality of devices whose operations are dependent on each other include a device in one of the number of chains having a start time for operation that is defined with respect to an end time for operation of another device in that chain; and

one of the number of chains includes a plurality of devices whose operations are independent of each other and have a largest energy consumption of the plurality of different devices not included in any of the chains that include the devices whose operations are dependent on each other;

determining which of the number of chains has a largest total energy consumption over a particular period of time by sorting the number of chains in descending order corresponding to their total energy consumption over the particular period of time;

determining, for the devices in the chain having the largest total energy consumption over the particular period of time, an operational schedule having a lowest possible cost;

operating the devices in the chain having the largest total energy consumption over the particular period of time according to the determined operational schedule;

determining which of the number of chains has a next largest total energy consumption over the particular period of time;

determining, for the devices in the chain having the next largest total energy consumption over the particular period of time, an operational schedule having a lowest possible cost; and

operating the devices in the chain having the next largest total energy consumption over the particular period of time according to the determined operational schedule.

9. The method of claim 8 , wherein the residential energy consumption devices include devices of a single residence.

10. The method of claim 8 , wherein the residential energy consumption devices include devices of a plurality of residences.

11. A non-transitory computer readable medium having computer readable instructions stored thereon that are executable by a processor to:

form a number of chains of residential energy consumption devices, wherein each of the number of chains includes a plurality of different devices, and wherein:

at least one of the number of chains includes a plurality of devices whose operations are dependent on each other, wherein the plurality of devices whose operations are dependent on each other include a device in one of the number of chains having a start time for operation that is defined with respect to an end time for operation of another device in that chain; and

one of the number of chains includes a plurality of devices whose operations are independent of each other and have a largest energy consumption of the plurality of different devices not included in any of the chains that include the devices whose operations are dependent on each other;

sort the number of chains in descending order corresponding to their total energy consumption over a particular period of time;

separately determine, for each of the number of chains and in the descending order, an operational schedule for the devices in that respective chain having a lowest possible cost; and

operate the devices in each respective chain according to the determined operational schedule for that respective chain.

12. The computer readable medium of claim 11 , wherein the instructions are executable to determine an amount of available energy generated by the residential energy generation devices.

13. The computer readable medium of claim 12 , wherein the instructions are executable to update the amount of available energy based on the determined operational schedules.

14. The computer readable medium of claim 11 , wherein the instructions are executable to:

re-sort the number of chains in descending order corresponding to their peak energy consumption; and

separately determine, for each of the re-sorted number of chains and in the descending order corresponding to their peak energy consumption, an operational schedule for the devices in that respective chain having a lowest possible cost.

15. The computer readable medium of claim 11 , wherein the instructions are executable to:

re-sort the number of chains in descending order corresponding to their peak energy consumption over a particular period of time; and

separately determine, for each of the re-sorted number of chains and in the descending order corresponding to their peak energy consumption over the particular period of time, an operational schedule for the devices in that respective chain having a lowest possible cost.

16. The computer readable medium of claim 11 , wherein the instructions are executable to automatically implement the determined operational schedules.

17. The computer readable medium of claim 11 , wherein the instructions are executable to provide the determined operational schedules to a user.

Assignments (4)
CHANGE OF NAME Recorded Jun 12, 2025
From: ADEMCO INC.
To: RESIDEO LLC
Reel/Frame 071546/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 8, 2021
From: HONEYWELL INTERNATIONAL INC.
To: ADEMCO INC.
Reel/Frame 056522/0420 →
SECURITY INTEREST Recorded Oct 26, 2018
From: ADEMCO INC.
To: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 047337/0577 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 6, 2013
From: HOLUB, ONDREJ; SIKORA, MAREK
To: HONEYWELL INTERNATIONAL INC.
Reel/Frame 031149/0239 →
Continuity (1)
Related Publication 20150045975A1 · Feb 12, 2015