SearcharxivSearch

arXiv · 1806.08999

Model predictive control of indoor microclimate: existing building stock comfort improvement

Abstract

Home retrofitting provides a means to improve the basic energy and comfort characteristics of a building stock, which cannot be renewed because of prohibitive costs. We analyze how model predictive control (MPC) applied to indoor microclimate control can provide energy-efficient solutions to the problem of occupants' comfort in a variety of situations principally imposed by external weather and room occupancy. For this purpose we define an objective function for the energy consumption, and we consider two illustrative cases: one building designed and built in recent times with modern HVAC equipment, and one designed and built several decades ago with poor thermal characteristics and no dedicated ventilation system. Our model includes various physical effects such as air infiltration and indoor thermal "inertia mass" (inner walls, floor, ceiling, and furniture), and also accounts for the impact of human presence essentially as heat and CO$_2$ sources. The influence on the numerical results of forecast horizons and of uncertainties due to inaccuracies in the weather and room occupancy forecasts, are analyzed. As we solve non-convex optimization problems using a linear and a nonlinear optimizer, full MPC performance is compared to both linearized MPC and a standard on/off controller. The main advantage of MPC is its ability to provide satisfactory solutions for microclimate control at the least possible energy cost for both modern and old buildings. As old buildings are usually not properly ventilated, we see in light of our simulation results, that a supply ventilation system installation provides a solution for significant air quality improvement.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Ryzhov, H. Ouerdane, E. Gryazina, A. Bischi, K. Turitsyn. 2018-06-23. Model predictive control of indoor microclimate: existing building stock comfort improvement. https://doi.org/10.1016/j.enconman.2018.10.046

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC