Subway stations energy and air quality management

Similar documents
3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

Energy Storage and Renewables in New Jersey: Complementary Technologies for Reducing Our Carbon Footprint

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

An introduction to the theory of SDDP algorithm

ME425/525: Advanced Topics in Building Science

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

Simulating models with heterogeneous agents

Introduction D P. r = constant discount rate, g = Gordon Model (1962): constant dividend growth rate.

L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms

BU Macro BU Macro Fall 2008, Lecture 4

Probabilistic Robotics

Excel-Based Solution Method For The Optimal Policy Of The Hadley And Whittin s Exact Model With Arma Demand

Notes on Kalman Filtering

SZG Macro 2011 Lecture 3: Dynamic Programming. SZG macro 2011 lecture 3 1

arxiv: v1 [math.oc] 27 Jul 2009

Introduction to Mobile Robotics

Online Convex Optimization Example And Follow-The-Leader

1 Review of Zero-Sum Games

Application of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing

Lecture 20: Riccati Equations and Least Squares Feedback Control

Georey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract

Sequential Importance Resampling (SIR) Particle Filter

Lecture 1 Overview. course mechanics. outline & topics. what is a linear dynamical system? why study linear systems? some examples

Optimal Investment under Dynamic Risk Constraints and Partial Information

Speaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis

Particle Swarm Optimization

RL Lecture 7: Eligibility Traces. R. S. Sutton and A. G. Barto: Reinforcement Learning: An Introduction 1

Smoothing. Backward smoother: At any give T, replace the observation yt by a combination of observations at & before T

Lecture Notes 3: Quantitative Analysis in DSGE Models: New Keynesian Model

1. An introduction to dynamic optimization -- Optimal Control and Dynamic Programming AGEC

Particle Swarm Optimization Combining Diversification and Intensification for Nonlinear Integer Programming Problems

Recent Developments In Evolutionary Data Assimilation And Model Uncertainty Estimation For Hydrologic Forecasting Hamid Moradkhani

Bias in Conditional and Unconditional Fixed Effects Logit Estimation: a Correction * Tom Coupé

3.1 More on model selection

Modeling Economic Time Series with Stochastic Linear Difference Equations

Vehicle Arrival Models : Headway

1. Consider a pure-exchange economy with stochastic endowments. The state of the economy

Hydropower Economics: An Overview

Augmented Reality II - Kalman Filters - Gudrun Klinker May 25, 2004

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

CONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XI Control of Stochastic Systems - P.R. Kumar

Linear Gaussian State Space Models

Energy Storage Benchmark Problems

Lecture 3: Exponential Smoothing

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Competitive and Cooperative Inventory Policies in a Two-Stage Supply-Chain

Policy regimes Theory

SUPPLEMENTARY INFORMATION

Presentation Overview

Lecture 10 Estimating Nonlinear Regression Models

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Tutorial: A Unified Modeling and Algorithmic Framework for Optimization under Uncertainty

Online Appendix to Solution Methods for Models with Rare Disasters

Problem Set 5. Graduate Macro II, Spring 2017 The University of Notre Dame Professor Sims

Robust and Learning Control for Complex Systems

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

Announcements. Recap: Filtering. Recap: Reasoning Over Time. Example: State Representations for Robot Localization. Particle Filtering

Probabilistic Robotics SLAM

13.3 Term structure models

1. An introduction to dynamic optimization -- Optimal Control and Dynamic Programming AGEC

INTRODUCTION TO MACHINE LEARNING 3RD EDITION

Scheduling of Crude Oil Movements at Refinery Front-end

Short-Term Trading for a Wind Power Producer

STATE-SPACE MODELLING. A mass balance across the tank gives:

Examples of Dynamic Programming Problems

Economics 8105 Macroeconomic Theory Recitation 6

Probabilistic Robotics SLAM

Air Quality Index Prediction Using Error Back Propagation Algorithm and Improved Particle Swarm Optimization

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

An Optimal Dynamic Generation Scheduling for a Wind-Thermal Power System *

Tutorial: A Unified Framework for Optimization under Uncertainty

This document was generated at 1:04 PM, 09/10/13 Copyright 2013 Richard T. Woodward. 4. End points and transversality conditions AGEC

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems

Planning in POMDPs. Dominik Schoenberger Abstract

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.

Information Relaxations and Duality in Stochastic Dynamic Programs

Lecture 2 October ε-approximation of 2-player zero-sum games

Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach

Magnetic Field Synthesis in an Open-Boundary Region Exploiting Thévenin Equivalent Conditions

The Brock-Mirman Stochastic Growth Model

