Rachel Kalpana Kalaimani

Rachel Kalaimani, Milan Jain, Srinivasan Keshav et al.

Most modern HVAC systems suffer from two intrinsic problems. First, inability to meet diverse comfort requirements of the occupants. Second, heat or cool an entire zone even when the zone is only partially occupied. Both issues can be mitigated by using personal comfort systems (PCS) which bridge the comfort gap between what is provided by a central HVAC system and the personal preferences of the occupants. In recent work, we have proposed and deployed such a system, called SPOT. We address the question, "How should an existing HVAC system modify its operation to benefit the availability of PCS like SPOT?" For example, energy consumption could be reduced during sparse occupancy by choosing appropriate thermal set backs, with the PCS providing the additional offset in thermal comfort required for each occupant. Our control strategy based on Model Predictive Control (MPC), employs a bi-linear thermal model, and has two time-scales to accommodate the physical constraints that limit certain components of the central HVAC system from frequently changing their set points. We compare the energy consumption and comfort offered by our SPOT-aware HVAC system with that of a state-of-the-art MPC-based central HVAC system in multiple settings including different room layouts and partial deployment of PCS. Numerical evaluations show that our system obtains, in average, 45% (15%) savings in energy in summer (winter), compared with the benchmark system for the case of homogeneous comfort requirements. For heterogeneous comfort requirements, we observe 51% (29%) improvement in comfort in summer (winter) in addition to significant savings in energy.

Milan Jain, Rachel K Kalaimani, Srinivasan Keshav et al.

Heating, Ventilation and Air Conditioning (HVAC) consumes a significant fraction of energy in commercial buildings. Hence, the use of optimization techniques to reduce HVAC energy consumption has been widely studied. Model predictive control (MPC) is one state of the art optimization technique for HVAC control which converts the control problem to a sequence of optimization problems, each over a finite time horizon. In a typical MPC, future system state is estimated from a model using predictions of model inputs, such as building occupancy and outside air temperature. Consequently, as prediction accuracy deteriorates, MPC performance--in terms of occupant comfort and building energy use--degrades. In this work, we use a custom-built building thermal simulator to systematically investigate the impact of occupancy prediction errors on occupant comfort and energy consumption. Our analysis shows that in our test building, as occupancy prediction error increases from 5\% to 20\% the performance of an MPC-based HVAC controller becomes worse than that of even a simple static schedule. However, when combined with a personal environmental control (PEC) system, HVAC controllers are considerably more robust to prediction errors. Thus, we quantify the effectiveness of PECs in mitigating the impact of forecast errors on MPC control for HVAC systems.

Shamik Bhattacharyya, Rachel Kalpana Kalaimani

Federated learning is a privacy-focused approach towards machine learning where models are trained on client devices with locally available data and aggregated at a central server. However, the dependence on a single central server is challenging in the case of a large number of clients and even poses the risk of a single point of failure. To address these critical limitations of scalability and fault-tolerance, we present a distributed approach to federated learning comprising multiple servers with inter-server communication capabilities. While providing a fully decentralized approach, the designed framework retains the core federated learning structure where each server is associated with a disjoint set of clients with server-client communication capabilities. We propose a novel DFL (Distributed Federated Learning) algorithm which uses alternating periods of local training on the client data followed by global training among servers. We show that the DFL algorithm, under a suitable choice of parameters, ensures that all the servers converge to a common model value within a small tolerance of the ideal model, thus exhibiting effective integration of local and global training models. Finally, we illustrate our theoretical claims through numerical simulations.

Sourav Sahoo, Anand Gokhale, Rachel Kalpana Kalaimani

We study the problem of non-constrained, discrete-time, online distributed optimization in a multi-agent system where some of the agents do not follow the prescribed update rule either due to failures or malicious intentions. None of the agents have prior information about the identities of the faulty agents and any agent can communicate only with its immediate neighbours. At each time step, a locally Lipschitz strongly convex cost function is revealed locally to all the agents and the non-faulty agents update their states using their local information and the information obtained from their neighbours. We measure the performance of the online algorithm by comparing it to its offline version, when the cost functions are known apriori. The difference between the same is termed as regret. Under sufficient conditions on the graph topology, the number and location of the adversaries, the defined regret grows sublinearly. We further conduct numerical experiments to validate our theoretical results.