Due to various green initiatives, renewable energy will be massively incorporated into the future smart grid. However, the intermittency of the renewables may result in power imbalance, thus adversely affecting the stability of a power system. Frequency regulation may be used to maintain the power balance at all times. As electric vehicles (EVs) become popular, they may be connected to the grid to form a vehicle-to-grid (V2G) system. An aggregation of EVs can be coordinated to provide frequency regulation services. However, V2G is a dynamic system where the participating EVs come and go independently. Thus, it is not easy to estimate the regulation capacities for V2G. In a preliminary study, we modeled an aggregation of EVs with a queueing network, whose structure allows us to estimate the capacities for regulation-up and regulation-down separately. The estimated capacities from the V2G system can be used for establishing a regulation contract between an aggregator and the grid operator, and facilitating a new business model for V2G. In this paper, we extend our previous development by designing a smart charging mechanism that can adapt to given characteristics of the EVs and make the performance of the actual system follow the analytical model.
The preliminary version of this work can be found in @cite_7 . In @cite_7 , we defined a queueing network model to estimate the RU and RD capacities. However, we assumed that there exists a smart charging mechanism which makes the service times at various queues exponentially distributed. This exponential distribution property is one of the keys to developing mathematically tractable closed-form solutions for the capacities. In this paper, we relax this assumption by explaining how such smart charging mechanism works. It allows the model to function even when the attributes of EVs are distributed in unknown distributions. We also perform simulation to verify the behavior of this mechanism when applied to various queues in the model.
@cite_7
2138114791 2047902637 2019834906 2136340918
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. This paper presents a spatial and temporal model of electric vehicle charging demand for a rapid charging station located near a highway exit. Most previous studies have assumed a fixed charging location and fixed charging time during the off-peak hours for anticipating electric vehicle charging demand. Some other studies have based on limited charging scenarios at typical locations instead of a mathematical model. Therefore, from a distribution system perspective, electric vehicle charging demand is still unidentified quantity which may vary by space and time. In this context, this study proposes a mathematical model of electric vehicle charging demand for a rapid charging station. The mathematical model is based on the fluid dynamic traffic model and the M M s queueing theory. Firstly, the arrival rate of discharged vehicles at a charging station is predicted by the fluid dynamic model. Then, charging demand is forecasted by the M M s queueing theory with the arrival rate of discharged vehicles. This mathematical model of charging demand may allow grid's distribution planners to anticipate a charging demand profile at a charging station. A numerical example shows that the proposed model is able to capture the spatial and temporal dynamics of charging demand in a highway charging station. This paper deals with the approximate analysis and application of an unreliable closed queueing network to model the performance of a flexible manufacturing system. The service stations in the network are subject to breakdown and repair when active. An exact equivalent network is represented with two-stage Coxian service stations. We approximate the equivalent network by assuming exponentiality for the service completion time, which has a two-stage Coxian distribution. We validate the approximation for a wide range of model parameters and demonstrate the robustness of queueing network formulae to the assumption of exponentiality. We consider the problem of resource allocation in downlink OFDMA systems for multi service and unknown environment. Due to users' mobility and intercell interference, the base station cannot predict neither the Signal to Noise Ratio (SNR) of each user in future time slots nor their probability distribution functions. In addition, the traffic is bursty in general with unknown arrival. The probability distribution functions of the SNR, channel state and traffic arrival density are then unknown. Achieving a multi service Quality of Service (QoS) while optimizing the performance of the system (e.g. total throughput) is a hard and interesting task since it depends on the unknown future traffic and SNR values. In this paper we solve this problem by modeling the multiuser queuing system as a discrete time linear dynamic system. We develop a robust H∞ controller to regulate the queues of different users. The queues and Packet Drop Rates (PDR) are controlled by proposing a minimum data rate according to the demanded service type of each user. The data rate vector proposed by the controller is then fed as a constraint to an instantaneous resource allocation framework. This instantaneous problem is formulated as a convex optimization problem for instantaneous subcarrier and power allocation decisions. Simulation results show small delays and better fairness among users.