Robust estimation based on the first- and third-moment restrictions of the power transformation model

Air Traffic Forecast Empirical Research Based on the MCMC Method

Kriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds

Single-loop System Reliability-based Topology Optimization Accounting for Statistical Dependence between Limit-states

Inventory Control of Perishable Items in a Two-Echelon Supply Chain

5. Stochastic processes (1)

USP. Surplus-Production Models

A variational radial basis function approximation for diffusion processes.

Open loop vs Closed Loop. Example: Open Loop. Example: Feedforward Control. Advanced Control I

Lars Nesheim. 17 January Last lecture solved the consumer choice problem.

Osipenko Denis, Retail Risk Management, Raiffeisen Bank Aval JSC, Kiev, Ukraine. Credit Scoring and Credit Control XII conference August 24-26, 2011

Temporal probability models. Chapter 15, Sections 1 5 1

Global Optimization for Scheduling Refinery Crude Oil Operations

From Particles to Rigid Bodies

Chapter 14 Wiener Processes and Itô s Lemma. Options, Futures, and Other Derivatives, 9th Edition, Copyright John C. Hull

Stochastic optimal control of a domestic microgrid equipped with solar panel and battery

System of Linear Differential Equations

BOKDSGE: A DSGE Model for the Korean Economy

Homework 6 AERE331 Spring 2019 Due 4/24(W) Name Sec. 1 / 2

Transcription:

Subway saions energy and air qualiy managemen wih sochasic opimizaion Trisan Rigau 1,2,4, Advisors: P. Carpenier 3, J.-Ph. Chancelier 2, M. De Lara 2 EFFICACITY 1 CERMICS, ENPC 2 UMA, ENSTA 3 LISIS, IFSTTAR 4 June 6, 2016 Saions Opimal Managemen June 6, 2016 1 / 30

Opimizaion for subway saions Paris urban railway ranspor sysem energy consumpion = 1 subway saions + 2 racion sysem 3 3 Subway saions presen a signicanly high pariculae maers concenraion We use opimizaion o harves unexploied energy ressources and improve air qualiy. Saions Opimal Managemen June 6, 2016 2 / 30

Ouline 1 Subway saions opimal managemen problem Energy Air qualiy Energy/Air managemen sysem 2 Two mehods o solve he problem We are looking for a policy Dynamic programming in he non Markovian case Model Predicive Conrol 3 Numerical resuls Random variables modeling Mehods Resuls Saions Opimal Managemen June 6, 2016 3 / 30

Ouline 1 Subway saions opimal managemen problem Energy Air qualiy Energy/Air managemen sysem 2 Two mehods o solve he problem We are looking for a policy Dynamic programming in he non Markovian case Model Predicive Conrol 3 Numerical resuls Random variables modeling Mehods Resuls Saions Opimal Managemen June 6, 2016 3 / 30

Energy Saions Opimal Managemen June 6, 2016 3 / 30

Subway saions ypical energy consumpion Saions Opimal Managemen June 6, 2016 4 / 30

Subway saions have unexploied energy ressources Saions Opimal Managemen June 6, 2016 5 / 30

Energy recovery requires a buer Saions Opimal Managemen June 6, 2016 6 / 30

Air qualiy Saions Opimal Managemen June 6, 2016 6 / 30

Subways arrivals generae pariculae maers Rails/brakes wear and resuspension increase PM10 concenraion Recovering energy improves air qualiy Saions Opimal Managemen June 6, 2016 7 / 30

Energy/Air managemen sysem Saions Opimal Managemen June 6, 2016 7 / 30

Subway saion microgrid concep Saions Opimal Managemen June 6, 2016 8 / 30

