Optimal Placement of Energy Storage in Power Networks Christos Thrampoulidis Subhonmesh Bose and Babak Hassibi Joint work with 52 nd IEEE CDC December.

Slides:



Advertisements
Similar presentations
Traffic Engineering with Forward Fault Correction (FFC)
Advertisements

Price Of Anarchy: Routing
Linear Programming Problem
1 Inventory Control for Systems with Multiple Echelons.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
Presented by: Hao Liang
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Lingwen Gan1, Na Li1, Ufuk Topcu2, Steven Low1
Javad Lavaei Department of Electrical Engineering Columbia University Various Techniques for Nonlinear Energy-Related Optimizations.
Applications of Stochastic Programming in the Energy Industry Chonawee Supatgiat Research Group Enron Corp. INFORMS Houston Chapter Meeting August 2, 2001.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Yashar Ganjali Computer Systems Laboratory Stanford University February 13, 2003 Optimal Routing in the Internet.
Adaptive Data Collection Strategies for Lifetime-Constrained Wireless Sensor Networks Xueyan Tang Jianliang Xu Sch. of Comput. Eng., Nanyang Technol. Univ.,
Competitive Routing in Multi-User Communication Networks Presentation By: Yuval Lifshitz In Seminar: Computational Issues in Game Theory (2002/3) By: Prof.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
Network Bandwidth Allocation (and Stability) In Three Acts.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Lecture 3. Notations and examples D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
Multipath Routing Algorithms for Congestion Minimization Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.
Smooth Priorities for Make-to-Stock Inventory Control Carlos F. G. Bispo Instituto de Sistemas e Robótica – Instituto Superior Técnico Technical Univ.
Yashar Ganjali High Performance Networking Group Stanford University September 17, 2003 Minimum-delay Routing.
1 A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas Chun Zhang *, Jim Kurose +, Yong Liu.
Javad Lavaei Department of Electrical Engineering Columbia University Optimization over Graph with Application to Power Systems.
Low-Rank Solution of Convex Relaxation for Optimal Power Flow Problem
Preliminary Analysis of the SEE Future Infrastructure Development Plan and REM Benefits.
Javad Lavaei Department of Electrical Engineering Columbia University Joint work with Somayeh Sojoudi Convexification of Optimal Power Flow Problem by.
1 Least Cost System Operation: Economic Dispatch 2 Smith College, EGR 325 March 10, 2006.
THE TRES AMIGAS SUPERSTATION Southwest Renewable Energy Conference Santa Fe, NMSeptember 16 th 2010 UNITING THE NATION’S ELECTRIC POWER GRID.
21 st May 2015 SMARTGREENS 2015 Lisbon, Portugal Lane Department of Computer Science and Electrical Engineering West Virginia University Analyzing Multi-Microgrid.
Resource Allocation for E-healthcare Applications
MobSched: An Optimizable Scheduler for Mobile Cloud Computing S. SindiaS. GaoB. Black A.LimV. D. AgrawalP. Agrawal Auburn University, Auburn, AL 45 th.
Advanced Energy Management in Cloud Computing multi data center environments Giuliana Carello, DEI, Politecnico di Milano Danilo.
Optimization for Operation of Power Systems with Performance Guarantee
1 Chapter-4: Network Flow Modeling & Optimization Deep Medhi and Karthik Ramasamy August © D. Medhi & K. Ramasamy, 2007.
THE USES AND MISUSES OF OPF IN CONGESTION MANAGEMENT
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
1 A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas Chun Zhang *, Jim Kurose +, Yong Liu.
Load Flow Study using Tellegen’s Theorem. Load Flow – The load-flow study is an important tool involving numerical analysis applied to a power system.
15.082J and 6.855J and ESD.78J Lagrangian Relaxation 2 Applications Algorithms Theory.
1 A Simple Asymptotically Optimal Energy Allocation and Routing Scheme in Rechargeable Sensor Networks Shengbo Chen, Prasun Sinha, Ness Shroff, Changhee.
Market Evolution Program Day Ahead Market Project How the DSO Calculates Nodal Prices DAMWG October 20, 2003.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
Chapter 1. Formulations 1. Integer Programming  Mixed Integer Optimization Problem (or (Linear) Mixed Integer Program, MIP) min c’x + d’y Ax +
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
Appointment Systems - a Stochastic and Fluid Approach Michal Penn The William Davidson Faculty of Industrial Engineering and Management Technion - Israel.
Javad Lavaei Department of Electrical Engineering Columbia University Convex Relaxation for Polynomial Optimization: Application to Power Systems and Decentralized.
Ramping and Demand Shifting: A Case Study Tim Mount Dyson School of Applied Economics and Management Cornell University Demand Response.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Network Congestion Games
Presenter : Kuang-Jui Hsu Date : 2011/3/24(Thur.).
1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Optimal Power Flow- Basic Requirements For Real Life.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
Stochastic Optimization
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming  A Linear Programming model seeks to maximize or minimize a linear function, subject.
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
Asymptotic Analysis for Large Scale Dynamic Stochastic Games Sachin Adlakha, Ramesh Johari, Gabriel Weintraub and Andrea Goldsmith DARPA ITMANET Meeting.
1 EL736 Communications Networks II: Design and Algorithms Class4: Network Design Modeling (II) Yong Liu 10/03/2007.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
| Vasilis Zois USC 1. |  Dynamic and sophisticated demand control – Direct control over household appliances  Curtailment Reasons – Reactive Curtailment.
Chapter 7 Linear Programming
Analytics and OR DP- summary.
ISP and Egress Path Selection for Multihomed Networks
Contingency-Constrained PMU Placement in Power Networks
Impact of Wind Farms Aggregation on Large System Scheduling Cost Under Frequency Linked Deviation Settlement Mechanism Presented by Anoop Singh Authored.
Arslan Ahmad Bashir Student No
Chapter 1. Formulations.
Presentation transcript:

