Presented by: Anna Scaglione University of California Davis

Slides:



Advertisements
Similar presentations
Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.
Advertisements

CS433: Modeling and Simulation
Authors: J.A. Hausman, M. Kinnucan, and D. McFadden Presented by: Jared Hayden.
Data Mining Methodology 1. Why have a Methodology  Don’t want to learn things that aren’t true May not represent any underlying reality ○ Spurious correlation.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
Continuous Probability Distributions
Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.
CF-3 Bank Hapoalim Jun-2001 Zvi Wiener Computational Finance.
Simple Linear Regression
Discrete Event Simulation How to generate RV according to a specified distribution? geometric Poisson etc. Example of a DEVS: repair problem.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
1 Simple Linear Regression Chapter Introduction In this chapter we examine the relationship among interval variables via a mathematical equation.
Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:
Lecture 17 Interaction Plots Simple Linear Regression (Chapter ) Homework 4 due Friday. JMP instructions for question are actually for.
The one sample t-test November 14, From Z to t… In a Z test, you compare your sample to a known population, with a known mean and standard deviation.
Cmpt-225 Simulation. Application: Simulation Simulation  A technique for modeling the behavior of both natural and human-made systems  Goal Generate.
Lecture II-2: Probability Review
Simple Linear Regression. Introduction In Chapters 17 to 19, we examine the relationship between interval variables via a mathematical equation. The motivation.
Monté Carlo Simulation MGS 3100 – Chapter 9. Simulation Defined A computer-based model used to run experiments on a real system.  Typically done on a.
Hydrologic Statistics
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.
Inference for regression - Simple linear regression
Economy and calculations If 4 million households are provided with smart power cells, the total price of generators, all equipment and software will be.
An importer of Herbs and Spices claims that average weight of packets of Saffron is 20 grams. However packets are actually filled to an average weight,
Hypothesis Testing in Linear Regression Analysis
Copyright © 2012 Pearson Education. All rights reserved Copyright © 2012 Pearson Education. All rights reserved. Chapter 15 Inference for Counts:
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
1 Validation & Verification Chapter VALIDATION & VERIFICATION Very Difficult Very Important Conceptually distinct, but performed simultaneously.
AN INTRODUCTION TO THE OPERATIONAL ANALYSIS OF QUEUING NETWORK MODELS Peter J. Denning, Jeffrey P. Buzen, The Operational Analysis of Queueing Network.
Simulation Examples ~ By Hand ~ Using Excel
1 Least squares procedure Inference for least squares lines Simple Linear Regression.
Chapter 4 – Modeling Basic Operations and Inputs  Structural modeling: what we’ve done so far ◦ Logical aspects – entities, resources, paths, etc. 
Statistical Review We will be working with two types of probability distributions: Discrete distributions –If the random variable of interest can take.
1 Statistical Distribution Fitting Dr. Jason Merrick.
Discrete Distributions The values generated for a random variable must be from a finite distinct set of individual values. For example, based on past observations,
Measuring the Effect of Waiting Time on Customer Purchases Andrés Musalem Duke University Joint work with Marcelo Olivares, Yina Lu (Decisions Risk and.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 24 Simulation.
Measuring the Effect of Queues on Customer Purchases Andrés Musalem Duke University Joint work with Marcelo Olivares, Yina Lu (Decisions Risk and Operations,
Chapter 10 Verification and Validation of Simulation Models
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 25 Simulation.
Simulation is the process of studying the behavior of a real system by using a model that replicates the system under different scenarios. A simulation.
Outline The role of information What is information? Different types of information Controlling information.
"Classical" Inference. Two simple inference scenarios Question 1: Are we in world A or world B?
Random Variable The outcome of an experiment need not be a number, for example, the outcome when a coin is tossed can be 'heads' or 'tails'. However, we.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Learning Simio Chapter 10 Analyzing Input Data
Chapter 8: Simple Linear Regression Yang Zhenlin.
Expected values of discrete Random Variables. The function that maps S into S X in R and which is denoted by X(.) is called a random variable. The name.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Chapter 1 Introduction to Statistics. Section 1.1 Fundamental Statistical Concepts.
Uncertainty and Reliability Analysis D Nagesh Kumar, IISc Water Resources Planning and Management: M6L2 Stochastic Optimization.
1 Ardavan Asef-Vaziri Jan.-2016Basics Probability Distributions- Uniform.
CPH Dr. Charnigo Chap. 11 Notes Figure 11.2 provides a diagram which shows, at a glance, what a neural network does. Inputs X 1, X 2,.., X P are.
Modeling the Optimization of a Toll Booth Plaza By Liam Connell, Erin Hoover and Zach Schutzman Figure 1. Plot of k values and outputs from Erlang’s Formula.
Chapter Nine Hypothesis Testing.
Computer Simulation Henry C. Co Technology and Operations Management,
OPERATING SYSTEMS CS 3502 Fall 2017
Linear Regression.
Models of Traffic Flow 1.
System Control based Renewable Energy Resources in Smart Grid Consumer
Chapter 10 Verification and Validation of Simulation Models
Delays Deterministic Stochastic Assumes “error free” type case
System Performance: Queuing
Discrete Event Simulation - 4
Examining Power Grids Response to PHEVs Charging Demand
Delays Deterministic Stochastic Assumes “error free” type case
Lecture 7 Sampling and Sampling Distributions
Verification and Validation of Simulation Models
Presentation transcript:

Stochastic Models and Architecture for Predicting and Scheduling Electric Vehicle Charging Demand Presented by: Anna Scaglione University of California Davis Coauthors: Mahnoosh Alizadeh, Jamie Davis, Kenneth Kurani, Bob Thomas (Cornell) 32nd CNLS Annual Conference, Santa Fe, NM

Electric Vehicles: The promise of a gasoline-free future The number of electric vehicles (PHEV or EV) is expected to rise considerably during the next two decades Need: Stochastic models of what we can schedule California rules give push to 'green' vehicles in the near future Green Jobs: The Future of the Plug In Electric Vehicle Market Is Looking Bright Electric Car Greener Alternative to Gas- Powered Vehicles Stackable Robot Cars: The Future of Green Mass Transit 32nd CNLS Annual Conference, Santa Fe, NM

From “Watts” to “Jobs” Generators $$$  Load following Arrivals  Load injection Service = (Charging) Generators $$$  Load following Arrivals  Jobs Service requests Scheduled Service  follow generation Generators $  Load following $ Renewables 32nd CNLS Annual Conference, Santa Fe, NM

Overview of the talk Background Part 1: A new stochastic model for EV and PHEV charging demand Model tuned on real data for PHEV Test: Smart Load Forecasting capability of model Communication protocol for submetering Part 2: Digital Direct Load Scheduling: scheduling of EVs for minimum average delay Numerical experiments on DDLS Market integration of EVs as deferrable load 32nd CNLS Annual Conference, Santa Fe, NM

Part 1: a scalable mathematical model for uncontrolled EV charging demand 32nd CNLS Annual Conference, Santa Fe, NM

Some previous work Focus: grid impact of a large-scale integration of EVs See e.g., [Green et al, 2011]’s review, [Wu, Aliprantis and Gkritza, 2011], [Taylor et al., 2009], [Clement-Nyns et al.,2010]… Method: Traces of car travel data are used to create an ensemble of “realistic” charges and load injections derive statistical features (e.g., mean and variance) of EV charging demand based on their proposed arrival and charge pattern Not an analytical stochastic model for the charging demand useful to assess if “schedulable” 32nd CNLS Annual Conference, Santa Fe, NM

Parameters in our model Load injections of each car is ≈ rectangular The rate Ri of charge is height, charge time Si is width N(t): number of cars present in the system Si: service time for cars present in the system tia: arrival time of car What we model: (tia,Si,Ri, χia) = (arrival time, charge duration, rate) + laxity (slack time or max delay to schedule) 32nd CNLS Annual Conference, Santa Fe, NM

Basic idea and more related work Queueing theory can be used to capture N(t) [Li and Zhang, 2012]  M/M/c and M/M/c/k/N [Vlachogiannis 2009]  M/M/∞ [Garcia-Valle and Vlachogiannis, 2009]  M/M/∞ [Alizadeh, Scaglione and Wang,2010] M/M/c or M/M/∞ queues  fail to capture the temporal variations in the arrival rate and the lognormal distribution of the charge duration Arrival rates are constant – service times are exponentially distributed 32nd CNLS Annual Conference, Santa Fe, NM

for a specific charging level Our model A set of Mt/GIt/∞ queues – each queue models demand from either EVs or PHEVs and for a specific charging level ∞ Servers  once plugged the device is ON = served The total EV charging demand = Σ of demand from queues Demand from each queue = (the number of customers receiving service from queue) × (the charging power) 32nd CNLS Annual Conference, Santa Fe, NM

Why using a queuing model? Important result for a Mt/GIt/∞ system (Proved by Palm and Khinchin) The number of customers receiving service at t = N(t) If we initialize the system at t= -∞, N(t) is Poisson distributed with mean Sc is the stationary-excess service time with 32nd CNLS Annual Conference, Santa Fe, NM

New aspects of our model Arrival rates are non-homogenous with rate λ(t) random process itself (Periodic ARMA process) Each arrival has a random quadruplet: (tia,Si,Ri, χia) = (arrival time, charge duration, rate) + laxity (slack time) Separate arrivals at different rates R into different queues Unscheduled load Set of all possible rates 32nd CNLS Annual Conference, Santa Fe, NM

Model elements for each queue Not going to fit the Probability Mass Function (PMF) of the charging rate Ri We use the data to fit: Mt  Arrivals follow a time-dependent Poisson process Non-homogeneous random arrival rate λ(t) We will show that the Poisson model fits the real data We will provide a tunable stochastic model for λ(t) itself Each arrival  duration of charge S Cumulative Distribution Function (CDF) FS(s; t) We will show an appropriate CDF 32nd CNLS Annual Conference, Santa Fe, NM

Data used – ICEV and PHEVs Only look at home-based charging 620 real samples of PHEV - UC Davis PH&EV center 107 mileage entries - National Household Travel Survey in 2009 – Customers drive ICEVs To convert miles to charge Customer plug in their car with a probability Pplug(M) If they plug in : Miles  Charge Conversion Charge duration = min { max charge duration, energy per mile × traveled miles /rate, the amount of time parked} 32nd CNLS Annual Conference, Santa Fe, NM

Estimating the probability of plugging in Data on travelled miles M from NHTS Real charging data from UC Davis We estimate Pplug(M) so that the charge distribution derived from NHTS matches the real-world data For PHEVs: Can be easily extended to EVs ( we don’t have data) 32nd CNLS Annual Conference, Santa Fe, NM

PDF of charge duration for PHEVs Assumption: Vehicle type Kwh/mile (uniform) Sedans 0.18-0.3 Vans 0.3-0.4 SUVs 0.4-0.5 Trucks 0.5-0.7 Remark! The miles to charge conversion without Pplug produces a very different PDF 32nd CNLS Annual Conference, Santa Fe, NM

Distribution fitting We found that a lognormal distribution with μ = 5.03 and σ = 0.78 best fits the data Further improvement: clipped lognormal at ≈ 350 minutes 32nd CNLS Annual Conference, Santa Fe, NM

Laxity of PHEV charging requests Time between arrival and departure – charge duration Two distinct peaks Daytime slack times are shorter Night hours 32nd CNLS Annual Conference, Santa Fe, NM

Different degrees of flexibility We separated daytime and nighttime charging events in the UC Davis charging data to verify Fits: Daytime: Exp(1.08) Nighttime: lnN(2.25,0.42) 32nd CNLS Annual Conference, Santa Fe, NM

Modeling arrivals: is Poisson reasonable? We cannot prove it We construct a test of null hypothesis based on the 2009 National Household Travel Survey (NHTS) data Null hypothesis: arrivals follow a Poisson process with a piecewise constant rate (30 min intervals) Standard test of uniformity: one sample Kolmogorov- Smirnov test The null hypothesis is never rejected from NHTS data 32nd CNLS Annual Conference, Santa Fe, NM

Quantile-Quantile plot Q-Q plot comparing conditionally normalized EV arrival times between 13:30-14:00 on a Monday to U(0,1) 32nd CNLS Annual Conference, Santa Fe, NM

Modeling and forecasting λ(t) λ(t) ≈ piecewise constant between samples The rate profiles are unobservable  count profiles c(t) We consider vectors of count profiles cj for each day j Since the variance of a Poisson RV varies with its mean  we apply a variance-stabilizing transformation  a slightly modified version of the Anscombe square-root transform We store the count profiles of N days in a matrix C 32nd CNLS Annual Conference, Santa Fe, NM

Forecasting future arrival rates from historical data stored in C C has very large dimensions  Multivariate time series may not be the best way for forecasting We apply an SVD  UTCV = Σ The j-th column of the count matrix C, cj can be approximated via K principal components Since V is orthogonal  (αi(1), αi(2), αi(N))’s orthogonal to each other for different i’s  Reasonable to apply univariate time series to each  train a Periodic ARMA model for each (αi(1), αi(2), αi(N)) produces predictions of λ(t) 32nd CNLS Annual Conference, Santa Fe, NM

Principal component analysis We found that the first 6 principal components account for 96% of the variance in the NHTS database Weekends variations The most significant pc (weekday variations) NHTS arrivals seem different from PHEV arrivals Need more data 32nd CNLS Annual Conference, Santa Fe, NM

Smart load forecasting using AMI In reality, the system is not initialized at N(t0) customers are present in the system at time t0 If they inform the forecast unit of charge duration upon arrival Smart forecast for t> t0 : Lower forecast error Stochastic term: customers arriving after t> t0 , Poisson distributed Deterministic term: customers that were present at t0 32nd CNLS Annual Conference, Santa Fe, NM

Numerical Experiment: Normalized MSE of half-hour ahead prediction A substation serving a base load of 400 kWs (without vehicles) 400 PHEVS Arrivals based on NHTS Charging durations randomly generated from the clipped lognormal Classical aggregate load predictor: ARMA The classical predictor is applied in one scenario to the base load and in the other to the total load 32nd CNLS Annual Conference, Santa Fe, NM

Part 2: Digital Direct Load Scheduling 32nd CNLS Annual Conference, Santa Fe, NM

Scheduling departures Many methods in the literature for EV scheduling… Our idea: quantize energy requests to bundle the associated transactions into queues Arrival and Departure processes aq(k) dq(k) Each Mt/GIt/∞ queue is mapped into Q distinct Mt/D/∞ queues

AD conversion: Watts  Jobs Each arrival (tia,Si) - for simplicity only one rate Digital signature Quantize into codes Quantize time, record the # of loads arriving with a certain code Load Synthesis Arrivals in a specific load class

Queuing model to schedule the load Decide a departure processes dq(t) from each queue Model complexity depends on Q not on actual number of EV 2 hour charge 3 hour charge 4 hour charge 32nd CNLS Annual Conference, Santa Fe, NM

Mathematical Description Average charging power of these set of queues First Difference Operator Convolution We can use this synthesis formula to model or design a scheduler that makes scheduling decisions on departures at every epoch  dq(l0) 32nd CNLS Annual Conference, Santa Fe, NM

EV/PHEV model for the wholesale market In most present work: demand from deferrable loads = filling a tank by a deadline see [Lambert et. al, 2006] and [Lamadrid et. al, 2011] DDLS is a concrete yet simple enough mapping between individual energy requests and aggregate load The model predicts the aggregate flexibility offered by a populations of EVs in the wholesale market

DDLS online scheduling by an aggregator DDLS avoids the curse of dimensionality of taking individual appliance deadlines into account Low telemetry and complexity cost Instead of hard deadlines we use average QoS level This is one case where the analogy with the Internet works

Objective and Costs Cost of deviation from most economic power profile (power purchased on the day ahead B + locally owned renewables R + load we cannot schedule LT) Inconvenience cost (experienced by the community, not individuals) queues weighted differently (different QoS)

Real-time Scheduling: Model Predictive Control A sequential decision maker that determines the schedules for the EVs over a sliding finite horizon (N∆) Objective: minimize increment in accumulated cost over horizon Uncertainty: arrival of smart loads, traditional load, renewables, price The scheduler has: Predictions of local marginal prices (LMP) for deviating from the day ahead bid at the particular load injection bus The statistics of both smart and traditional loads Predictions of available local (green) generation Output: a decision matrix with N-1 dummy decision vectors to account for the future

Mathematical formulation ? 05:07:36 Schedule decisions: Model Predictive Day ahead bid Renewable Power cost Delay cost Example of typical cost :

Linear Programming Approximation Certainty Equivalent Controller for time  LP Where:

Numerical Results 18k Electric Vehicles 0 ≤ Charge time ≤ 8 hours Optimization is run every 15 minutes Charge code quantization step = 15 minutes Arrival process is Poisson with constant rate λ =3 arrivals/each 15 minutes for each queue (32 queues) Solver: Certainty equivalent controller that uses LP to schedule the Electric Vehicles Look-ahead horizon = 8 hours For fairness, the number of scheduled appliances is equal in the two profiles and no arriving appliances is delayed beyond t = 50 h

Conclusions We presented a mathematical model for uncontrolled EV charging demand useful for scalable simulation, telemetry and forecasting Parameters of the model were optimized based on actual customer behavior Based on this model, we presented a best-effort scheduling scheme that can be used to exploit the aggregate flexibility offered by EV charging demand to opportunistically use renewables 32nd CNLS Annual Conference, Santa Fe, NM

Thank you Any questions? 32nd CNLS Annual Conference, Santa Fe, NM