Michael Wetter

Bio: Michael Wetter is an academic researcher from Lawrence Berkeley National Laboratory. The author has contributed to research in topics: Modelica & HVAC. The author has an hindex of 36, co-authored 102 publications receiving 4058 citations. Previous affiliations of Michael Wetter include Katholieke Universiteit Leuven.

Modelica Buildings Library

Abstract: This article describes the Buildings library, a free open-source library that is implemented in Modelica, an equation-based object-oriented modelling language. The library supports rapid prototyping, as well as design and operation of building energy and control systems. First, we describe the scope of the library, which covers heating, ventilation and air-conditioning systems, multi-zone heat transfer and multi-zone airflow and contaminant transport. Next, we describe differentiability requirements and address how we implemented them. We describe the class hierarchy that allows implementing component models by extending partial implementations of base models of heat and mass exchangers, and by instantiating basic models for conservation equations and flow resistances. We also describe associated tools for pre- and post-processing, regression tests, co-simulation and real-time data exchange with building automation systems. The article closes with an example of a chilled water plant, with and without wate...

Co-Simulation of Building Energy and Control Systems with the Building Controls Virtual Test Bed

Abstract: This article describes the implementation of the Building Controls Virtual Test Bed (BCVTB). The BCVTB is a software environment that allows connecting different simulation programs to exchange data during the time integration, and that allows conducting hardware in the loop simulation. The software architecture is a modular design based on Ptolemy II, a software environment for design and analysis of heterogeneous systems. Ptolemy II provides a graphical model building environment, synchronizes the exchanged data and visualizes the system evolution during run-time. The BCVTB provides additions to Ptolemy II that allow the run-time coupling of different simulation programs for data exchange, including EnergyPlus, MATLAB, Simulink and the Modelica modelling and simulation environment Dymola. The additions also allow executing system commands, such as a script that executes a Radiance simulation. In this article, the software architecture is presented and the mathematical model used to implement the co-simulation is discussed. The simulation program interface that the BCVTB provides is explained. The article concludes by presenting applications in which different state of the art simulation programs are linked for run-time data exchange. This link allows the use of the simulation program that is best suited for the particular problem to model building heat transfer, HVAC system dynamics and control algorithms, and to compute a solution to the coupled problem using co-simulation.

Modelica-based Modeling and Simulation to Support Research and Development in Building Energy and Control Systems

Abstract: Traditional building simulation programs possess attributes that make them difficult to use for the design and analysis of building energy and control systems and for the support of model-based research and development of systems that may not already be implemented in these programs. This article presents characteristic features of such applications, and it shows how equation-based object-oriented modelling can meet requirements that arise in such applications. Next, the implementation of an open-source component model library for building energy systems is presented. The library has been developed using the equation-based object-oriented Modelica modelling language. Technical challenges of modelling and simulating such systems are discussed. Research needs are presented to make this technology accessible to user groups that have more stringent requirements with respect to the numerical robustness of simulation than a research community may have. Two examples are presented in which models from the here de...

Pattern Recognition and Machine Learning

Abstract: Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Solving Ordinary Differential Equations

Abstract: Initial-value ordinary differential equation solution via variable order Adams method (SIVA/DIVA) package is collection of subroutines for solution of nonstiff ordinary differential equations. There are versions for single-precision and double-precision arithmetic. Requires fewer evaluations of derivatives than other variable-order Adams predictor/ corrector methods. Option for direct integration of second-order equations makes integration of trajectory problems significantly more efficient. Written in FORTRAN 77.

Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods ∗

Abstract: Direct search methods are best known as unconstrained optimization techniques that do not explicitly use derivatives. Direct search methods were formally proposed and widely applied in the 1960s but fell out of favor with the mathematical optimization community by the early 1970s because they lacked coherent mathematical analysis. Nonetheless, users remained loyal to these methods, most of which were easy to program, some of which were reliable. In the past fifteen years, these methods have seen a revival due, in part, to the appearance of mathematical analysis, as well as to interest in parallel and distributed com- puting. This review begins by briefly summarizing the history of direct search methods and considering the special properties of problems for which they are well suited. Our focus then turns to a broad class of methods for which we provide a unifying framework that lends itself to a variety of convergence results. The underlying principles allow general- ization to handle bound constraints and linear constraints. We also discuss extensions to problems with nonlinear constraints.