Online Comfort-Constrained HVAC Control via Feature Transfer

Policy transfer can reduce energy consumption of the Heating, Ventilation, and Air Conditioning (HVAC) system in a target building without requiring extensive offline data or costly online interaction.However, the energy savings often come at the expense of violating constraints, such as thermal comfort constraints, in the target building.In this paper, we propose a novel approach to augment black-box policy transfer methods for simultaneous minimization of energy consumption and thermal comfort constraint violation.To ensure compliance with these constraints, the algorithm leverages nonlinear feature functions learned from historical data of source buildings and adapt these features to approximate the target building dynamics via online learning in a sample efficient manner.We present an upper bound on the number of time steps during which thermal comfort violations may occur under worst-case disturbances, and also establish a finite stopping time beyond which all constraints are consistently met, assuming certain stochastic properties of disturbances.Additionally, we evaluate the algorithm using the EnergyPlus simulator across 19 climate locations in January and July.OCFT reduces the total number of constraint violation of the black-box policy transfer algorithm by an average of 81.28% while resulting in 11.23% more energy consumption on average.

Authors

Institutions

Publication Details

Published
2025-06-16
DOI
https://doi.org/10.1145/3679240.3734592
Citations
1
Primary Topic
Building Energy and Comfort Optimization
Type
article
Field-Weighted Citation Impact
1.01

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Comfort-Constrained HVAC Control via Feature Transfer

Jing Yu, Tianyu Zhang, Adam Wierman, Omid Ardakanian
1 citations
Building Energy and Comfort Optimization
1.01
article

Online Comfort-Constrained HVAC Control via Feature Transfer

Jing Yu, Tianyu Zhang, Adam Wierman, Omid Ardakanian
article en
1 citations

Abstract

Policy transfer can reduce energy consumption of the Heating, Ventilation, and Air Conditioning (HVAC) system in a target building without requiring extensive offline data or costly online interaction.However, the energy savings often come at the expense of violating constraints, such as thermal comfort constraints, in the target building.In this paper, we propose a novel approach to augment black-box policy transfer methods for simultaneous minimization of energy consumption and thermal comfort constraint violation.To ensure compliance with these constraints, the algorithm leverages nonlinear feature functions learned from historical data of source buildings and adapt these features to approximate the target building dynamics via online learning in a sample efficient manner.We present an upper bound on the number of time steps during which thermal comfort violations may occur under worst-case disturbances, and also establish a finite stopping time beyond which all constraints are consistently met, assuming certain stochastic properties of disturbances.Additionally, we evaluate the algorithm using the EnergyPlus simulator across 19 climate locations in January and July.OCFT reduces the total number of constraint violation of the black-box policy transfer algorithm by an average of 81.28% while resulting in 11.23% more energy consumption on average.

California Institute of Technology (US), University of Alberta (CA), Autodesk (Canada) (CA)
National Science Foundation
Affordable and clean energy
Openalex Percentile: Top 24%
Building Energy and Comfort Optimization
1.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.