Real Time Information Based Energy Management Using Customer Preferences and Dynamic Pricing in Smart Homes
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper presents real time information based energy management algorithms to reduce electricity cost and peak to average ratio (PAR) while preserving user comfort in a smart home. We categorize household appliances into thermostatically controlled (tc), user aware (ua), elastic (el), inelastic (iel) and regular (r) appliances/loads. An optimization problem is formulated to reduce electricity cost by determining the optimal use of household appliances. The operational schedules of these appliances are optimized in response to the electricity price signals and customer preferences to maximize electricity cost saving and user comfort while minimizing curtailed energy. Mathematical optimization models of tc appliances, i.e., air-conditioner and refrigerator, are proposed which are solved by using intelligent programmable communication thermostat ( iPCT). We add extra intelligence to conventional programmable communication thermostat (CPCT) by using genetic algorithm (GA) to control tc appliances under comfort constraints. The optimization models for ua, el, and iel appliances are solved subject to electricity cost minimization and PAR reduction. Considering user comfort, el appliances are considered where users can adjust appliance waiting time to increase or decrease their comfort level. Furthermore, energy demand of r appliances is fulfilled via local supply where the major objective is to reduce the fuel cost of various generators by proper scheduling. Simulation results show that the proposed algorithms efficiently schedule the energy demand of all types of appliances by considering identified constraints (i.e., PAR, variable prices, temperature, capacity limit and waiting time).
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it