Providing an energy target for high energy users

Information

  • Patent Grant
  • 10108973
  • Patent Number
    10,108,973
  • Date Filed
    Tuesday, August 12, 2014
    9 years ago
  • Date Issued
    Tuesday, October 23, 2018
    5 years ago
Abstract
The subject technology provides for identifying a set of similar users. Energy usage data is retrieved for the set of similar users. Next, based at least on the retrieved energy usage data, a comparison of energy usage of each user in the set of similar users is performed. Based on the comparison of energy usage, at least one user is selected from the set of similar users to include in a campaign. A target for energy usage is then identified for the at least one user.
Description
BACKGROUND

The present invention generally relates to encouraging energy efficiency and, in particular, to providing a user with a communication, configured to encourage energy efficiency.


Home Energy Reports (HERs) are an example of communications that provide personalized information to users about their energy use, as well as easy-to-follow tips that can lead users to use less energy and, as a result, save money on their utility bills.


SUMMARY

Some aspects of the subject technology provide a method including identifying a set of similar users, retrieving energy usage data for the set of similar users, performing, based at least on the retrieved energy usage data, a comparison of energy usage of each user in the set of similar users, selecting, based on the comparison of energy usage, at least one user from the set of similar users to include in a campaign, and selecting a target for the at least one user.


Other aspects of the subject technology further provide a system including at least one processor, a memory device including instructions that, when executed by the at least one processor, cause the at least one processor to identify a high energy user based on a comparison of energy usage of each user in a set of similar users, determine a target for the high energy user based on a rank of the high energy user among the set of similar users, and transmit to the high energy user a communication comprising the determined target.


In addition, various aspects of the subject technology provide for a non-transitory computer-readable storage medium including instructions that, when executed by a processor, cause the processor to identify a set of similar users, identify a high energy user based on a comparison of energy usage of each user in the set of similar users, select, based on the comparison of energy usage, the high energy user to include in a campaign, determine a target for the high energy user based on a rank of the high energy user among the set of similar users, and transmit to the high energy user a communication comprising the determined target.


The aspects described above are to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that various modifications and changes may be made thereunto without departing from the broader spirit and scope of the subject technology.





BRIEF DESCRIPTION OF THE DRAWINGS


FIGS. 1-4 illustrate examples of Home Energy Reports, according to certain aspects of the subject technology.



FIG. 5 illustrates examples of the interval of monthly reports, according to certain aspects of the subject technology.



FIG. 6 illustrates an example illustrating a timeline indicating a month for a first report for a campaign period and a month indicating a past period, according to certain aspects of the subject technology.



FIG. 7 illustrates an example of a technique using an average and standard deviation for determining a target, according to certain aspects of the subject technology.



FIG. 8 illustrates an example of another technique for determining a target, according to certain aspects of the subject technology.



FIG. 9 conceptually illustrates an example process of determining a target, according to certain aspects of the subject technology.



FIG. 10 illustrates a logical arrangement of a set of general components of an example computing device, according to certain aspects of the subject technology.





DETAILED DESCRIPTION

The detailed description set forth below is intended as a description of various configurations of the subject technology and is not intended to represent the only configurations in which the subject technology can be practiced. The appended drawings are incorporated herein and constitute a part of the detailed description. The detailed description includes specific details for the purpose of providing a more thorough understanding of the subject technology. However, it will be clear and apparent that the subject technology is not limited to the specific details set forth herein and may be practiced without these details. In some instances, structures and components are shown in block diagram form in order to avoid obscuring the concepts of the subject technology.


In some cases, the HERs may include one or more normative comparisons that compare a user against themselves (e.g., their past energy usage) or their neighbors. These normative comparisons are designed to motivate users to understand the underlying causes of the differences in each comparison and subsequently reduce energy consumption.


In some instances, users with relatively high energy usage may have a worse experience with existing home energy reports (“HERs”) than others. In particular, a high energy user may always see that they are using more energy than average and are underperforming or not doing well enough. Even if they are willing to improve and/or attempt to improve, they may be unable to ever see progress due to how far they are from average and due to various unchangeable factors. Over time, the user may become tired of HERs indicating that the user is making little progress and is still underperforming. As a result, the user may lose interest in improving energy efficiency and become skeptical of the normative comparisons being provided in the HERs.


Accordingly, there is a need for a system and method of motivating high energy users to improve energy efficiency. The subject technology satisfies this need and relates to a campaign configured to provide customized content for a number of high energy users. For example, a system may identify a high energy user to send customized content to, determine a target for the user, inform the user about the determined target, and provide updates to the user on progress being made to the determined target. The system may also notify the user when the user reaches the determined target.


Referring now to FIGS. 1-4, examples of home energy reports (“HERs”) 100 are illustrated, according to certain aspects of the subject technology, which provide different indications and messages that are presented in a format(s) that may further motivate such high energy users to improve their home energy usage. HERs may be provided through any number of communications channels. For example, HERs may be provided to the user through print mail, email, an application communication, a cellular communication, an interactive voice response (IVR) communication, or a web page. Furthermore, HERs are provided as merely an illustrative example. Other types of communications or reports may also be sent.


As illustrated in FIGS. 1-4, each HER 100 includes a comparison chart 102, which compares a customer 104 (e.g., a high energy user indicated as “You” in the Figures) to the customer's neighbors 112 or a set of other similar users. The results are displayed in horizontal bar graphs 106 as shown in FIGS. 1-4. A brief message 108 indicates how the customer 104 compares to their neighbors 112. An evaluation indicator 110 indicates which category and/or ranking that the customer 104 may be associated with. For example, the category can be one of several states that indicate the customer's energy usage status, including, but not limited to, “New”, “Good”, “Great”, “More than average”, etc. The evaluation indicator 110 can also indicate a ranking of the customer 104 in relation to the neighbors 112, as shown in FIGS. 2-3.


