17th Power Systems Computation Conference (PSCC'11), Stockholm, Sweden
A Piece-wise Linear Model For Approximating LMP-Load Curve Based On Critical Load Levels
Fangxing Lia, Rui Bob aUniversity of Tennessee, Knoxville,USA bMISO, St.Paul, USA August 23, 2011 1
Outline
Background Problem Statement Possible Approaches Critical Load Level (CLL) and its Identification Piece-wise Linear Approximation Model Numeric Study Conclusions 2
Background
Locational Marginal Price (LMP)
Load level is a major factor LMPi
D∑ LMPi = f(D∑)
Knowing function f is useful for analytical LMP Studies
Probabilistic LMP Forecasting
E.g.: impact of load forecasting error on LMP
LMP Trend Analysis 3
Background (Cont’d)
Need to know function f
LMPi = f(D ) ∑
However, …
Can be highly nonlinear
High loss cases
Multiple patterns
Step change; linear; polynomial; nonlinear
Difficult to define a mathematical representation
4
Problem Statement
Define a simple form of math representation for the LMP-Load curve with high accuracy
5
Possible Approaches
Data-driven approach
E.g.: Curve-fitting, Curve-smoothing Difficult to define break points of drastic pattern change
We propose model-driven approach
LMP change its pattern when
Shift of marginal units Change in congestions
These break points have been studied and termed Critical Load Level (CLL)! With CLLs as breakpoints, even linear model may work! 6
Critical Load Level (CLL) and its Identification
CLL is critical because
Across a CLL system statuses may change significantly from their past trajectory E.g.: shift of marginal unit; new congestion; etc.
Locating CLL
Criterion: A system load level is a Critical Load Level
where the binding constraint set or non-binding constraint set changes when system load varies right across this load level.
1) Identify CLLs using existing methods 2) Perform linear curve-fitting for any segment demarcated by two immediately adjacent CLLs 3) Combine the piece-wise linear models to get a full representation
8
Piece-wise Linear Approximation Model (Cont’d)
D0 < D ≤ D1 a 0 × D + b0 , a × D + b , D1 < D ≤ D2 1 1 y ( D) = M a × D + b , D < D ≤ D n −1 n −1 n n −1 a n × D + bn , Dn < D ≤ Dn +1
9
Numeric Study
IEEE 118-bus system
Studied load range: 42.42MW~7686MW Benchmark LMP is obtained from repetitive AC-OPF runs
Sampling step: 4.242MW (i.e., 0.001 p.u. of base case load)
Proposed Piece-wise linear model
57 CLLs identified through binary search method
To the precision of 4.242MW Can use more effective methods
Do linear curve-fitting for each of the 58 segments Resulting math formula is a piece-wise linear model with 57 break points (i.e., 58 segments) 10
Results
Benchmark LMP-Load Curve
Approximated LMP-Load Curve using proposed piece-wise linear model
Approximated LMP-Load Curve using proposed piece-wise linear model
13
Close-up Look --- Linear Pattern 5000MW-6000MW
Benchmark LMP-Load Curve
Approximated LMP-Load Curve using proposed piece-wise linear model
14
Close-up Look --- Complex Pattern 7000MW-7700MW
Benchmark LMP-Load Curve
Approximated LMP-Load Curve using proposed piece-wise linear model
15
Conclusions
Proposed Piece-wise Linear Model
Sufficiently accurate approximation to actual LMPLoad curve Able to capture various pattern of the curve Key to success: identification and utilization of CLLs LMP-Load curve can take math form as simple as piece-wise linear model
of cryptographic schemes, namely, public-key schemes and ... elliptic curve cryptography (ECC) are classified as public-key ..... Statistical properties of digital.
Non-degenerate Piecewise Linear Systems: A. Finite Newton Algorithm and Applications in. Machine Learning. Xiao-Tong Yuan [email protected]. Department of Statistics, Rutgers University, NJ 08854, U.S.A., and Department of. Electrical and Comput
Mar 7, 2007 - from a databank. .... We assume that a bounded lipschitzian open domain. O of IR3 ... MR volume data set according to the Gradient Vector.
are determined by a list of n points in three-space, which we call the vertices of ...... 911. 13. 947. 12. 83. 12. 912. 12. 948. 12. 84. 10. 913. 13. 949. 11. 85. 12. 914. 14 .... ory, Banach Center Publications Vol.42, Polish Academy of Sciences,.
The considered system class and the identification problem are motivated by .... system in mode q â Q, Xq,0 â Rn â is the set of initial states of the affine ...... Online structured subspace identification with application to switched linear s
Abstract--This paper firstly presents a brief review of the FND. (Fictitious Nodal Demand)-based iterative DCOPF algorithm to calculate Locational Marginal Price (LMP), which is proposed in a previous work. The FND-based DCOPF algorithm is particular
Conference on Computer Aided Control Systems Design ..... solution of (4) in a numerical reliable way. .... remark that the function call P=Polytope(V) includes.
Using âa tagging solutionâ, Kent Industries can see when users have interacted with their ads. This leaves them with a path of media interactions (or interaction path) prior to users completing a relevant activity (e.g., a sale). We call each med
[9] D. Limon, I. Alvarado, T. Alamo, and E.F. Camacho. Mpc for tracking piecewise constant references for constrained linear systems. Automatica,. 44(9):2382 â 2387, 2008. [10] Elmer G. Gilbert and Chong-Jin Ong. Constrained linear systems with har
minimodelo. Posição do. Motor. Longitudinal. Admite-se a posição anglewinder para o modelo Reynard da. Sloting Pluse desde que utilizado o motor SPEED 3, ...
The problem: unauthorised or malicious activities performed by clients on servers while clients consume services (e.g. email spam) without behavioural history ...
sizes, and is not practical for most real domains. ... The application domain used is the game ..... (ie. only one of the available choices), then a perfect mapping.
The application domain used is the game of poker, specifically ... A poker-playing program that is a major improvement ...... ior. Princeton University Press, 1944.
2. The Proof For Polygons. 2. 2.1. The Jordan arc theorem for a simple polygon. 3. 2.2. The Jordan curve theorem for a simple closed polygon. 3. 3. Parallel arcs.
There are one bank account, with constant price process S0, normalized to .... and C1 utility function U = U2. Our interest is on the optimization problem : J(x) =.
Aug 7, 2010 - We call this a ... In HMM-GMM based speech recognition (see [11] for review), we turn the .... of the work described here has been published in conference .... ize the SGMM system; we do this in such a way that all the states' ...
tering of models, and optimization by minimizing or maximizing the. KL divergence between distributions. For two gaussians Ëf and g the KL divergence has a ...
less than 0.1 ms per pair of GMMs. The Dgaussian, Dunscented, and DMC(2dn) took around 1 ms per pair. ... for graphical models,â Machine Learning, vol.
If a population has normal distribution with variance 225,then how large a sample must be drawn in order to be 95 per cent confident that the sample mean will ...
A test of stability in a linear altruism model. Christos ... outcome-based models of social preferences: the underlying as- sumption ... Thus, a logical implication of the as- .... Table 1 reports the descriptive statistics on the raw experimen- tal
May 21, 2006 - piecewise-affine hybrid system if and only if it has a realization by a ..... DTAPA and we will call Σl the linearised DTAPA associated with Σ. ...... Proceedings of 44th IEEE Conference on Decision and Control, 2005, 2005.