Energy storage is a crucial component of the smart grid, since it provides the ability to buffer transient fluctuations of the energy supply from renewable sources. Even without a load, energy storage systems experience a reduction of the stored energy through self-discharge. In some storage technologies, the rate of self-discharge can exceed 50 of the stored energy per day. In this paper, we investigate the self-discharge phenomenon in energy storage using a queueing system model, which we refer to as leakage queue. When the average net charge is positive, we discover that the leakage queue operates in one of two regimes: a leakage-dominated regime and a capacity-dominated regime. We find that in the leakage-dominated regime, the stored energy stabilizes at a point that is below the storage capacity. Under suitable independence assumptions for energy supply and demand, the stored energy in this regime closely follows a normal distribution. We present two methods for computing probabilities of underflow and overflow at a leakage queue. The methods are validated in a numerical example where the energy supply resembles a wind energy source.
More recently, a fluid-flow interpretation of queueing theory, known as network calculus' @cite_11 , has been applied to energy storage systems. A deterministic analysis has been used in @cite_6 to devise battery charging schedules that prevent batteries from running empty. Stochastic extensions of the network calculus have been applied to analyze energy storage in the presence of random, generally Markovian, energy sources @cite_18 @cite_27 @cite_7 . In these works, the evolution of the stored energy is expressed using a time-dependent function for the backlog in a finite-capacity queueing system from @cite_23 . Recent studies @cite_30 @cite_43 @cite_3 @cite_14 @cite_47 have improved the fidelity of energy storage models by considering factors such as limited charging and discharging rates, charging and discharging inefficiencies, as well as self-discharge. In @cite_43 , the self-discharge is modeled by a constant rate function, whereas the other works @cite_30 @cite_3 @cite_14 @cite_47 use a proportional leakage ratio as described in Sec. . Since queueing systems for energy storage systems with proportional self-discharge could not be solved analytically, the existing analyses resort to simulation and optimization methods. These provide numerical solutions, but do not easily give insight into parameter regimes and basic tradeoffs.
@cite_30 @cite_18 @cite_14 @cite_7 @cite_6 @cite_3 @cite_43 @cite_27 @cite_23 @cite_47 @cite_11
2138114791 2007853386 2006267017 1510598052
In this paper, we consider delay-optimal charging scheduling of the electric vehicles (EVs) at a charging station with multiple charge points. The charging station is equipped with renewable energy generation devices and can also buy energy from power grids. The uncertainty of the arrival of the EV, the intermittence of the renewable energy, and the variation of the grid power price are taken into account and described as independent Markov processes. Meanwhile, the required charging energy for each EV is random. The goal is to minimize the mean waiting time for EVs under the long-term constraint on the cost. We propose queue mapping to convert the EV queue to the charging demand queue, and we prove the equivalence between the minimization of the two queues' average length. Then, we focus on the minimization for the average length of the charging demand queue under the long-term cost constraint. We propose a framework of Markov decision process (MDP) to investigate this constrained stochastic optimization problem. The system state includes the charging demand queue length, the charging demand arrival, the energy level in the storage battery of the renewable energy, the renewable energy arrival, and the grid power price. Additionally, the number of charging demands and the allocated energy from the storage battery compose the 2-D policy. We derive two necessary conditions of the optimal policy. Moreover, we discuss the reduction of the 2-D policy to be the number of charging demands only. We give the sets of system states for which charging no demand and charging as many demands as possible are optimal, respectively. Finally, we investigate the proposed policies numerically. In this paper, a new optimization framework is proposed to coordinate the operation of large, price-maker, and geographically dispersed energy storage battery systems in a nodal transmission-constrained energy market. The energy storage units are assumed to be investor-owned and independently-operated, seeking to maximize their total profit. Various design factors are taken into consideration such as the location, size, efficiency, and charge and discharge rates of the energy storage units as well as the joint impact of the energy storage operations on the locational marginal prices. While the formulated optimization problem is originally nonlinear and hard to solve, nonlinearities are tackled both in the objective function and in the constraints and the problem is transformed into a tractable mixed-integer linear program, for which the global optimal solutions are found for the charge and discharge schedules of each energy storage unit. Both deterministic and stochastic design scenarios are addressed. Various case studies are presented. It is observed that transmission line congestion is often, but not always, desirable for the coordinated storage systems. Locational diversity, practice of arbitrage, robust design, self-scheduling versus economic bidding, and the overall power system performance are also investigated. We investigate performance limits of a multiple access communication system with energy harvesting nodes where the utility function is taken to be the long-term average sum-throughput. We assume a causal structure for energy arrivals and study the problem in the continuous time regime. For this setting, we first characterize a storage dam model that captures the dynamics of a battery with energy harvesting and variable transmission power. Using this model, we next establish an upper bound on the throughput problem as a function of battery capacity. We also formulate a nonlinear optimization problem to determine optimal achievable power policies for transmitters. Applying a calculus of variations technique, we then derive Euler-Lagrange equations as necessary conditions for optimum power policies in terms of a system of coupled partial integro-differential equations. Based on a Gauss-Seidel algorithm, we devise an iterative algorithm to solve these equations. We also propose a fixed-point algorithm for the symmetric multiple access setting in which the statistical descriptions of energy harvesters are identical. To further support our iterative algorithms, along with the analysis, comprehensive numerical results are also obtained. We study a processing system comprised of parallel queues, whose individual service rates are specified by a global service mode (configuration). The issue is how to switch the system between various possible service modes, so as to maximize its throughput and maintain stability under the most workload-intensive input traffic traces (arrival processes). Stability preserves the job inflow–outflow balance at each queue on the traffic traces. Two key families of service policies are shown to maximize throughput, under the mild condition that traffic traces have long-term average workload rates. In the first family of cone policies, the service mode is chosen based on the system backlog state belonging to a corresponding cone. Two distinct policy classes of that nature are investigated, MaxProduct and FastEmpty. In the second family of batch policies (BatchAdapt), jobs are collectively scheduled over adaptively chosen horizons, according to an asymptotically optimal, robust schedule. The issues of nonpreemptive job processing and non-negligible switching times between service modes are addressed. The analysis is extended to cover feed-forward networks of such processing systems nodes. The approach taken unifies and generalizes prior studies, by developing a general trace-based modeling framework (sample-path approach) for addressing the queueing stability problem. It treats the queueing structure as a deterministic dynamical system and analyzes directly its evolution trajectories. It does not require any probabilistic superstructure, which is typically used in previous approaches. Probability can be superposed later to address finer performance questions (e.g., delay). The throughput maximization problem is seen to be primarily of structural nature. The developed methodology appears to have broader applicability to other queueing systems.