A neighbor comparison module 124 displays a dynamic neighbor description 126 that summarizes the characteristics of the neighbors that may for comparing the customer to other customers. Some characteristics may include, but is not limited to, the following:

    • 1) The customer's actual number of neighbors (e.g., 100 in one embodiment).
    • 2) The similarity in size of the neighbors' homes.
    • 3) The fuel type of the neighbors.


      Alternatively, in at least one embodiment, the dynamic neighbor description 126 can be a predetermined message that is more general in nature (e.g., not tailored to the specific characteristics of the customer 104).


In order for a customer 104 to receive a neighbor comparison, the customer 104 needs to have a group of neighbors 112 selected for comparison. First, a pool of eligible neighbors is selected and narrowed down to find neighbors that are similar to the customer 104. To do this, a number of passes is performed, each of which considers a subset of variable neighbor attributes. For each pass, fewer and fewer variables are considered in order to generate enough neighbors to make a valid comparison to the customer. The variables considered include, but are not limited to:

    • 1) Geographic distance between sites.
    • 2) Living area (“square feet” in the US or “number of bedrooms” in the UK).
    • 3) Heat type (electric, gas or other).
    • 4) Read cycles (corresponding to when a meter is read).
    • 5) Dwelling type (single-family homes or multi-family homes, such as apartments and condos).


Each pass has one or more steps, and each step incrementally increases the allowable maximum distance between sites and/or the maximum difference in living area. Each step brings in more and more sites which are close enough in distance and living area, and which match other criteria, until enough neighbors are found. Typically the passes stop once 100 neighbors are found.


The frequency with which neighbor selection is run depends in part on the utility's setup. The neighbor selection process is performed once a program is set up for a utility. The process may be run later for any new customers who join the program as a result of an expansion or rolling enrollment. Also, neighbor selection process may be triggered in the event a customer changes their information (e.g., when they change their parcel data inputs).


Next, a neighbor comparison calculation compares the customer's energy use against two groups: “All Neighbors” and “Efficient Neighbors”. The neighbor comparison calculation involves the following steps:

    • 1) Identify the start and end dates of a period of comparison.
    • 2) Identify the customer's neighbors, which is targeted at 100. If not enough qualified neighbors exist, a smaller number may be used.
    • 3) Identify the customer's efficient neighbors, which is the 20th percentile of neighbors with the lowest use for the selected period.
    • 4) Calculate the customer's total energy use over the time period.
    • 5) Calculate the average energy use of all of the customer's neighbors over the time period. This results in an energy use value for the “All Neighbors” group.
    • 6) Calculate the 20th percentile of energy use of all the customers' neighbors over the time period. This results in an energy use value for the “Efficient Neighbors” group.
    • 7) Compare the information and generate a graph that indicates how the customer is doing.


HERs 100 as discussed previously in FIGS. 1-4 are only generated for a customer that has a minimum number of efficient neighbors, as determined by step 3 of the neighbor comparison calculation above. A customer that does not meet this requirement will not receive an HER 100.


According to some aspects, neighbors are defined by site rather than by customer. For example, if an occupant of a neighbor home relocates over the course of the program and another resident moves in, the comparison will subsequently be to the new occupant of the same home.


According to some aspects, the calculation compares customers to neighbors who are not in the program. However, it does not calculate or store neighbor comparison data for those non-program customers. It only calculates and stores neighbor comparison data for customers who are in the program and who thereby receive reports.


A customer's neighbor's previous bills may not always coincide exactly in time with the customer's previous bills. In order to arrive at the neighbor averages used to calculate the comparison, the system may align past neighbor use amounts with the customer's past use amounts. In these scenarios, the neighbor bills are pro-rated or time-shifted to align with the customer bills by determining and adjusting for the amount of overlap. The adjusted neighbor bills are then used to determine the neighbor averages.


After the neighbors (e.g. a set of similar users) are identified, the system may retrieve energy usage data for the set of similar users, compare the energy usages of each user in the set of similar users, and select a user to include in the campaign based on the comparison. For example, the system may select high energy users that use more energy than 75% of similar users to receive campaign communications. In other embodiments, other factors may also be considered when including users in the campaign.


After users for the campaign are selected, the system may identify a target 114 for each user. The target 114 may be selected so that it is reachable by the high energy user 104 and/or so the user 104 can make progress towards the target 114.



FIG. 6 shows a sample timeline 600 illustrating the past period 604 and campaign period 602, according to certain aspects of the subject technology. In one implementation, the target 114 may be based on the user's usage data or rank among similar users for a past period 604 before the campaign period 602 (e.g., the average energy usage for the past year or 6 months, the energy usage for the previous month, etc.). For example, the target 114 could be a number of positions (e.g., 5 or 10 positions) better than the user's rank in the previous month. The target may also be based on the user's average ranking (e.g., the target rank may be a bit better than the user's average rank during the past 3 months).


The advantage of following the timeline of FIG. 6 is that extreme months are removed when users might have been on vacation by taking out the minimum, preventing customers from hitting the target in the first report period. It also gives users a round number as a target, which is likely more motivating for users, and there is some evidence that people strive to reach round-number goals.


