Search arXivSearch

arXiv · 2609.06698

User-specified Kelvin-hour budgets within model predictive control for energy-efficient buildings: Simulation and field demonstration

Abstract

For energy-efficient building control, model predictive control (MPC) has been widely proposed to reduce energy use while maintaining prescribed indoor temperature bounds. In practice, MPC implementations may still produce temperature-bound violations because of model mismatch, weather-forecast errors, and softened constraints introduced to preserve feasibility. Existing soft- constrained MPC usually handles this trade-off through slack-weight tuning, so users cannot prescribe a violation-severity budget before operation. This paper develops a Kelvin-hour (Kh)-budget MPC that allows users to specify a running-average budget for temperature-bound violation severity. During operation, the controller uses the realized Kh budget surplus or overspend to update the temperature bounds, providing step-by-step budget feedback. We evaluate the method in two high-fidelity BOPTEST simulation cases and in an occupied residential deployment. In the first one-zone case, prescribed budgets produce clear running-average Kh violation responses across predictors and disturbance settings. At a prescribed budget of 0.005 Kh/step, the controller reduces energy use by 31.9% and Kh violation by 36.2% relative to the built-in default controller. In the second coupled two-zone case, separate zone budgets produce zone-level responses, with 18.9%-20.5% energy reduction and 9.4%-64.3% zone-level Kh violation reduction. In the occupied residential deployment, the running-average Kh violations remain close to or below their prescribed budgets under real sensing, actuation, weather, and occupancy conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jicheng Shi, Colin N. Jones. 2026-09-06. User-specified Kelvin-hour budgets within model predictive control for energy-efficient buildings: Simulation and field demonstration. https://arxiv.org/abs/2609.06698

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Failure-Aware Iterative Learning of State-Control Invariant Sets

In this paper, we address the problem of computing maximal state-control invariant sets for deterministic linear systems using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time-invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

eess.SY

Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

This paper presents cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI system synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible graph matrices and propose two new algorithms to generate them. Simulations validate the proposed approach.

eess.SY

Extracting Exact Lie Derivatives Without Backpropagation: A Dual Compiler for Neural Control Barrier Functions

A safety filter based on a neural control barrier function (CBF) deployed in an embedded control loop evaluates, at each control cycle, the trained network and its Lie derivatives along the system vector fields, under the memory and worst-case execution time (WCET) constraints that safety-oriented coding standards impose. Reverse-mode automatic differentiation, by which training frameworks obtain these derivatives, retains an activation cache whose size grows with the sum of the layer widths, and general-purpose differentiation runtimes allocate the computational graph from the heap at each call. This paper presents a compiler that evaluates a neural CBF and its exact Lie derivatives by forward-mode dual-number arithmetic. The compiler emits self-contained C++ code in which a single forward pass, without backpropagation, returns the barrier value and its exact Lie derivative along a given vector field; the drift and input Lie derivatives of the safety constraint are obtained from one such pass per vector field, and a second-order extension based on hyper-dual numbers returns the exact second-order Lie derivatives required by CBFs of relative degree two. The dual forward pass requires a workspace bounded by four times the widest layer, independent of network depth, and the emitted code contains no allocation call sites, so the absence of dynamic allocation is verifiable by inspection of the code. On an ESP32-S3 microcontroller, the compiled filter assembles the complete safety constraint in under one millisecond from statically allocated buffers of at most 768 bytes, and the maximum execution time over 1000 evaluations lies within 5% of the median in all three examples, whereas a heap-allocating reverse-mode baseline shows maxima 33% and 70% above its median in the two first-order examples. The compiler and the embedded experiments are released as open-source software.

eess.SY