Reac%ve power pricing strategy

Similar documents
Programs of Regione Campania for reduction of seismic risk (and others)

1 st results of the MICROSCOPE test of the equivalence principle in space. Manuel RODRIGUES

5-7 Solving Quadratic Inequalities. Holt Algebra 2

Nucleosintesi oltre il picco del Fe. Misure di ca3ura neutronica di interesse Astrofisico

A gossip-like distributed optimization algorithm for reactive power flow control

Convex Optimization & Lagrange Duality

Constrained Optimization and Lagrangian Duality

Detection of Antimatter in our Galaxy

arxiv: v2 [math.oc] 17 Nov 2014


Interpretation of the X(3872) as a charmonium state plus an extra component due to the coupling to the meson- meson continuum

Worked Examples for Chapter 5

Mathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7

CSE546: SVMs, Dual Formula5on, and Kernels Winter 2012

Lagrange duality. The Lagrangian. We consider an optimization program of the form

Algorithms for NLP. Classifica(on III. Taylor Berg- Kirkpatrick CMU Slides: Dan Klein UC Berkeley

Intermediate Algebra. 7.6 Quadratic Inequalities. Name. Problem Set 7.6 Solutions to Every Odd-Numbered Problem. Date

Architectures and Algorithms for Distributed Generation Control of Inertia-Less AC Microgrids

Optimality Conditions

Elaborazione delle Immagini Informazione multimediale - Immagini. Raffaella Lanzarotti

Nonlinear Programming and the Kuhn-Tucker Conditions

Chapter 3. Loop and Cut-set Analysis

3.10 Lagrangian relaxation

1. Introduction. 2. Outlines

SECTION 5.1: Polynomials

Distributed quasi-newton method and its application to the optimal reactive power flow problem

Lecture 3: Lagrangian duality and algorithms for the Lagrangian dual problem

Nonlinear Programming (Hillier, Lieberman Chapter 13) CHEM-E7155 Production Planning and Control

Introduc on to Choosing a Kriging Plan

Scalable Compu-ng Challenges in Ensemble Data Assimila-on. FRCRC Symposium Nancy Collins NCAR - IMAGe/DAReS 14 Aug 2013

Energy System Modelling Summer Semester 2018, Lecture 7

Fall 2017 Qualifier Exam: OPTIMIZATION. September 18, 2017

Support Vector Machines for Regression

Constrained optimization

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 18

Part IB Optimisation

Math-2A Lesson 13-3 (Analyzing Functions, Systems of Equations and Inequalities) Which functions are symmetric about the y-axis?

The Fundamental Welfare Theorems

Bioelectrical Circuits: Lecture 9

Routing. Topics: 6.976/ESD.937 1

Optimization Theory. Lectures 4-6

QUESTION BANK SUBJECT: NETWORK ANALYSIS (10ES34)

Topics we covered. Machine Learning. Statistics. Optimization. Systems! Basics of probability Tail bounds Density Estimation Exponential Families

arxiv: v3 [math.oc] 2 Oct 2012

Congestion Management in a Smart Grid via Shadow Prices

By drawing Mohr s circle, the stress transformation in 2-D can be done graphically. + σ x σ y. cos 2θ + τ xy sin 2θ, (1) sin 2θ + τ xy cos 2θ.

Max Margin-Classifier

Quadratic function and equations Quadratic function/equations, supply, demand, market equilibrium

Experiment 1: Linear Regression

SIGNIFICANT increase in amount of private distributed

Convex Optimization and Support Vector Machine

Support Vector Machines

A Market Mechanism for Electric Distribution Networks

Fall 2011 ME 2305 Network Analysis. Sinusoidal Steady State Analysis of RLC Circuits

SVMs, Duality and the Kernel Trick

Workshop I The R n Vector Space. Linear Combinations

Convex Optimization. Ofer Meshi. Lecture 6: Lower Bounds Constrained Optimization

4.1 Solving Systems of Equations Graphically. Draw pictures to represent the possible number of solutions that a linear-quadratic system can have:

Quadratic function - Test Yourself

Lesson 9 Exploring Graphs of Quadratic Functions

Dual Decomposition.

DLM: Decentralized Linearized Alternating Direction Method of Multipliers

Chapter 7. Optimization and Minimum Principles. 7.1 Two Fundamental Examples. Least Squares

Linear Programming Duality

Machine Learning And Applications: Supervised Learning-SVM

The Fundamental Welfare Theorems

The Lagrangian L : R d R m R r R is an (easier to optimize) lower bound on the original problem:

2.098/6.255/ Optimization Methods Practice True/False Questions

Motivation. Lecture 2 Topics from Optimization and Duality. network utility maximization (NUM) problem:

Support Vector Machines, Kernel SVM

The System's Limitations Costs Determination Using the Duality Concept of Linear Programming

The Envelope Theorem

Lesson 25 Solving Linear Trigonometric Equations

Subject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)