Additionally there is also evidence that consumers interpret ranked lists in round number categories ending in zero or 5 (10, 15, 20, etc.) more favorably evaluate improvements in rank that cross one of those thresholds. Moving from 11 to 10 is more meaningful that moving from 10 to 9.


Alternatively, by reference to FIGS. 1-4, the target 114 may be based on the user's best ranking among similar users for the past period 604 in FIG. 6. For example, if the user's best rank in the past 10 months was 89 out of 100, the target 114 may be set at 89, or a number of spots better than 89. The target 114 may also be based on the user's best monthly rank during a similar period (e.g., a season) on a previous year. In some variations, the top month of a number of the top months for the user may be eliminated from consideration as a way to reduce months that might be outliers (e.g., the user may have been out of town). The target 114 may also be rounded up or down to a round number (e.g., a rank ending in 0 or 5) as some studies have shown that people are more motivated to reach round-number goals. In some implementations, the system may optionally allow a user 104 to set their own target. The user's ranking among the neighbors can used to determine what number is displayed in the evaluation indicator 110.


The system may monitor usage data for the user and any similar users and monitor progress made. For example, as shown in FIGS. 1-4, the system retrieves usage data for the user and the similar users, compare their usage levels, and rank the user among the rest of the similar users. The user's rank may be compared to the user's rank in previous periods and used to provide updates to the user on any progress being made toward the determined target. As shown in FIG. 5, the HERs 100 may be provided to the user on a set schedule or interval, either bimonthly 500, or quarterly 502. Furthermore, the HERs may be provided to the user as a part of the user's utility bill or as part of some other communication.


Each HER 100 (e.g. progress report) may include different messages to the user 104 that encourage the user to reach the determined target or celebrate that the user has reached the target. For example, as shown in FIG. 4, if the user 104 has hit or beat the determined target 114, a congratulatory message 120 in the progress report 100 may indicate that the user has hit or beat the target 114. Additionally, the target 114 is also has an indicator 122 to show that that user 104 has hit or beat the target 114. A congratulatory indicator 118 is also included as shown in FIG. 4. The progress report 100 may also present the user 104 with the option of setting further targets and/or a reward (e.g., a coupon, badge, or congratulatory item) for hitting the target 114. Alternatively, the system may also track how many times the user 104 has hit the determined target 114 and provide positive messages indicating that number.


If the user 104 has not hit the target 114, the system may determine whether the user 104 has moved toward the target 114. As shown in FIG. 3, the progress report 100 may include an improvement message 116 (e.g., “custom character You moved 3 spots closer to your target since your last report.”). If the user 104 is within a predetermined number of spots from the target, the progress report may include an almost there message (e.g., “custom character Almost there! You are just 3 spots away from your target.”). If the user 104 has moved further from the target 114, not made any progress, or in other cases, the progress report 100 may include a message indicating the number of spots the user is away from the target 114. In at least one embodiment, the user 104 may also receive a message celebrating the user's progress in saving energy and money even if the user 104 has not improved in ranking.


Additional messages included in the progress report 100 may include messages indicating that the user 104 has stayed at or above the target 114 and/or badges (e.g., stars or other icons) for each period that the user 104 has stayed at or above the target 114. The messages may also indicate the best ranking the user 104 has achieved (e.g., “Your best month was January—73rd neighbor rank.”), that the user 104 has beat the average similar user, or average efficient user, and/or an amount of money saved based on the user's reduction in energy usage.


Although the campaign discussed above is targeted to high energy users, in other embodiments, different campaigns may be target other segments of utility customers. Furthermore, the campaign need not focus solely on energy usage. Usages of other types of resources (e.g., water, gas, trash, etc.) may also be targeted by the campaign.


According to some aspects, the system may prevent the users 104 from setting their own target 114. This is because not as many users 104 would participate if they had the option of choosing their own target 114. Having the target 114 picked for a user 104 offers greater motivation to meet the target 114, so long as the target 114 is reasonable.


In at least one embodiment, the target 114 is determined according to the following steps:


1) Take the ranks from the same period in the prior year, minus the month thirteen months ago. For example, for the period from August '14 to January '15, the ranks from September '13 to January '14 are used, to create the set: {80, 74, 78, 50, 81}.


2) Drop the lowest rank. The set becomes {80, 74, 78, 81}.


3) Take the minimum to get a first value. The set becomes {74}.


4) Subtract one from the month before the first month to get a second value. For example, if the rank for July '14 is 72, subtracting one from 72 yields 71. 71 is the second value.


5) Take the minimum of the resulting set of the first value and the second value: {74, 71}. The minimum is 71.


6) Round down to the nearest 5, unless it is divisible by 5. In other words, if the number already ends in 0 or 5, do not round. For example, 71 rounds down to 70.


From the above example process, 70 is the target rank.


The advantage of this process is that it reflects the user's seasonality of neighbor rank, while maintaining a target that is the same throughout the campaign (though users may be more likely to hit the target at certain points in the campaign). It only accounts for the user's seasonal trend if the first report's month reflects the seasonal trend of the campaign period.



FIG. 7 illustrates an example process 700 of determining a target using standard deviations. What is shown is a set of rankings taken from a past period 604. The lowest rank 702 and highest rank 704 are dropped. The average 706 is calculated from the set of remaining ranks Next, the standard deviation 708 of the set of remaining ranks is calculated. The easier target 710 is calculated by subtracting the standard deviation 708 from the average 706 and rounding down to the nearest whole number. For example, if the average is 77 and the standard deviation is 3.6, the easier target 710 is 73 (77−3.6=73.4, rounding down equals 73). The harder target 712 is calculated by subtracting twice the standard deviation 708 from the average 706 and rounding down to the nearest whole number. For example, if the average is 77 and the standard deviation is 3.6, the harder target 712 is 69 (77−2(3.6)=69.8, rounding down equals 69).



