Model predictive control for deferrable loads scheduling

Real-time demand response is essential for handling the uncertainties of renewable generation. Traditionally, demand response has been focused on large industrial and commercial loads, however it is expected that a large number of small residential loads such as air conditioners, dish washers, and electric vehicles will also participate in the coming years. The electricity consumption of these smaller loads, which we call deferrable loads, can be shifted over time, and thus be used (in aggregate) to compensate for the random fluctuations in renewable generation.

In this thesis, we propose a real-time distributed deferrable load control algorithm to reduce the variance of aggregate load (load minus renewable generation) by shifting the power consumption of deferrable loads to periods with high renewable generation. The algorithm is model predictive in nature, i.e., at every time step, the algorithm minimizes the expected variance to go with updated predictions. We prove that suboptimality of this model predictive algorithm vanishes as time horizon expands in the average case analysis. Further, we prove strong concentration results on the distribution of the load variance obtained by model predictive deferrable load control. These concentration results highlight that the typical performance of model predictive deferrable load control is tightly concentrated around the average-case performance. Finally, we evaluate the algorithm via trace-based simulations.

Radio-aware service-level scheduling to minimize downlink traffic delay through Mobile Edge Computing

One of the most challenging problems in mobile broadband networks is how to assign the available radio resources among the different mobile users. Traditionally, research proposals are either speci c to some type of traffic or deal with computationally intensive algorithms aimed at optimizing the delivery of general purpose traffic. Consequently, commercial networks do not incorporate these mechanisms due to the limited hardware resources at the mobile edge. Emerging 5G architectures introduce cloud computing principles to add flexible computational resources to Radio Access Networks. This paper makes use of the Mobile Edge Computing concepts to introduce a new element, denoted as Mobile Edge Scheduler, aimed at minimizing the mean delay of general traffic flows in the LTE downlink. This element runs close to the eNodeB element and implements a novel flow-aware and channel-aware scheduling policy in order to accommodate the transmissions to the available channel quality of end users.

Gain Scheduling Control of an Islanded Microgrid Voltage

The aim of this research study has been to design a gain scheduling (GS) digital controller in order to control the voltage of an islanded microgrid in the presence of fast varying loads (FVLs), and to compare it to a robust controller. The inverter which feeds the microgrid is connected to it through an inductance-capacitor-inductance (LCL) filter. The oscillatory and nonlinear behaviour of the plant is analyzed in the whole operating zone. Afterwards, the design of the controllers which contain two loops in cascade are described. The first loop concerns the current control, while the second is linked to the voltage regulation. Two controllers, one defined as Robust and another one as GS controller, are designed for the two loops, emphasizing in their robustness and their ability to damp the oscillatory plant behaviour. To finish, some simulations are carried out to study and compare the two kinds of controllers in different operating points. The results show that both controllers damp the oscillatory behaviour of the plant in closed loop (CL), and that the GS controller ensures a better rejection of current disturbances from FVLs.

A Novel Scheduling Index Rule Proposal for QoE Maximization in Wireless Networks

This paper deals with the resource allocation problem aimed at maximizing users' perception of quality in wireless channels with time-varying capacity. First of all, we model the subjective quality-aware scheduling problem in the framework of Markovian decision processes. Then, given that the obtaining of the optimal solution of this model is unachievable, we propose a simple scheduling index rule with closed-form expression by using a methodology based on Whittle approach. Finally, we analyze the performance of the achieved scheduling proposal in several relevant scenarios, concluding that it outperforms the most popular existing resource allocation strategies.

Comparison of different scheduling techniques for H-infinity controllers

Several approaches to designing schedule H-infinity control systems are compared. These include a controller switching approach and also parameter scheduling of an observer representation of the controller. They are illustrated by application to a Generic VSTOI. Aircraft Model (GVAM) supplied by The Royal Aerospace Establishment (RAE) at Bedford. The switched design has been tested on the simulator at RAE Bedford. The linear H-infinity designs make use of a loop-shaping followed by robust stabilisation to additive perturbations of a normalised coprime factorisation of the shaped plans. The different scheduling approaches are compared with respect to achieved robust stability levels. performance and complexity of implementation.

Solving problems in production scheduling

Traditionally, production scheduling has been viewed as a problem-solving task that involves a single problem - generation of a suitable schedule. This paper presents an alternative model in which individual difficulties are viewed as problems, and the task is to maintain a suitable schedule by resolving as many of these problems as possible. Decision support software is described that has facilities for defining policies to handle numerous minor problems and complete problem-solving strategies to deal with major problems. The paper then discusses the potential for this style of decision support to improve the performance of human schedulers. © 1995.

Product scheduling for thermal energy reduction in papermaking industries

Papermaking is considered as an energy-intensive industry partly due to the fact that the machinery and procedures have been designed at the time when energy was both cheap and plentiful. A typical paper machine manufactures a variety of different products (grades) which impose variable per-unit raw material and energy costs to the mill. It is known that during a grade change operation the products are not market-worthy. Therefore, two different production regimes, i.e. steady state and grade transition can be recognised in papermaking practice. Among the costs associated with paper manufacture, the energy cost is 'more variable' due to (usually) day-to-day variations of the energy prices. Moreover, the production of a grade is often constrained by customer delivery time requirements. Given the above constraints and production modes, the product scheduling technique proposed in this paper aims at optimising the sequence of orders in a single machine so that the cost of production (mainly determined by the energy) is minimised. Simulation results obtained from a commercial board machine in the UK confirm the effectiveness of the proposed method. © 2011 IFAC.

Sensor data scheduling for linear quadratic Gaussian control with full state feedback

Networked control systems (NCSs) have attracted much attention in the past decade due to their many advantages and growing number of applications. Different than classic control systems, resources in NCSs, such as network bandwidth and communication energy, are often limited, which degrade the closed-loop system performance and may even cause the system to become unstable. Seeking a desired trade-off between the closed-loop system performance and the limited resources is thus one heated area of research. In this paper, we analyze the trade-off between the sensor-to-controller communication rate and the closed-loop system performance indexed by the conventional LQG control cost. We present and compare several sensor data schedules, and demonstrate that two event-based sensor data schedules provide better trade-off than an optimal offline schedule. Simulation examples are provided to illustrate the theories developed in the paper. © 2012 AACC American Automatic Control Council).