ENGR 2405 Chapter 8. Second Order Circuits

Support Vector Machines

Contents Economic dispatch of thermal units

LESSON 13.1 NONLINEAR EQUATIONS

Seismologia ja maan rakenne A Seismology and structure of the Earth

CHAPTER 1 QUADRATIC FUNCTIONS AND FACTORING

Bellman s Curse of Dimensionality

4. Duality Duality 4.1 Duality of LPs and the duality theorem. min c T x x R n, c R n. s.t. ai Tx = b i i M a i R n

Sinusoidal Steady State Analysis (AC Analysis) Part II

Lecture Notes on Support Vector Machine

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

Linear & nonlinear classifiers

Algebra 1 Practice Test

Support Vector Machine (SVM) and Kernel Methods

Support Vector Machines: Maximum Margin Classifiers

Support Vector Machine (SVM) and Kernel Methods

COMP 562: Introduction to Machine Learning

Kernel Machines. Pradeep Ravikumar Co-instructor: Manuela Veloso. Machine Learning

Lecture 7 Rolling Constraints

Karush-Kuhn-Tucker Conditions. Lecturer: Ryan Tibshirani Convex Optimization /36-725

CS-E4830 Kernel Methods in Machine Learning

Linear & nonlinear classifiers

Course Notes for EE227C (Spring 2018): Convex Optimization and Approximation

Convex Optimization. Newton s method. ENSAE: Optimisation 1/44

Linear Programming Duality P&S Chapter 3 Last Revised Nov 1, 2004

Unit 9: Quadratics Intercept Form

Transcription:

Department of Informa-on Engineering University of Padova, ITALY Reac%ve power pricing strategy Giulia Maso, Mar-no Minella, Anna Polidoro

Smart Grids Outline Model Reac-ve power compensa-on Pricing Tools Lagrange mul-pliers (centralized) Gradient es-ma-on (distributed) Pricing Strategy Shadow prices Storage strategy

Smart grids

Smart grids

Smart grids Model 0 0 generator s loads PCC directed graph G = ( V, E,σ,τ ) matrix of incidence A voltages and currents y( t) = y 2 sin( ω0t + y)

Ini$al model equa$ons (KLC) and (KVL) laws Α T Αu ξ + i = 0 + Ζξ = PCC u 0 = U 0 0 generic node u v i v = s v u U v Smart grids Model 0 η constant voltage generator v, v V exponen-al model \{0}

Approximate model(1) Laplacian matrix, L = Α T Ζ 1 Α Green matrix, X sa-sfying: XL = I 11 X10 = 0 T 0 Solu-on for the currents: i = Lu

Approximate model(2) The system can be rewrioen in the following form: u u 1 v T = i i v Xi = = 0 + U s v u U 0 v 1 0 η v, v V \{0}

Smart grids Compensa;on Reac$ve power flows contribute to: power losses on the lines voltage drop grid instability Problem of op-mal reac-ve power compensa-on Bolognani, S., and Zampieri, S. (2011) Distributed control strategy for op-mal reac-ve power compensa-on in smart microgrids.

J ' = i T Smart grids Compensa;on 1 T 1 T 1 ~ Re( x) i = p Re( x) p + q Re( x) q + J 2 2 2 0 U U U 0 where it has been used the Taylor approxima-on of 0 ( ) U 0 0 ( U, s) U i for large 0 Being ~ J, ( U s) 0 infinitesimal, we have an uncoupling phenomenon QUADRATIC LINEARLY CONSTRAINED PROBLEM

