A Scheduler for Smart Homes with Probabilistic User Preferences

Scheduling appliances is a challenging and interesting problem aimed at reducing energy consumption at a residential level. Previous work on appliance scheduling for smart homes assumes that user preferences have no uncertainty. In this paper, we study two approaches to address this problem when user preferences are uncertain. More specifically, we assume that user preferences in turning on or off a device are represented by Normal distributions. The first approach uses sample average approximation, a mathematical model, in computing a schedule. The second one relies on the fact that a scheduling problem could be viewed as a constraint satisfaction problem and uses depth-first search to identify a solution. We also conduct an experimental evaluation of the two approaches to investigate the scalability of each approach in different problem variants. We conclude by discussing computational challenges of our approaches and some possible directions for future work.