Objecive: We wan o minimize energy consumpion and paricles concenraion A parameer λ measures he relaive weighs of he 2 objecives: T Cos (E Supply Saion + E Supply Baery ) +λ CP In =0 }{{}}{{} Grid supply PM10 We should conrol he sysem every 5 seconds Saions Opimal Managemen June 6, 2016 9 / 30

We conrol he baery Saions Opimal Managemen June 6, 2016 10 / 30

Energy sysem equaions Sae of charge dynamics: Soc +1 = Soc 1 U B + ρ c (U B+ ρ } dc {{} Discharge + E Surplus Train ) } {{ } Charge We have consrains on he baery level o ensure good ageing: Soc Min Soc Soc Max We ensure he supply/demand balance a saion and baery nodes: U B+ + E Surplus Train }{{} Charge ESaion Demand }{{} Saion consumpion = E Supply Baery }{{} Grid supply = E Supply Saion }{{} Grid supply + ETrain Recovered }{{} E Train Available E Train Excess + U B }{{} Discharge Saions Opimal Managemen June 6, 2016 11 / 30

We conrol he saion venilaions Saions Opimal Managemen June 6, 2016 12 / 30

Paricles concenraion dynamics In he indoor air and on he oor CP In In +1 =C + ρr P + d V Venil S C P Floor }{{} Resuspension Ou (CP C In P ) } {{ } In/Ou exchange ρd V C P In + Q P }{{}}{{} V Deposiion Generaion CP Floor +1 =C Floor P + ρd S C P In }{{} Deposiion ρr V C P Floor }{{} Resuspension Saions Opimal Managemen June 6, 2016 13 / 30

We have many uncerainies Le W he random variables vecor of uncerainies a ime : Regeneraive braking : ETrain Available Saion consumpion : ESaion Demand Cos of elecriciy : Cos Paricles generaion : Q P Resuspension rae : ρ R Deposiion rae : ρ D Oudoor paricles concenraion : CP Ou Saions Opimal Managemen June 6, 2016 14 / 30

Summary of he equaions Sae of he sysem: X = Conrols: U = And he dynamics: U B U B+ d Venil, Soc C In P CP Floor X +1 = f (X, U, W +1 ) We add he non-anicipaiviy consrains: U σ(w 1,..., W ) Saions Opimal Managemen June 6, 2016 15 / 30

We se a sochasic opimal conrol problem s. ( min E T Cos (E Supply U U Saion + E Supply Baery ) + λcp ) } In Objecive =0 Soc +1 = Soc 1 U B + ρ c (U B+ ρ dc C In P +1 = C In + ρr P + d V Venil Ou (CP C P In ) S C P Floor ρd V C P In + Q P V C Floor P U B+ = C Floor +1 P + ρd S C In + E Surplus Train = E Supply ESaion Demand = E Supply Saion + UB Soc Min Soc Soc Max C In P 0 P ρr } + E Surplus Train ) Baery dynamics V C P Floor Baery + ETrain Recovered Paricles dynamics } } Supply/demand balance Consrains Saions Opimal Managemen June 6, 2016 16 / 30

Compac sochasic opimal conrol problem We obained a sochasic opimizaion problem consisen wih he general form of a ime addiive cos sochasic opimal conrol problem: min E X,U ( T 1 ) L (X, U, W +1 ) + K(X T ) =0 s.. X +1 = f (X, U, W +1 ) U σ(x 0, W 1,..., W ) U U Saions Opimal Managemen June 6, 2016 17 / 30

Ouline 1 Subway saions opimal managemen problem Energy Air qualiy Energy/Air managemen sysem 2 Two mehods o solve he problem We are looking for a policy Dynamic programming in he non Markovian case Model Predicive Conrol 3 Numerical resuls Random variables modeling Mehods Resuls Saions Opimal Managemen June 6, 2016 17 / 30

We are looking for a policy Saions Opimal Managemen June 6, 2016 17 / 30

Wha is a soluion? In he general case an opimal soluion is a funcion of pas uncerainies: U σ(x 0, W 1,..., W ) U = π (X 0, W 1,..., W ) This is an hisory-dependen policy In he Markovian case (noises ime independence) i is enough o limi he search o sae feedbacks: U = π (X ) Saions Opimal Managemen June 6, 2016 18 / 30

Backward inducion: Sochasic Dynamic Programming In he Markovian case we inroduce he value funcions: ( T 1 ) x X, V (x) = min E L (X, π (X ), W π +1) + K(X T ) Algorihm s. = X = x and dynamics Oine: We compue he value funcions by backward inducion using Bellman equaion, knowing he nal cos: ( ) V (x) = min E L (x, u, W +1 ) + V +1 (f (x, u, W +1 )) u U Online: We compue he conrol a ime using he equaion: ( ) u arg min E L (x, u, W +1 ) + V +1 (f (x, u, W +1 )) u U Saions Opimal Managemen June 6, 2016 19 / 30

Dynamic programming in he non Markovian case Saions Opimal Managemen June 6, 2016 19 / 30

Dynamic programming in he general case Bellman equaion does no hold in he non Markovian case. Le P be he probabiliy s. (W ) [ 1,T ] are ime independen bu keep he same marginal laws. Algorihm Oine: We produce value funcions wih Bellman equaion using his probabiliy measure: ( ) Ṽ (x) = min u U E P L (x, u, W +1 ) + Ṽ +1 (f (x, u, W +1 )) Online: We plug he compued value funcions as fuure coss a ime : ( ) u arg min L u U E P (x, u, W +1 ) + Ṽ +1 (f (x, u, W +1 )) Saions Opimal Managemen June 6, 2016 20 / 30