FIG. 8 illustrates an example process 800 of a technique using percentages for determining a target, according to certain aspects of the subject technology. What is shown is a set of rankings taken from a past period 604. The lowest rank 802 and highest rank 804 are dropped. The harder target 808 is determined based on the highest rank that is left in the set of remaining ranks. The easier target 806 is determined based on the next highest rank after the harder target 808.


Alternatively, the user's current month rank can be rounded down to the nearest 10 (or other amount). This would put the user close to their target the first month, making them more motivated to try to achieve it.


Alternatively, the user's best recent month can be rounded down by looking at the user's best rank in the past 13 months. In another version, the user's target may be the user's best rank and 10 spots lower. Alternatively, the user's best recent months can be used except for one of the best months, and dropping the resulting rank one spot lower.


In another embodiment, the target rank can be a bit lower than the user's average rank, meaning that if the user behaved as they did in the past (assuming no directional trends) they would hit the target about once every 3 months. If their current month is lower than the calculated number, then the target rank may be 1 rank lower than the current month. Alternatively, the user's best month from the same period in the previous year can be used as the target. This accounts for seasonal variations in rank.



FIG. 9 is a flowchart 900 that illustrates a method including the steps of: identifying a set of similar users 902, retrieving energy usage data for the set of similar users 904, performing, based at least on the retrieved energy usage data, a comparison of energy usage of each user in the set of similar users 906, selecting, based on the comparison of energy usage, at least one user from the set of similar users to include in a campaign 908, and identifying a target for the at least one user 910.


In at least one embodiment, a set of users that use more energy than a threshold percentage of the set of similar users is selected to receive a campaign communication. In an aspect, the threshold percentage is 75%. The target may be selected to be reachable by the at least one user or to have the at least one user make progress towards the target.


In at least one embodiment, the target is based on the energy usage data of the at least one user or a rank among the set of similar users for a period before the campaign begins. In an aspect, the campaign lasts for a campaign period and the energy usage data is retrieved from a previous period one year prior to the campaign period. For example, the campaign period is six months and the previous period is five months.


In at least one embodiment, the rank may be rounded down to the lowest number divisible by five. Further, in at least one embodiment, the target is based on an average ranking of the at least one user.


In at least one embodiment, the method further includes sending an outbound communication to the at least one user, the outbound communication including information regarding whether the at least one user has reached the target, such as the examples described in FIGS. 1-4.



FIG. 10 illustrates a logical arrangement of a set of general components of an example computing device 1000 that can be implemented with the above embodiments. In this example, the device includes a processor 1002 for executing instructions that can be stored in a memory device or element 1004. As would be apparent to one of ordinary skill in the art, the device can include many types of memory, data storage, or non-transitory computer-readable storage media, such as a first data storage for program instructions for execution by the processor 1002, a separate storage for images or data, a removable memory for sharing information with other devices, etc. The device typically will include some type of display element 1006, such as a touch screen or liquid crystal display (LCD), although devices such as portable media players might convey information via other means, such as through audio speakers. As discussed, the device in many embodiments will include at least one input element 1012 able to receive conventional input from a user. This conventional input can include, for example, a push button, touch pad, touch screen, wheel, joystick, keyboard, mouse, keypad, or any other such device or element whereby a user can input a command to the device. In some embodiments, however, such a device might not include any buttons at all, and might be controlled only through a combination of visual and audio commands, such that a user can control the device without having to be in contact with the device. In some embodiments, the computing device 1000 of FIG. 10 can include one or more communication components 1008, such as a Wi-Fi, Bluetooth, RF, wired, or wireless communication system. The device in many embodiments can communicate with a network, such as the Internet, and may be able to communicate with other such devices.


The description of the subject technology is provided to enable any person skilled in the art to practice the various embodiments described herein. While the subject technology has been particularly described with reference to the various figures and embodiments, it should be understood that these are for illustration purposes only and should not be taken as limiting the scope of the subject technology.


There may be many other ways to implement the subject technology. Various functions and elements described herein may be partitioned differently from those shown without departing from the scope of the subject technology. Various modifications to these embodiments will be readily apparent to those skilled in the art, and generic principles defined herein may be applied to other embodiments. Thus, many changes and modifications may be made to the subject technology, by one having ordinary skill in the art, without departing from the scope of the subject technology.


A reference to an element in the singular is not intended to mean “one and only one” unless specifically stated, but rather “one or more.” The term “some” refers to one or more. Underlined and/or italicized headings and subheadings are used for convenience only, do not limit the subject technology, and are not referred to in connection with the interpretation of the description of the subject technology. All structural and functional equivalents to the elements of the various embodiments described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and intended to be encompassed by the subject technology. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the above description.