Optimal Placement of Energy Storage in Power Networks Christos Thrampoulidis Subhonmesh Bose and Babak Hassibi Joint work with 52 nd IEEE CDC December 13, 2013

Use of energy storage  Fast time scales (seconds, minutes) :Balance intermittency Compensate for supply shortfall Uncertain renewable generation  Slow time scales (hours) : Load Shifting reduce cost of conventional generation minimize (convex) cost of generation 1

Two questions on storage (2) Where to place, how to size ? (1) Optimal control policy? Previous work: [Chandy10],[Kotsopoulos11], [Zhang11], [Gayme12], [Su13]... assume storage resources at each node known a priori. (1) + (2) Common Framework Previous work: [Denholm09], [Kraning10], [Harsha13]... mainly sizing, purely economic arguments, specific networks. Previous work: [Sjodin12], [Bose12], [Gayme12] only simulation results so far. This work: Find structural properties… 2

The optimization framework  Slow time scales (Load Shifting)  Common Optimization Framework: Placement + Control given storage budget, demand profiles find how to place storage devices + how to control minimize cost of generation subject to network constraints, storage device and generator dynamics 3

Optimization solves for optimal allocation Storage budget 4

Any structural properties? Can we say something about placement of storage before solving the optimization problem ? ? ? ? ? ? ? ? ? ? demand profile ? line-flow limit ? generator characteristics ? storage device characteristics ? 5

Model features 1.neglect reactive power 2.voltage magnitudes at nominal values 3.voltage phase angle differences small - Demand: known, periodic  finite-Horizon - Storage: finite capacity, ramp rates, losses - Generators: finite capacity, convex non-decreasing cost - Network:linearized DC approximation, line-flow limits ? ? 6

A structural property Theorem 1 There always exists optimal storage allocation which assigns zero storage at generator nodes with single-link connections. Robustness of the result: Holds for arbitrary demand profiles and other network parameters

Theorem: Proof idea There exists optimal solution such that Lemma: NO storage at generator 8

Generators with multiple connections? 5 Storage budget May not always have zero storage capacity at optimal. Example: A solution: 2.5 less “flat” not optimal 0 Forcing zero storage at generator: 9

The star network ? Theorem 2 There exists an optimal storage allocation which assigns zero storage at the generator node of a star network when the storage budget is: a) equal to the minimum possible to allow serving the loads, b) big enough. 10

Summary & future work ? better understanding of generators with multiple connections, role of congested lines. ? cost benefit analysis, performance metrics other than cost of generation. ? fast-time scales, stochastic framework. Thank You! Formulated joint investment decision and control problem. Identified preliminary structural property of the problem: NO storage at generators with single links.  Potential to exploit structure of the placement problem. Related recent work: [Castillo&Gayme13] 11

12

The Model Finite-time Horizon: Available storage budget: 13

Proof of the Lemma (I) There exists optimal solution such that Lemma: 14

Proof of the Lemma (II) There exists optimal solution such that Lemma: 15

Proof of the Lemma (III) There exists optimal solution such that Lemma: 16

Extensions + Proof of Theorem II Same proof technique generalizes to incorporate losses and rate ramp constraints. Proof of Theorem II (Star Network) Similar idea. Some more work to show that any storage of the generator node, can be distributed in a feasible way among load buses. 17

18

19

The Model Finite-time Horizon: Line-flow constraints: Power Balance: Available storage budget: Storage Device constraints: Generation constraints: 20

Model Features - Demand profiles: known, periodic => Finite-Horizon - Storage Units: finite capacity, ramp rates, losses - Generators: finite capacity, convex non-decreasing cost - Linearized DC approximation, finite line-flow capacities 1,3,7,6,5,4 Zero storage at generator Non-zero storage at generator Cost of generation Model Features - Demand profiles: known, periodic  Finite-Horizon (storage level same at the end) - Storage Units: finite capacity, ramp rates, losses - Generators: finite capacity, convex non-decreasing cost - Network: Linearized DC approximation, finite line-flow capacities 21