Remarks Wih P he probabiliy updaing W +1 marginal law aking ino accoun all he pas informaions: i, W i = w i. I is a ool o produce hisory-dependen conrols. If he (W ) 1..T +1 are independen he conrols are opimal and P = P Sochasic Dynamic Programming suers he well known "curse of dimensionaliy". Saions Opimal Managemen June 6, 2016 21 / 30

Model Predicive Conrol Saions Opimal Managemen June 6, 2016 21 / 30

Rollou algorihms To avoid value funcions compuaion we can plug a lookahead fuure cos for a given policy: ( ) u arg min E L (x, u, W +1 ) + J+1(f π (x, u, W +1 )) u U I gives he cos of conrolling he sysem in he fuure according o he given policy: ( T 1 x X +1, J+1(x) π =E s. =+1 ) L (X, π (X ), W +1) + K(X T ) X +1 = x, and he dynamics Saions Opimal Managemen June 6, 2016 22 / 30

Model Predicive Conrol Choosing π in he class of open loop policies minimizing he expeced fuure cos: i + 1, u i R n, x, π i (x) = u i u arg min u U min (u +1,...,u T 1 ) E ( L (x, u, W +1 ) + T 1 =+1 ) L (X, u, W +1) Wih E replacing noises by forecass, we obain a deerminisic problem. Algorihm Online: A every MPC sep, compue a forecas ( w +1,..., w T +1 ) using he observaions i, W i = w i. Then compue conrol u : u arg min u U min L (x, u, w +1 ) + (u +1,...,u T 1 ) T 1 =+1 L (x, u, w +1) MPC is ofen dened wih a rolling horizon. Saions Opimal Managemen June 6, 2016 23 / 30

Ouline 1 Subway saions opimal managemen problem Energy Air qualiy Energy/Air managemen sysem 2 Two mehods o solve he problem We are looking for a policy Dynamic programming in he non Markovian case Model Predicive Conrol 3 Numerical resuls Random variables modeling Mehods Resuls Saions Opimal Managemen June 6, 2016 23 / 30

Random variables modeling Saions Opimal Managemen June 6, 2016 23 / 30

Some random variables are aken deerminisic Regeneraive braking : ETrain Available Saion consumpion : ESaion Demand Cos of elecriciy : Cos Paricles generaion : Q P Resuspension rae : ρ R Deposiion rae : ρ D Oudoor paricles concenraion : CP Ou Saions Opimal Managemen June 6, 2016 24 / 30

Sochasic models We have muliple equiprobable scenarios: Braking energy and ouside PM10 concenraion every 5s We deduce he discree marginal laws from hese scenarios. Saions Opimal Managemen June 6, 2016 25 / 30

Deails on he mehods Sochasic Dynamic Programming: We compue value funcions every 5s. We can compue a conrol every 5s. The algorihm is coded in Julia. Model Predicive Conrol: The deerminisic problem is linearized leading o a MILP. I is solved every 15 min wih a 2 hours horizon. We use wo forecass sraegies: MPC1: Expecaion of each noise ignoring he noises dependence MPC2: Scenarios where he nex ouside PM10 concenraion is no oo far from he previous one Saions Opimal Managemen June 6, 2016 26 / 30

Resuls Saions Opimal Managemen June 6, 2016 26 / 30

Air qualiy simulaion Saions Opimal Managemen June 6, 2016 27 / 30

Energy recovery lower peaks Saions Opimal Managemen June 6, 2016 28 / 30

Energeic resuls Assessor: 50 scenarios of 24h wih ime sep = 5 sec Reference: Energy consumpion cos over a day wihou baery and venilaion conrol MPC1 SDP Oine comp. ime 0 12h Online comp. ime [10s,200s] [0s,1s] Economic savings -26% -31% On jus one assessmen scenario for he momen: MPC1: -22.3% MPC2: -22.7% SDP: -26.8% Saions Opimal Managemen June 6, 2016 29 / 30

Conclusion & Ongoing work Our sudy leads o he following conclusions: A baery and a proper venilaion conrol provide signican economic savings SDP provides slighly beer resuls han MPC bu requires more oine compuaion ime We are now focusing on: Using oher mehods ha handle more sae/conrol variables Taking ino accoun more uncerainy sources Calibraing air qualiy models for a more realisic concenraion dynamics behavior Ulimae goal: apply our mehods o laboraory and real size demonsraors Saions Opimal Managemen June 6, 2016 30 / 30