Smart grids Compensa;on C V v s q q to subject q x q q J where q J v v T T q \ ) Im( 0 1, ) Re( 2 1 ) (, ) ( min = = = QUADRATIC LINEARLY CONSTRAINED PROBLEM

Reac;ve power Service compensa;on Pricing Shadow prices Lagrange Mul;pliers

Lagrange Mul;pliers Theory(1) Duality theory Impossibile visualizzare l'immagine. La memoria del computer potrebbe essere insufficiente per aprire l'immagine oppure l'immagine potrebbe essere danneggiata. Riavviare il computer e aprire di nuovo il file. Se viene visualizzata di nuovo la x rossa, potrebbe essere necessario eliminare l'immagine e inserirla di nuovo. Primal min f 0 ( x) s.t f ( x) 0, h ( x) = i i 0 Lagrangian g ( λ, ν ) = inf L( x, λ, ν ) Dual max g( λ, ν ) s. t λ 0 Primal+dual *,ν * λ

Lagrange Mul;pliers Theory(2) λ p (0,0) i = u i p ui Primal solu-on Constraint perturba-on Op;mal Lagrange mul;pliers LOCAL SENSITIVITIES

Lagrange Mul;pliers Applica;on(1) Objec-ve func-on J (q) Constraints on loads and compensators q = Ql, q Q c Lagrangian T L( q, λ) = J( q) + λ ( q Q) Solu-on λ * 2 1 l = D Q 2 l u0

Lagrange Mul;pliers Applica;on(2) Solu-on requires global knowledge of network topology Centralized algorithm Centralized unit High computa-onal cost with large number of nodes Broadband communica-on system Change in network topology

Lagrange mul;pliers Graphic Exploi-ng the perturba-on theory of duality we iden-fy the losses parabola Working point

Working point Graphic λ

Working point Graphic λ

Gradient es;ma;on Beginning from the Lagrangian with constraints on both loads and compensators: Solving for λ: Es;ma;on

Gradient es;ma;on (1) Using PCC voltage Each node receives informa-on from the PCC PCC λ( u) = e 2cosθ Im[ jθ ( u u u 0 0 1) ] Θ phase shi_ constant between node and PCC overes-mate results

Distributed Gradient es;ma;on (2) Two nodes exchange informa-on between each other PCC p λ c = λ p + 2 cosθ 2 u 0 Im[ e jθ ( u p + u c )( u p u c ) c Θ phase shi_ Between the two nodes results underes-mate

Valida;on test for λ es;ma;on Real λ analysis Es-mate λ analysis

Test Grid Aligned nodes PCC Symmetric bifurca;on PCC Load Load Load Com Load Load Load Load Load Com Com

1 observa;on Branch with no power flowing (λ 0) Why? The only ac;ve node

2 observa;on Linear increasing of λ in a branch with constant power flowing Linear increasing The only ac;ve node

3 observa;on Superposi-on of the various effects Power flow of nodes 5 and 10 Power flow of node 10 Ac;ve node No power flow

Performance of the λ es;ma;on Simple grid Different absorp;ons Many compensators Not homogeneus grid Depth tree

Hypothesis of no homogeneity If we have different impedance phase angles: X e jθ X then the assump-on done on Re(X) isn t true and we can t extract the phase angles from X Anyway,the homogeneus hypothesis is a realis-c assump-on in the smart microgrid

Depth tree The error increases with the increase of depth tree. This is due to two errors: λ 2 cosθ.. λp.. +.. u c. = 2 0 Im[ e jθ ( u p + u c )( u p u c ) from parent λ from upgrade Nevertheless : we can consider compensator informa-on generally, we have 12 20 levels of depth

Parent child communica;on strategies Ordered Randomized Centralized Right upgrades Time: # levels 1 Wrong upgrades Time: # nodes 1 Only voltage needed Time: 1 step

Shadow prices interpreta;on λi tells us approximately how much more profit the process could make for a small increase in availability of resource qi Lagrange Mul;plier Shadow Price However, the cost func-on f0(x) doesn t consider all the benefits related to reac-ve power Lagrange Mul;plier Shadow Price

Storage strategy f0(x) doesn t consider: voltage constraints conges-on constraints We define a storage strategy in order to evaluate what is truly convenient for a compensator: Sell or Store ac-ve power?

Compensator limita;ons A compensator provides an apparent power A that is func-on of the ac-ve power P and of the reac-ve power Q. These quan--es are linked by Boucherot theorem: Where bars indicate the available ac-ve power or the reac-ve power required.

The inverter installed on the compensator is characterized by an apparent power limita-on M. Thus, we have two cases: No limita-on Limita-on is ac-ve We must decide whether to sell or to store ac;ve power

What to do in case of limita;on? Time t=0 At the ini-al -me we suppose to provide the whole ac-ve power and produce a quan-ty Q(t=0) of reac-ve power The corresponding inverter limita-on is: Where the reac-ve power tends to zero.

Time t=1 Suppose to increase the reac-ve power to: Due to ac-ve limita-on, we must decrease the ac-ve power sold and store a certain quan-ty: For any produc-on increment of reac-ve power we can consider an equal storage quan-ty:

Cost func;on storage isn t free considering the storage inefficiency η Where is the unit price of ac-ve power

Gain func;on using λ For an infinitesimal varia-on of reac-ve power we assume a linear increasing of ac-ve power From which we obtain the gain func-on: Where is the unit price of ac-ve power

Profits inequality To have profits we need to comply with: Solving the inequality we obtain: Never true λ < 0.05 η = 0.1 0.07 We have a confirma-on that λ hasn t all the necessary informa-on for pricing

Gain func;on with Q price Assuming to know the correct reac-ve power price, we can define the gain: Solving the profit inequality, we obtain: It is plausible that in some cases reac-ve power importance is very high even higher than the ac-ve power one

λ shadow price for Voltage limits Risk of conges-on Conclusions Pricing Storage strategy Future developments Define a new cost func-on Build different Lagrangians Abandon Lagrange theory