Claims
  • 1. A method performed by a computing device including at least one processor, the method comprising: identifying, by the at least one processor, a set of similar users;retrieving, by the at least one processor, energy usage data for the set of similar users;performing, by the at least one processor based at least on the retrieved energy usage data, a comparison of energy usage of each user in the set of similar users;generating, by the at least one processor, a ranking of the set of similar users based on the energy usage of each user in the set of similar users;selecting, by the at least one processor, based on the comparison of energy usage, at least one user from the set of similar users to include in a campaign communication, wherein the at least one user has a first rank in the ranking of the set of similar users;selecting, by the at least one processor, a target for the at least one user wherein the target is a target rank of the at least one user to improve in the ranking by reducing energy usage, wherein the target rank is determined from the first rank being rounded down to a lower number that is divisible by five; andgenerating and sending, by the at least one processor, the campaign communication to the at least one user, wherein the campaign communication comprises information regarding whether the at least one user has reached the target rank.
  • 2. A method performed by a computing device including at least one processor, the method comprising: identifying, by the at least one processor, a set of similar users;retrieving from at least one data storage, by the at least one processor, energy usage data for the set of similar users;performing, by the at least one processor, based at least on the retrieved energy usage data, a comparison of energy usage of each user in the set of similar users;selecting, by the at least one processor based on the comparison of energy usage, at least one user from the set of similar users to include in a campaign; andselecting, by the at least one processor, a target for the at least one user;wherein the target is selected based on a measure of standard deviation of energy usage of the set of similar users and the target is rounded to a value that ends in zero or five.
  • 3. A system comprising: at least one processor;a memory device including instructions that, when executed by the at least one processor, cause the at least one processor to: identify a high energy user based on a comparison of energy usage of each user in a set of similar users;generating a ranking of the set of similar users based on the energy usage of each user in the set of similar users;determine a target for the high energy user based on a rank of the high energy user among the set of similar users, wherein the target is a target rank of the high energy user to improve in the ranking by reducing energy usage;wherein the target rank is rounded down to the lowest number divisible by five; andtransmit to the high energy user a communication comprising the determined target rank.
  • 4. A non-transitory computer-readable storage medium including instructions that, when executed by a processor, cause the processor to: identify a set of similar users from energy usage data;identify a high energy user based on a comparison of energy usage of each user in the set of similar users;select, based on the comparison of energy usage, the high energy user to include in a campaign communication;generating a ranking of the set of similar users based on the energy usage of each user in the set of similar users;determine a target for the high energy user based on a rank of the high energy user in the ranking among the set of similar users, wherein the target is a target rank of the high energy user to improve in the ranking by reducing energy usage;wherein the target rank is a rank value rounded to a value ending in zero or five; andtransmit to the high energy user, via a network communication, the campaign communication comprising the determined target rank.
  • 5. The method of claim 1, wherein a set of users that use more energy than a threshold percentage of the set of similar users is selected to receive a campaign communication.
  • 6. The method of claim 1, wherein the target is based on an average ranking of the at least one user.
  • 7. The method of claim 2, wherein the target is based on the energy usage data of the at least one user or a rank among the set of similar users for a period before the campaign begins.
  • 8. The method of claim 2, wherein the campaign lasts for a campaign period and the energy usage data is retrieved from a previous period one year prior to the campaign period.
  • 9. The method of claim 2, further comprising: sending an outbound communication to the at least one user, the outbound communication comprising information regarding whether the at least one user has reached the target.
  • 10. The system of claim 3, wherein the instructions further cause the processor to: select a subset of users from the set of similar users that use more energy than a threshold percentage to receive a campaign communication.
  • 11. The system of claim 3, wherein the instructions further cause the processor to: provide updates to the high energy user in additional communications that indicate a progress being made to the determined target rank based on changes in the rank of the high energy user in the ranking.
  • 12. The system of claim 3, wherein the target is further based on energy usage data of the high energy user.
  • 13. The system of claim 3, wherein the target is based on an average ranking of the high energy user.
  • 14. The system of claim 3, wherein to provide updates to the user further causes the processor to: send a second communication to the high energy user, the second communication comprising information regarding whether the high energy user has reached the determined target rank.
  • 15. The method of claim 5, wherein the threshold percentage is 75%.
  • 16. The method of claim 8, wherein the campaign period is six months.
  • 17. The method of claim 8 wherein the previous period is five months.
  • 18. The system of claim 10, wherein the campaign communication is transmitted to the high energy user on an interval for a campaign period and the energy usage data is retrieved from a previous period one year prior to the campaign period.
CROSS-REFERENCE TO RELATED APPLICATION

This application claims the benefit of U.S. Provisional Patent Application No. 61/984,594, entitled “Motivating High-Energy Users Through Print Mail Monthly Leaderboard With Target,” filed on Apr. 25, 2014, the contents of which are incorporated in this disclosure by reference in its entirety.

