Embodiments pertain to a system and method for adding and shedding loads, and more particularly to a system and method for adding and shedding loads using load levels to determine timing.
The process of prioritizing loads that are connected to a power supply that has limited capacity is typically referred as load shedding. As an example, power may be supplied by a standby generator where load shedding is required because the standby generator has a capacity that is less than the requirements of the entire attached load.
Water heaters and air conditioners are among the commonly utilized devices that are powered loads by a power source (e.g., a generator). These loads may need to be shed when a residence is being supplied by a limited capacity generator. Existing load shedding systems typically prioritize each load and then determine if the limited capacity power source is able to supply the loads before adding each load. If the limited capacity power source becomes overloaded, then the load control system will remove one or more loads to allow the power source to continue supplying power to the more important connected loads.
Utilizing a load shedding system may allow a smaller standby generator to be installed thereby decreasing the generator costs that are associated with powering a facility. In addition, load shedding may decrease costs by limiting the peak demand for power during certain times of the day because such systems often allow a power generation utility to keep a less efficient generation plant offline and then pass the savings on to the customer (i.e., the generator user).
One of the drawbacks with existing load shedding systems is that although custom-designed and configured load shedding schemes work well under some conditions; many load shedding systems do not work well when operating a variety of loads under a variety of conditions.
One of the biggest challenges for a load shedding system is a high-priority switching load. In one example scenario, a high-priority switching load may be deactivated which allows less important loads to be added. Therefore, once the high-priority switching load is eventually turned on, the power source becomes overloaded. The load shedding system must then shed several loads before the load that is actually causing the overload is removed. The additional time that is required to shed multiple loads increases the likelihood of the power source becoming overloaded for an undesirable period of time. Although many existing load shedding systems are customized in an attempt to minimize unintended power source dropouts, such systems are still often unable to adequately handle high-priority switching loads.
Another drawback with conventional load shedding systems is that in some scenarios, all of the loads may not be drawing power from the generator during an overload condition. As an example, six loads may be activated by the system even though only two of the loads are actually drawing power. As a result, when an overload occurs after all these loads have been added, the system may have to take unnecessary time to shed as many as five loads before actual load on the power source decreases at all. This increase in time to shed the appropriate load could result in the power source going offline.
Load shedding systems must also typically be carefully configured in order to work in each application because standard load shedding logic does not accurately match the load profile of a typical power source or a typical motor load. As a result, these existing systems are typically unable to start large motors that would otherwise typically lie within the starting capabilities of the generator. Configuring a typical load shedding system to permit starting a large motor will typically result in inadequate protection for the generator.
The following description and the drawings sufficiently illustrate specific embodiments to enable those skilled in the art to practice them. Other embodiments may incorporate structural, logical, electrical, process, and other changes. Portions and features of some embodiments may be included in, or substituted for, those of other embodiments. Embodiments set forth in the claims encompass all available equivalents of those claims.
A method of adding and shedding loads L1, L2, L3, L4 that are connected to a generator 12 will now be described with reference to
The method further includes determining whether to change a number of the loads in the plurality of loads L1, L2, L3, L4 based on the amount of load L that is being supplied by the generator 12. As shown in
In some embodiments, determining whether a plurality of loads L1, L2, L3, L4 are being supplied with power by the generator 12 may include monitoring the position of an automatic transfer switch 13. It should be noted that the plurality of loads L1, L2, L3, L4 are being supplied with power by generator 12 when the automatic transfer switch 13 is in an emergency position.
In alternative embodiments, determining whether a plurality of loads L1, L2, L3, L4 are being supplied with power by the generator 12 may include measuring a position of a throttle 17 that is part of the generator 12 (see e.g.,
In still other embodiments, determining whether a plurality of loads L1, L2, L3, L4 are being supplied with power by the generator 12 may include monitoring the generator load L. As examples, monitoring the generator load L may be done by (i) measuring the generator 12 operating frequency; (ii) measuring the generator 12 operating voltage; and/or (iii) measuring the generator 12 current.
In addition, determining the total load L that the generator 12 is supplying to the plurality of loads L1, L2, L3, L4 may include (i) measuring the generator operating frequency; (ii) measuring the generator operating voltage; and/or (iii) measuring the generator current.
In some embodiments, determining the total load L that the generator 12 is supplying to the plurality of loads L1, L2, L3, L4 includes determining the output torque of a prime mover (i.e., an engine) of the generator 12. The output torque may be calculated by (i) measuring fuel injection time duration 18 within the generator 12; (ii) measuring the intake manifold 16 pressure within the generator 12; and/or (iii) measuring a position of a throttle 17 within the generator 12. It should be noted the output torque may be calculated for spark-ignited and compression-ignited engines as well as other types of prime movers.
Increasing the Number of Loads
In some embodiments, determining an amount of time T in which to change the number of loads in the plurality of loads L1, L2, L3, L4 may be based on the amount of load L that is being supplied by the generator 12 includes increasing the number of loads based on an available load capacity of the generator 12.
As used herein, the available load capacity of the generator 12 is the difference between the maximum loading threshold of the generator 12 and a load the generator 12 is supplying at a particular point in time. As examples, the maximum loading threshold of the generator may be adjustable by a user via a user interface 20 (see
Therefore, the method allows generator loads to be added more quickly when there is substantial available generator capacity and more slowly when there is limited available generator capacity. This time adjustment provides (i) improved protection to the generator as the generator approaches maximum capacity; and (ii) power load as quickly as possible when there is minimal generator loading (as compared to conventional methods).
Decreasing the Number of Loads
In some embodiments, determining an amount of time T in which to change the number of loads in the plurality of loads L1, L2, L3, L4 may be based on the amount of load L that is being supplied by the generator 12 includes decreasing the number of loads based on an overload of the generator 12.
As used herein, the overload of the generator 12 is a difference between a generator load at a particular point in time and a maximum loading threshold of the generator. As examples, the maximum loading threshold of the generator may be adjustable by a user interface 20 (see
Therefore, the method allows generator loads to be shed more quickly when there is substantial generator overload and more slowly when generator 12 is not as heavily overloaded. This time adjustment (i) provides improved protection to the generator 12 when there is substantial generator overload by shedding loads more quickly (see e.g.,
As shown in
As shown in
Comparing
It should be noted that while
The method further includes determining whether to change a number of the loads in the plurality of loads L1, L2, L3, L4 based on the amount of load that is being supplied by the generator 12 and changing the number of loads in the plurality of loads L1, L2, L3, L4. The method further includes determining an amount of time in which to further change the number of loads where the amount of time is determined by whether the number of loads increases or decreases during the previous change of the number of loads.
In some embodiments, determining an amount of time in which to further change the number of loads in the plurality of loads L1, L2, L3, L4 includes increasing the amount of time to decrease the number of loads when the previous change of the number of loads increased the number of loads.
Other embodiments are contemplated where determining an amount of time in which to further change the number of loads in the plurality of loads includes decreasing the amount of time to decrease the number of loads when the previous change of the number of loads decreased the number of loads.
It should be noted that embodiments are also contemplated where determining an amount of time in which to further change the number of loads in the plurality of loads L1, L2, L3, L4 includes decreasing the amount of time to decrease the number of loads when the previous change of the number of loads decreased the number of loads.
In still other embodiments, determining an amount of time in which to further change the number of loads in the plurality of loads L1, L2, L3, L4 includes increasing the amount of time to increase the number of loads when the previous change of the number of loads decreased the number of loads.
The methods described herein may permit load control operation that work well when there a variety of loads that operate under a variety of conditions. In addition, the methods may be able to more adequately handle high-priority switching loads. The methods may also reduce the time to shed multiple loads more quickly until the actual load on the power source decreases. This decrease in time to shed the appropriate load may allow the power source to remain online.
Example Machine Architecture
The computer system 400 may be a server computer, a client computer, a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a cellular telephone, a Web appliance, a network router, switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.
The example computer system 400 may include a processor 460 (e.g., a central processing unit (CPU), a graphics processing unit (GPU) or both), a main memory 470 and a static memory 480, all of which communicate with each other via a bus 408. The computer system 400 may further include a video display unit 410 (e.g., liquid crystal displays (LCD) or cathode ray tube (CRT)). The computer system 400 also may include an alphanumeric input device 420 (e.g., a keyboard), a cursor control device 430 (e.g., a mouse), a disk drive unit 440, a signal generation device 450 (e.g., a speaker), and a network interface device 490.
The disk drive unit 440 may include a machine-readable medium 422 on which is stored one or more sets of instructions (e.g., software 424) embodying any one or more of the methodologies or functions described herein. The software 424 may also reside, completely or at least partially, within the main memory 470 and/or within the processor 460 during execution thereof by the computer system 400, the main memory 470 and the processor 460 also constituting machine-readable media. It should be noted that the software 424 may further be transmitted or received over a network (e.g., network 380 in
While the machine-readable medium 422 is shown in an example embodiment to be a single medium, the term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by the machine and that cause the machine to perform any one or more of example embodiments described herein. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories and optical and magnetic media.
Thus, a computerized method and system are described herein. Although the present invention has been described with reference to specific example embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
The Abstract is provided to comply with 37 C.F.R. Section 1.72(b) requiring an abstract that will allow the reader to ascertain the nature and gist of the technical disclosure. It is submitted with the understanding that it will not be used to limit or interpret the scope or meaning of the claims. The following claims are hereby incorporated into the detailed description, with each claim standing on its own as a separate embodiment.
Number | Name | Date | Kind |
---|---|---|---|
4031406 | Leyde et al. | Jun 1977 | A |
4034233 | Leyde | Jul 1977 | A |
4064485 | Leyde | Dec 1977 | A |
4099067 | Szentes et al. | Jul 1978 | A |
4639657 | Frierdich | Jan 1987 | A |
4701690 | Fernandez et al. | Oct 1987 | A |
4731547 | Alenduff et al. | Mar 1988 | A |
4800291 | Bowers | Jan 1989 | A |
5294879 | Freeman et al. | Mar 1994 | A |
5414640 | Seem | May 1995 | A |
5422517 | Verney et al. | Jun 1995 | A |
5604421 | Barnsley | Feb 1997 | A |
5640060 | Dickson | Jun 1997 | A |
5684710 | Ehlers et al. | Nov 1997 | A |
5761073 | Dickson | Jun 1998 | A |
5861683 | Engel et al. | Jan 1999 | A |
5880537 | Windhorn | Mar 1999 | A |
6104171 | Dvorsky et al. | Aug 2000 | A |
6107927 | Dvorsky et al. | Aug 2000 | A |
6163088 | Codina et al. | Dec 2000 | A |
6172432 | Schnackenberg et al. | Jan 2001 | B1 |
6191500 | Toy | Feb 2001 | B1 |
6552888 | Weinberger | Apr 2003 | B2 |
6631310 | Leslie | Oct 2003 | B1 |
6653821 | Kern et al. | Nov 2003 | B2 |
6657416 | Kern et al. | Dec 2003 | B2 |
6668629 | Leslie | Dec 2003 | B1 |
6686547 | Kern et al. | Feb 2004 | B2 |
6739145 | Bhatnagar | May 2004 | B2 |
6747368 | Jarrett, Jr. | Jun 2004 | B2 |
6798187 | Czarnecki | Sep 2004 | B1 |
6801019 | Haydock et al. | Oct 2004 | B2 |
6833694 | Ikekame | Dec 2004 | B2 |
6876103 | Radusewicz | Apr 2005 | B2 |
6912889 | Staphanos et al. | Jul 2005 | B2 |
6983640 | Staphanos et al. | Jan 2006 | B1 |
7015599 | Gull | Mar 2006 | B2 |
7053497 | Sodemann et al. | May 2006 | B2 |
7133787 | Mizumaki | Nov 2006 | B2 |
7146256 | Hibi et al. | Dec 2006 | B2 |
7149605 | Chassin et al. | Dec 2006 | B2 |
7177612 | Nakamura et al. | Feb 2007 | B2 |
7177728 | Gardner | Feb 2007 | B2 |
7208850 | Turner | Apr 2007 | B2 |
7218998 | Neale | May 2007 | B1 |
7230345 | Winnie et al. | Jun 2007 | B2 |
7239045 | Lathrop | Jul 2007 | B2 |
7245036 | Endou et al. | Jul 2007 | B2 |
7274974 | Brown | Sep 2007 | B2 |
7336003 | Lathrop et al. | Feb 2008 | B2 |
7345456 | Gibbs et al. | Mar 2008 | B2 |
7356384 | Gull et al. | Apr 2008 | B2 |
7446425 | Sato | Nov 2008 | B2 |
7514815 | Paik et al. | Apr 2009 | B2 |
7521822 | Lorenz | Apr 2009 | B2 |
7557544 | Heinz et al. | Jul 2009 | B2 |
7573145 | Peterson | Aug 2009 | B2 |
7579712 | Yanagihashi et al. | Aug 2009 | B2 |
7582986 | Folkers et al. | Sep 2009 | B2 |
7598623 | Fattal et al. | Oct 2009 | B2 |
7608948 | Nearhoof et al. | Oct 2009 | B2 |
7619324 | Folken et al. | Nov 2009 | B2 |
7656060 | Algrain | Feb 2010 | B2 |
7687929 | Fattal | Mar 2010 | B2 |
7715951 | Forbes, Jr. et al. | May 2010 | B2 |
7747355 | Bulthaup et al. | Jun 2010 | B2 |
7778737 | Rossi et al. | Aug 2010 | B2 |
7786616 | Naden et al. | Aug 2010 | B2 |
7795851 | Ye et al. | Sep 2010 | B2 |
7854283 | Vos et al. | Dec 2010 | B2 |
20030107349 | Haydock et al. | Jun 2003 | A1 |
20040051515 | Ikekame | Mar 2004 | A1 |
20040075343 | Wareham et al. | Apr 2004 | A1 |
20050059373 | Nakamura et al. | Mar 2005 | A1 |
20050063117 | Amano et al. | Mar 2005 | A1 |
20050072220 | Staphanos et al. | Apr 2005 | A1 |
20050116814 | Rodgers et al. | Jun 2005 | A1 |
20050128659 | Hibi et al. | Jun 2005 | A1 |
20050188745 | Staphanos et al. | Sep 2005 | A1 |
20050216131 | Sodemann et al. | Sep 2005 | A1 |
20060112688 | Vos et al. | Jun 2006 | A1 |
20060187600 | Brown et al. | Aug 2006 | A1 |
20060203814 | Ye et al. | Sep 2006 | A1 |
20060284843 | Endou et al. | Dec 2006 | A1 |
20070010916 | Rodgers et al. | Jan 2007 | A1 |
20070120538 | Sato | May 2007 | A1 |
20070129851 | Rossi et al. | Jun 2007 | A1 |
20070222294 | Tsukida et al. | Sep 2007 | A1 |
20070222295 | Wareham | Sep 2007 | A1 |
20070273214 | Wang et al. | Nov 2007 | A1 |
20080157593 | Bax et al. | Jul 2008 | A1 |
20080157600 | Marlenee et al. | Jul 2008 | A1 |
20090108678 | Algrain | Apr 2009 | A1 |
20090113874 | McKee | May 2009 | A1 |
20090152951 | Algrain | Jun 2009 | A1 |
20090179498 | Lathrop et al. | Jul 2009 | A1 |
20090195224 | Kim | Aug 2009 | A1 |
20090198386 | Kim et al. | Aug 2009 | A1 |
20090216386 | Wedel | Aug 2009 | A1 |
20090240377 | Batzler et al. | Sep 2009 | A1 |
20090290270 | Ganev et al. | Nov 2009 | A1 |
20100007313 | Jakeman et al. | Jan 2010 | A1 |
20100019574 | Baldassarre et al. | Jan 2010 | A1 |
20100038966 | Espeut, Jr. | Feb 2010 | A1 |
20100039077 | Dalby | Feb 2010 | A1 |
20100066551 | Bailey et al. | Mar 2010 | A1 |
20100094475 | Masters et al. | Apr 2010 | A1 |
20100102637 | Dozier et al. | Apr 2010 | A1 |
20100109344 | Conway et al. | May 2010 | A1 |
20100148588 | Algrain | Jun 2010 | A1 |
20100156117 | Allen | Jun 2010 | A1 |
20100156191 | Dozier et al. | Jun 2010 | A1 |
20100225167 | Stair et al. | Sep 2010 | A1 |
20110109291 | Tang et al. | May 2011 | A1 |
20110215645 | Schomburg et al. | Sep 2011 | A1 |
Number | Date | Country |
---|---|---|
1836198 | Sep 2006 | CN |
1739806 | Jan 2007 | EP |
Entry |
---|
“International Application Serial No. PCT/US2012/062967, International Preliminary Report on Patentability mailed May 15, 2014”, 8 pgs. |
“International Application Serial No. PCT/US2012/062967, International Search Report mailed Jan. 11, 2013”, 2 pgs. |
“International Application Serial No. PCT/US2012/062967, Written Opinion mailed Jan. 11, 2013”, 6 pgs. |
“Chinese Application No. 201280049499.4, Office Action dated Jul. 24, 2015”, (Jul. 24, 2015), 11 pgs. |
“European Application No. 12846078.9, Extended European Search Report dated Nov. 23, 2015”, (Nov. 23, 2015), 8 pgs. |
“Chinese Application No. 201280049499.4, Office Action dated Aug. 22, 2016”, w/ English Translation, (Aug. 22, 2016), 10 pgs. |
“Chinese Application No. 201280049499.4, Office Action dated Jan. 8, 2016”, w/ English Summary, 7 pgs. |
“Chinese Application No. 201280049499.4, Office Action dated Feb. 7, 2017”, w/English Translation, (Feb. 7, 2017), 8 pgs. |
Number | Date | Country | |
---|---|---|---|
20130116847 A1 | May 2013 | US |