{'fraction_non_alphanumeric': 0.01589825119236884, 'fraction_numerical': 0.0, 'mean_word_length': 5.326633165829146, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Strategic scheduling of residential energy consumers

We propose the strategic scheduling problem of an energy utility that administers a large residential population and may ask individual consumers to curtail part of their HVAC usage profile up to a certain effort budget, in such a way that the aggregate reductions follow a desired day-ahead goal profile. Each consumer is described by a forecast of their thermal response profile computed using a statistical model that decomposes smart meter data into a thermally-sensitive component and an intentional usage component. We propose an algorithm for computing individually-tailored optimal action schedules (e.g., automated Demand-Response control or marketing calls) for thermal energy consumption for a large sample of consumers that is based on solving a convex program. Then, we describe an approximate version of the original scheduling problem that is both interpretable and faster to compute. For this, we recast strategic scheduling as a discrete, set selection problem in which the operator is constrained by what effort structures it can request from the consumers. We propose an efficient algorithm for selecting optimal sets of consumers based on optimizing non-monotone submodular functions.