US Referenced Citations (147)
Number Name Date Kind
4334275 Levine Jun 1982 A
4843575 Crane Jun 1989 A
5513519 Cauger et al. May 1996 A
5566084 Cmar Oct 1996 A
5717609 Packa et al. Feb 1998 A
5855011 Tatsuoka Dec 1998 A
5873251 Iino Feb 1999 A
5930773 Crooks et al. Jul 1999 A
5948303 Larson Sep 1999 A
6035285 Schlect et al. Mar 2000 A
6088688 Crooks et al. Jul 2000 A
6295504 Ye et al. Sep 2001 B1
6327605 Arakawa et al. Dec 2001 B2
6609048 Matsuo Aug 2003 B2
6701298 Jutsen Mar 2004 B1
6732055 Bagepalli et al. May 2004 B2
6778945 Chassin et al. Aug 2004 B2
6785620 Kishlock et al. Aug 2004 B2
6972660 Montgomery, Jr. et al. Dec 2005 B1
7020508 Stivoric et al. Mar 2006 B2
7073073 Nonaka et al. Jul 2006 B1
7073075 Freyman et al. Jul 2006 B2
7136710 Hoffberg et al. Nov 2006 B1
7142949 Brewster et al. Nov 2006 B2
7149727 Nicholls et al. Dec 2006 B1
7200468 Ruhnke et al. Apr 2007 B2
7243044 McCalla Jul 2007 B2
7333880 Brewster et al. Feb 2008 B2
7356548 Culp et al. Apr 2008 B1
7444251 Nikovski et al. Oct 2008 B2
7460502 Arima et al. Dec 2008 B2
7460899 Almen Dec 2008 B2
7552030 Guralnik et al. Jun 2009 B2
7561977 Horst et al. Jul 2009 B2
7991513 Pitt Aug 2011 B2
8065098 Gautam Nov 2011 B2
8166047 Cohen et al. Apr 2012 B1
8180591 Yuen et al. May 2012 B2
8239178 Gray et al. Aug 2012 B2
8260468 Ippolito et al. Sep 2012 B2
8275635 Stivoric et al. Sep 2012 B2
8280536 Fadell et al. Oct 2012 B1
8348840 Heit et al. Jan 2013 B2
8375118 Hao et al. Feb 2013 B2
8417061 Kennedy et al. Apr 2013 B2
8478447 Fadell et al. Jul 2013 B2
8489245 Carrel et al. Jul 2013 B2
8583288 Rossi et al. Nov 2013 B1
8630741 Matsuoka et al. Jan 2014 B1
8660813 Curtis et al. Feb 2014 B2
8690751 Auphan Apr 2014 B2
8751432 Berg-Sonne et al. Jun 2014 B2
8805000 Derby et al. Aug 2014 B2
9031703 Nakamura et al. May 2015 B2
20020065581 Fasca May 2002 A1
20020178047 Or et al. Nov 2002 A1
20020198629 Ellis Dec 2002 A1
20030011486 Ying Jan 2003 A1
20030018517 Dull et al. Jan 2003 A1
20030023467 Moldovan Jan 2003 A1
20030216971 Sick et al. Nov 2003 A1
20040024717 Sneeringer Feb 2004 A1
20040111410 Burgoon et al. Jun 2004 A1
20040140908 Gladwin et al. Jul 2004 A1
20050257540 Choi et al. Nov 2005 A1
20060089851 Silby et al. Apr 2006 A1
20060103549 Hunt et al. May 2006 A1
20070061735 Hoffberg et al. Mar 2007 A1
20070203860 Golden et al. Aug 2007 A1
20070213992 Anderson et al. Sep 2007 A1
20070255457 Whitcomb et al. Nov 2007 A1
20070260405 McConnell et al. Nov 2007 A1
20080027885 van Putten et al. Jan 2008 A1
20080167535 Stivoric et al. Jul 2008 A1
20080195561 Herzig Aug 2008 A1
20080281473 Pitt Nov 2008 A1
20080281763 Yliniemi Nov 2008 A1
20080306985 Murray et al. Dec 2008 A1
20090106202 Mizrahi Apr 2009 A1
20090204267 Sustaeta et al. Aug 2009 A1
20090326726 Ippolito et al. Dec 2009 A1
20100025483 Hoeynck et al. Feb 2010 A1
20100076835 Silverman Mar 2010 A1
20100082174 Weaver Apr 2010 A1
20100099954 Dickinson et al. Apr 2010 A1
20100138363 Batterberry et al. Jun 2010 A1
20100156665 Krzyzanowski et al. Jun 2010 A1
20100179704 Ozog Jul 2010 A1
20100198713 Forbes, Jr. et al. Aug 2010 A1
20100217452 McCord et al. Aug 2010 A1
20100217549 Galvin et al. Aug 2010 A1
20100217550 Crabtree et al. Aug 2010 A1
20100217642 Crubtree et al. Aug 2010 A1
20100217651 Crabtree et al. Aug 2010 A1
20100232671 Dam et al. Sep 2010 A1
20100286937 Hedley et al. Nov 2010 A1
20100289643 Trundle et al. Nov 2010 A1
20100324962 Nesler et al. Dec 2010 A1
20100332373 Crabtree et al. Dec 2010 A1
20110022429 Yates et al. Jan 2011 A1
20110023045 Yates et al. Jan 2011 A1
20110040666 Crabtree et al. Feb 2011 A1
20110061014 Frader-Thompson et al. Mar 2011 A1
20110063126 Kennedy et al. Mar 2011 A1
20110106316 Drew et al. May 2011 A1
20110106328 Zhou et al. May 2011 A1
20110106471 Curtis et al. May 2011 A1
20110153102 Tyagi et al. Jun 2011 A1
20110178842 Rane et al. Jul 2011 A1
20110178937 Bowman Jul 2011 A1
20110202446 Kremen Aug 2011 A1
20110205245 Kennedy et al. Aug 2011 A1
20110231320 Irving Sep 2011 A1
20110251730 Pitt Oct 2011 A1
20110251807 Rada et al. Oct 2011 A1
20110282505 Tomita et al. Nov 2011 A1
20120036250 Vaswani et al. Feb 2012 A1
20120053740 Venkatakrishnan et al. Mar 2012 A1
20120066168 Fadell et al. Mar 2012 A1
20120078417 Connell, II et al. Mar 2012 A1
20120084063 Drees et al. Apr 2012 A1
20120215369 Desai et al. Aug 2012 A1
20120216123 Shklovskii et al. Aug 2012 A1
20120259678 Overturf et al. Oct 2012 A1
20120290230 Berges Gonzalez et al. Nov 2012 A1
20120310708 Curtis et al. Dec 2012 A1
20130060531 Burke et al. Mar 2013 A1
20130060720 Burke Mar 2013 A1
20130173064 Fadell et al. Jul 2013 A1
20130253709 Renggli et al. Sep 2013 A1
20130261799 Kuhlmann et al. Oct 2013 A1
20130262040 Buckley Oct 2013 A1
20140006314 Yu et al. Jan 2014 A1
20140019319 Derby et al. Jan 2014 A1
20140074300 Shilts et al. Mar 2014 A1
20140107850 Curtis Apr 2014 A1
20140108135 Osborn Apr 2014 A1
20140148706 Van Treeck et al. May 2014 A1
20140163746 Drew et al. Jun 2014 A1
20140207292 Ramagem et al. Jul 2014 A1
20140337107 Foster Nov 2014 A1
20150019342 Gupta Jan 2015 A1
20150227846 Mercer et al. Aug 2015 A1
20150267935 Devenish et al. Sep 2015 A1
20150269664 Davidson Sep 2015 A1
20150310463 Turfboer et al. Oct 2015 A1
20150310465 Chan et al. Oct 2015 A1
Foreign Referenced Citations (27)
Number Date Country
2010315015 Jul 2014 AU
2779754 May 2011 CA
2832211 Nov 2012 CA
3703387 Aug 1987 DE
102011077522 Dec 2012 DE
0003010 Jul 1979 EP
2705440 Mar 2014 EP
2496991 Sep 2014 EP
1525656 Sep 1978 GB
2238405 May 1991 GB
2000-270379 Sep 2000 JP
2004-233118 Aug 2004 JP
2006-119931 May 2006 JP
2007-133468 May 2007 JP
2011-027305 Feb 2011 JP
2012-080679 Apr 2012 JP
2012-080681 Apr 2012 JP
2013-020307 Jan 2013 JP
WO 03102865 Dec 2003 WO
WO 03104941 Dec 2003 WO
WO 2008101248 Aug 2008 WO
WO 2009085610 Jul 2009 WO
WO 2011057072 May 2011 WO
WO 2012112358 Aug 2012 WO
WO 2012154566 Nov 2012 WO
WO 2014004148 Jan 2014 WO
WO 2014182656 Nov 2014 WO
Non-Patent Literature Citations (49)
Entry
International Search Report and Written Opinion for PCT Application No. PCT/US2015/038692, dated Sep. 24, 2015, 13 pages.
International Preliminary Report on Patentability for PCT Application No. PCT/US2010/055621, dated May 15, 2012, 8 pages.
International Search Report and Written Opinion for PCT Application No. PCT/US2010/055621, dated Dec. 23, 2010, 9 pages.
International Search Report and Written Opinion for PCT Application No. PCT/US2012/036539, dated Jul. 6, 2012, 8 pages.
International Preliminary Report on Patentability for PCT Application No. PCT/US2012/036539, dated Nov. 21, 2013, 7 pages.
International Search Report and Written Opinion for PCT Application No. PCT/US2013/046126, dated Aug. 22, 2013, 9 pages.
International Preliminary Report on Patentability for PCT Application No. PCT/US2013/046126, dated Jan. 8, 2015, 8 pages.
International Search Report for PCT Application No. PCT/US2014/036901, dated Aug. 28, 2014, 3 pages.
Patent Examination Report No. 1 for Australian Patent Application No. 2010315015, dated Dec. 17, 2013, 3 pages.
Extended European Search Report for European Patent Application No. 12782569.3, dated Nov. 27, 2014, 7 pages.
Author Unknown, “An Inconvenient Truth,” Jan. 9, 2008, 2 pages, available at http://web.archive.org/web/2008019005509/http://www.climatecrisis.net/takeaction/carbonca/.
Author Unknown, “Calculate Your Impact,” Jul. 28, 2008, 4 pages, http://web.archive.org/web/20080728161614/http://green.yahoo.com/calculator/.
Author Unknown, “Carbon Footprint Calculator: What's My Carbon Footprint?” The Nature Conservancy, Jul. 8, 2008, 8 pages, available at http://web.archive.org/web/20080708193253/http://www.nature.org/initiatives/climatechange/calculator/2008.
Author Unknown, “CoolClimate Calculator,” May 19, 2008, 15 pages, available at http://web.archive.orgi/web/20080519220643/bie.berkeley.edu/coolcale/calculations.html.
Author Unknown, “Lifecycle Climate Footprint Calculator,” Berkeley Institute of the Environment, Nov. 23, 2007, 6 pages, available at http://web.archive.org/web/20071123115832/http://bie.berkeley.edu/calculator.
Author Unknown, “More than just a thermostat.,” http://www.ecobee.com/, 4 pages, Jul. 16, 2013.
Author Unknown, “Popups Climate Change: Carbon Calculator—Greenhouse Gas and Carbon Dioxide Calculator Wed Pages,” The Nature Conservancy, 5 pages, Feb. 29, 2008, available at http://web.archive.org/web/20080229072420/www.nature.org/popups/misc/art20625.html.
Bailey, Timothy, et al., “Fitting a Mixture Model by Expectation Maximization to Discover Motifs in Biopolymers,” UCSD Technical Report CS94-351, Proceedings of the Second International Conf. on Intelligent Systems for Molecular Biology, 1994, 33 pages.
Chen, Hanfeng, et al., “Testing for a Finite Mixture Model With Two Components,” Journal of the Royal Statistical Society, Series B, vol. 66, No. 1, 26 pages, 2004.
De Prensa, Boletine, “TXU Energy Budget Alerts Give Consumers Control of Electricity Costs,” TXU Energy, http://www.txu.com/es/about/press, 2 pages, May 23, 2012.
Deb, Partha, “Finite Mixture Models,” Hunter College and the Graduate Center, CUNY NBER, FMM Slides, 42 pages, Jul. 2008.
D'Urso, M., et al., “A Simple Strategy for Life Signs Detection Via an X-Band Experimental Set-Up,” Progress in Electromagnectics Research C, vol. 9, pp. 119-129 (2009).
Eckmann, J.P., et al., “Ergodic theory of chaos and strange attractors,” Reviews of Modern Physics, vol. 57, No. 3, Part I, pp. 617-656, Jul. 1985.
Espinoza, Marcelo, et al., “Short-Term Load Forecasting, Profile Identification, and Customer Segmentation: A Methodology Based on Periodic Time Series,” IEEE Transactions on Power Systems, vol. 20, No. 3, pp. 1622-1630, Aug. 2005.
Fels, Margaret F., “PRISM: An Introduction,” Elsevier Sequoia, Energy and Buildings, vol. 9, pp. 5-18, 1986.
Fels, Margaret F., et al., Seasonality of Non-heating Consumption and Its effect on PRISM Results, Elsevier Sequoia, Energy and Buildings, vol. 9, pp. 139-148, 1986.
Figueiredo, Vera, et al., “An Electric Energy Consumer Characterization Framework Based on Data Mining Techniques,” IEEE Transactions on Power Systems, vol. 20, No. 2, pp. 596-602, May 2005.
Fitbit® Official Site, “Flex, One & Zip Wireless Activity & Sleep Trackers,” http://www.fitbit.com/, 4 pages, Jul. 15, 2013.
Friedman, Jerome, et al., “Regularization Paths for Generalized Linear Models via Coordinate Descent,” Journal of Statistical Sotfware, vol. 33, Iss. 1, pp. 1-22, Jan. 2010.
Goldberg, Miriam L., et al., “Refraction of PRISM Results into Components of Saved Energy,” Elsevier Sequoia, Energy and Buildings, vol. 9, pp. 169-180, 1986.
Jansen, R.C., “Maximum Likelihood in a Generalized Linear Finite Mixture Model by Using the EM Algorithm,” Biometrics, vol. 49, pp. 227-231, Mar. 1993.
Jawbone, “Know yourself. Live better.” https://jawbone.com/up/, 7 pages, Jul. 15, 2013.
Leisch, Friedrich, “FlexMix: A General Framework for Finite Mixture Models and Latent Class Regression in R,” Journal of Statistical Software, http://www.jstatsoft.org/, vol. 11 (8), pp. 1-18, Oct. 2004.
Liang, Jian, et al. “Load Signature Study—Part II: Disaggregation Framework, Simulation, and Applications,” IEEE Transactions on Power Delivery, vol. 25, No. 2, pp. 561-569, Apr. 2010.
Liang, Jian, et al., “Load Signature Study—Part I: Basic Concept, Structure, and Methodology,” IEEE Transactions on Power Delivery, vol. 25, No. 2, pp. 551-560, Apr. 2010.
Mint.com, “Budgets you'll actually stick to,” Budgeting-Calculate and Categorize your spending, https://www.mint.com/how-it-works/budgeting/, 2 pages, Jul. 12, 2013.
Mint.com, “We're always on alert.” Alerts for bills, fees & going over budget, https://www.mint.com/how-it-works/alerts/, 2 pages, Jul. 12, 2013.
Mori, Hiroyuki, “State-of-the-Art Overview on Data Mining in Power Systems,” IEEE, pp. 33-37, 2006.
Muthen, Bengt, et al., Finite Mixture Modeling with Mixture Outcomes Using the EM Algorithm, Biometrics, vol. 55, pp. 463-469, Jun. 1999.
Nest, “The Learning Thermostat,” http://www.nest.com/, 2 pages, Jul. 15, 2013.
Nike.com, “Nike + FuelBand. Tracks your all-day activity and helps you do more . . . ,” http://www.nike.com/us/en_us/c/nikeplus-f..uelband, 7 pages, Jul. 15, 2013.
Rose, O. “Estimation of the Hurst Parameter of Long-Range Dependent Time Series,” University of Wuirzburg, Institute of Computer Science, Research Report Series, Report No. 137, 15 pages, Feb. 1996.
Sawka, Michael N., et al., “Human Adaptations to Heat and Cold Stress,” RTOMP-076, 16 pages, Oct. 2001.
Stephen, Bruce, et al. “Domestic Load Characterization Through Smart Meter Advance Stratification,” IEEE Transactions on Smart Grid, Power Engineering Letter, vol. 3, No. 3, pp. 1571-1572, Sep. 2012.
Stoop, R., et al., “Calculation of Lyapunov exponents avoiding spurious elements,” Physica D 50, pp. 89-94, May 1991.
Wang, Xiaozhe, et al., “Characteristic-Based Clustering for Time Series Data,” Data Mining and Knowledge Discovery, Springer Science & Business Media, LLC, vol. 13, pp. 335-364 (2006).
Wehrens, Ron, et al. “Self- and Super-organizing Maps in R: The kohonen Package,” Journal of Statistical Software, vol. 21, Iss. 5, pp. 1-19, Oct. 2007.
Wikipedia, “Akaike information criterion,” 6 pages, Aug. 17, 2012.
Wikipedia, “Mixture model,” 10 pages, Oct. 7, 2012.
Related Publications (1)
Number Date Country
20150310019 A1 Oct 2015 US
Provisional Applications (1)
Number Date Country
61984594 Apr 2014 US