GHEORGHE GRIGORAS GHEORGHE CARTINA MIHAI GAVRILAS

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Tuesday, March 5 Duality – The art of obtaining bounds – weak and strong duality Handouts: Lecture Notes.
Statistics for Improving the Efficiency of Public Administration Daniel Peña Universidad Carlos III Madrid, Spain NTTS 2009 Brussels.
Clustering II.
THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
1 Alberto Montanari University of Bologna Basic Principles of Water Resources Management.
Class 12: Communities Network Science: Communities Dr. Baruch Barzel.
Weighted Least Squares Regression Dose-Response Study for Rosuvastin in Japanese Patients with High Cholesterol "Randomized Dose-Response Study of Rosuvastin.
Discrimination and Classification. Discrimination Situation: We have two or more populations  1,  2, etc (possibly p-variate normal). The populations.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Problems and Their Classes
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
1 ECE 776 Project Information-theoretic Approaches for Sensor Selection and Placement in Sensor Networks for Target Localization and Tracking Renita Machado.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
Aaker, Kumar, Day Seventh Edition Instructor’s Presentation Slides
SEEM Tutorial 4 – Clustering. 2 What is Cluster Analysis?  Finding groups of objects such that the objects in a group will be similar (or.
Clustering.
1 CSE 980: Data Mining Lecture 16: Hierarchical Clustering.
Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
CSE 330: Numerical Methods
Presenter: Raghu Ranganathan ECE / CMR Tennessee Technological University March 22th, 2011 Smart grid seminar series Yao Liu, Peng Ning, and Michael K.
Crew Scheduling Housos Efthymios, Professor Computer Systems Laboratory (CSL) Electrical & Computer Engineering University of Patras.
Convex Position Estimation in Wireless Sensor Networks
Easy Optimization Problems, Relaxation, Local Processing for a small subset of variables.
Clustering II.
1 Abstract This paper presents a novel modification to the classical Competitive Learning (CL) by adding a dynamic branching mechanism to neural networks.
WiOpt’03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 3-5, 2003, INRIA Sophia-Antipolis, France Session : Energy Efficiency.
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
Comparison Between Communication Infrastructures of Centralized and Decentralized Wide Area Measurement Systems Mohammad Shahraeini, Mohammad Hossein Javidi,
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
More Realistic Power Grid Verification Based on Hierarchical Current and Power constraints 2 Chung-Kuan Cheng, 2 Peng Du, 2 Andrew B. Kahng, 1 Grantham.
Evaluating Performance for Data Mining Techniques
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Introduction to variable selection I Qi Yu. 2 Problems due to poor variable selection: Input dimension is too large; the curse of dimensionality problem.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Chem Math 252 Chapter 5 Regression. Linear & Nonlinear Regression Linear regression –Linear in the parameters –Does not have to be linear in the.
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Frankfurt (Germany), 6-9 June 2011 Pyeongik Hwang School of Electrical Engineering Seoul National University Korea Hwang – Korea – RIF Session 4a – 0324.
Technological Educational Institute Of Crete Department Of Applied Informatics and Multimedia Intelligent Systems Laboratory 1 CLUSTERS Prof. George Papadourakis,
Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.
General Methods of Network Analysis Node Analysis Mesh Analysis Loop Analysis Cutset Analysis State variable Analysis Non linear and time varying network.
Contingency-Constrained PMU Placement in Power Networks
Clustering.
1 Chapter 5: Harmonic Analysis in Frequency and Time Domains Contributors: A. Medina, N. R. Watson, P. Ribeiro, and C. Hatziadoniu Organized by Task Force.
Network topology, cut-set and loop equation
Hierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree like diagram that.
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
Data Mining By Farzana Forhad CS 157B. Agenda Decision Tree and ID3 Rough Set Theory Clustering.
© Tan,Steinbach, Kumar Introduction to Data Mining 4/18/ Data Mining: Cluster Analysis This lecture node is modified based on Lecture Notes for Chapter.
Frankfurt (Germany), 6-9 June 2011 Manuel Avendaño J. V. Milanović Manuel Avendaño – UK – Session 2 – Paper 0529 METHODOLOGY FOR FLEXIBLE, COST-EFFECTIVE.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
 State variables are the voltage of the buses and relative phase angles at the respective nodes/buses.  Idea is to estimate (calculate) these.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Data Transformation: Normalization
Chapter 7. Classification and Prediction
NAME: OLUWATOSIN UTHMAN ZUBAIR (145919) COURSE: NETWORK FLOW
Linear regression Fitting a straight line to observations.
Contingency-Constrained PMU Placement in Power Networks
6.5 Taylor Series Linearization
Department of Electrical Engineering
Self-organizing map numeric vectors and sequence motifs
Cluster Analysis.
Clustering The process of grouping samples so that the samples are similar within each group.
SEEM4630 Tutorial 3 – Clustering.
Hierarchical Clustering
Presentation transcript:

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units GHEORGHE GRIGORAS GHEORGHE CARTINA MIHAI GAVRILAS Technical University “Gh. Asachi” of Iasi, Electrical Engineering Faculty, Iasi, Romania E-mail: ggrigor@ee.tuiasi.ro

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 1. Introduction The paper proposes an algorithm based on the clustering techniques for solving optimal measurement placement in power system state estimation. The phasor measurement unit (PMU) is considered to be one of the most important measuring devices in the future of power systems. The distinction comes from its unique ability to provide synchronized phasor measurements of voltages and currents from widely dispersed locations in an electric power grid.

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 1. Introduction There are two important methods for optimal placement of PMUs: topology based methods and numerical methods. Topology methods use the decoupled measurement model and graph theory. In these methods decision is based on logical operations. Numerical methods use either fully coupled or decoupled measurement models. These methods are based on numerical factorization of the measurement Jacobian or measurement information gain matrix.

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 2. Power System State Estimation State estimator provides the optimal estimate of the system state based on the received measurements and the knowledge of the network model. The finding of the best locations for PMUs, in order of state estimation, can be formulated as an optimization problem and solved using an appropriate numerical method. For the objective function can be used the weighted sum of the measurement residual squares, which leads to the well known Weighted Least Squares (WLS) state estimation solution.

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 2. Power System State Estimation The WLS state estimator equations are: (1) where: z - the measurement vector, dimension m; h - the non-linear function vector, dimension m; x - the system state vector, dimension 2N; w – the measurement error vector, dimension m; m - the number of measurements; N - the number of buses. The WLS state estimation problem is solved as an iterative calculus: (2) (3)

AN IMPROVED METHOD FOR POWER LOSSES DETERMINATION IN RURAL DISTRIBUTION NETWORKS Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 3. Clustering techniques r s 5 4 3 1 2 r s r s A. Single linkage clustering B. Complete linkage clustering D(r,s) = Min {d(i,j) : i  r and j  s} D(r,s) = Max { d(i,j) : i  r and j  s} C. Average linkage clustering. D. Centroid Method D(r,s) = Trs / ( Nr * Ns) E. K-means clustering

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 4. Optimal PMU Placement Method with Clustering Techniques The task of area identify of PMUs is formulated as a problem of nodes connectivity identification from analysis power system. A hierarchical clustering method is used, which well overcomes problems concerning formation of coherent and representative groups (named below zones). Step 1. Units (that represent the links of every node with other) from binary connectivity matrix A compare, and to gather them progressively in coherent groups (zones) in a way that the nodes in the same group to belong same zone. The elements of the binary connectivity matrix A as defined below:

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 4. Optimal PMU Placement Method with Clustering Techniques After that, they are linked together in to the new group (zone) Z. The newly formed zones are grouped into larger zones until a hierarchical tree is formed. The process is repeated until there is only one zone if all nodes meet the required criterion. Step 2. The hierarchical tree is divided into coherent zones by cutting off the hierarchical tree at an arbitrary point, α. The threshold of inconsistency coefficient strongly influences the final number of zones. Thus, it is defined so that every zone to contain a nodes number smaller than maximum links number of a node from system. Step 3. The PMUs placement in nodes of system. The PMUs number which can be installed in system is equal with number of obtained zones. These PMUs will be installed in node that have the more links with other nodes from respective zone. If the links number among nodes is equal, then the PMU is placement in the first node that it belong zone from dendogram of clustering process.

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 5. Study Case 14 13 12 11 10 9 8 7 6 5 4 3 2 1 Fig. 1. IEEE 14-bus system

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 5. Study Case Fig. 2. Dendogram of clustering process

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 5. Study Case Table 1 – Results of IEEE 14 – bus system 14 13 12 11 10 9 8 7 6 5 4 3 2 1 Zone 2 Zone 1 Zone 4 Zone 3 Fig. 3.The zones of IEEE 14-bus system and optimal placement of PMUs Table 2. Synthesis of results for different size systems Table 3 – Optimum number and location of PMUs using Branch and Bound approach

Using of Clustering Techniques in Optimal Placement of Phasor Measurements Units 6. Conclusions In this paper a new approach, based on the clustering techniques, is proposed for determination of the minimum number of PMUs in order to make the system fully observable The results obtained using different systems demonstrate that the methodology can be used with the success in solving optimal measurement placement in power system state estimation.