0% found this document useful (0 votes)
625 views23 pages

Formation of Power System Network Matrix

This document discusses graph theory concepts and their application to power systems analysis. It defines key terms like graphs, subgraphs, paths, trees, loops, and cut sets. It describes how to formulate incidence matrices that describe the connections between elements, nodes, loops, and cut sets. It also discusses modeling individual network elements as primitive networks in impedance or admittance form, and how to transform these into network matrices in the bus, branch, or loop reference frames for analyzing the overall power system network.

Uploaded by

Mohammed Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
0% found this document useful (0 votes)
625 views23 pages

Formation of Power System Network Matrix

This document discusses graph theory concepts and their application to power systems analysis. It defines key terms like graphs, subgraphs, paths, trees, loops, and cut sets. It describes how to formulate incidence matrices that describe the connections between elements, nodes, loops, and cut sets. It also discusses modeling individual network elements as primitive networks in impedance or admittance form, and how to transform these into network matrices in the bus, branch, or loop reference frames for analyzing the overall power system network.

Uploaded by

Mohammed Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
You are on page 1/ 23

Mohammed Ahmed

Jimma University
INTRODUCTION
 A graph shows the geometrical interconnection of the elements
of a network.
 A sub-graph is any subset of elements of the graph.
 A path is a sub-graph of connected elements with not more than
two elements connected to any one node.
 A graph is connected if and only if there is a path between every pair
of nodes.
 If each element of the connected graph is assigned a direction then it
is an oriented graph.
 A tree is a connected sub-graph of a connected graph having all
the nodes of the graph but without any closed path (or) loop are
called tree branches (or) twigs and are denoted by thick lines.

Fig.: Single-line
diagram of PS
BASIC /FUNDAMENTAL LOOPS
 When a link element is added to the existing tree,
basic loops or fundamental loops can be obtained.
 Note: Tree + Co-Tree = Graph
 No. of fundamental loops = No. of links

Fig.: Basic loops, ith tree branches T [1, 2, 3].


FUNDAMENTAL CUT SETS
 A cut set is a set of elements that, if removed, divides a
connected sub-graphs. In other words, a basic or
fundamental cut set of the graph is the set of elements
consisting of only one branch (or) twig and minimal
number of links (or) chords.
 No. of basic cut sets = No. of twigs
INCIDENCE MATRICES
 Every element of a graph is incident between any two nodes.
Incidence matrices give the information about incidence of
elements—may be incident to loops, cut sets etc.
 The incidence matrix (A) describes whether an element is
incident to a particular node (or) not.
 The elements of the matrix are as follows:
aij = 1 If the ith element is incident to and oriented away from the jth node.
aij = –1 If the ith element is incident to & oriented towards from the jth node.
aij = 0 If the ith element is not incident to the jth node.
Branch-Path Incidence Matrix
 The incidence of Branches to paths in a tree is shown by
the branch- path incidence matrix, where a path is
oriented from a bus to the reference node.
 Kij=1 if the branch is in the path from the jth bus to reference oriented in the
same direction;
 Kij=-1 if the ith branch is in the path from the jth bus to reference but is oriented
in the opposite direction;
 Kij=0 if the ith branch is not in the path from the jth bus to reference with node
0;
Basic Cut Set Incidence Matrix (B)
 The incidence of elements to basic cut sets of a connected
graph is shown by basic/fundamental cut set incidence matrix
(B). Used for KCL application.
 The elements of this matrix are as follows:
 bij = 1 → If the ith element is incident to and oriented in the same direction
as the jth basic cut set.
 bij = –1 → If the ith element is incident to and oriented in the opposite
direction as the jth basic cut set.
 bij = 0 → If the ith element is not incident to the jth basic cut set.
Cont’d
 Matrix B, dimension e X b  The submatrix B can be
can be partitioned into obtained from the bus
submatrices Ub and B where incidence matrix A.
the rows of Ub correspond to  The incidence of the links to
branches and the rows of B buses is shown by the
to links. submatrix, A and the incidence
of branches to buses is shown
by the sub-matrix Ab. But B Ab
shows the incidence of links to
buses, i.e.,
Augmented Cut Set Incidence Matrix [B]
 The basic cut set incidence matrix is of the size e × b,
therefore, a non-square matrix and hence, inverse does
not exist.
 In other words, B is a singular matrix. In order to make
the matrix B a nonsingular matrix, we augment the
number of columns equal to the number of links by
adding fictitious cut sets known as tie-cut sets, which
contain only links.
Fundamental f -loop Incidence Matrix [C]
 Whenever a link element is added, a new basic or fundamental f-
loop is created.
 The number of f-loops = number of links
 The f-loop incidence matrix C depicts the incidence of an element
in a particular f-loop.
 cij =1→ If the ith element is incident to and oriented in the same direction as
the jth basic loop.
 cij = −1→ If the ith element is incident to and oriented in the opposite
direction as the jth basic loop.
 cij = 0→ If the ith element is not incident to the jth basic loop.
PRIMITIVE NETWORK
 A power system network consists of a number of
elements. Each element is incident between any two
nodes.
 This element may be a purely passive (like z or y), or
active (V or I) or a combination of both active and
passive.
 Each element can be represented by a decoupled partial
network, known as the primitive network. This network
can be either in admittance or impedance form.
Primitive Network in Impedance Form
 Let an element be connected between the two nodes i and k.

Let,
Vi , Vk = ith and kth node voltages respectively
vik = Vi – Vk = voltage across the element i–k
eik = active source of the element i–k
Zik = self impedance of the element i–k
Iik = current flowing through the element i–k
where v, e and I are the column matrices of size e × 1, e is the number of elements and Z is
a square matrix of size (e × e). Matrix [Z] is known as the primitive impedance matrix.
In general the Z matrix is a diagonal matrix, provided the elements are not mutually
coupled to other elements.
Primitive Network in Admittance Form
 Let the element i – k connected between the two nodes i and k.
 where Vi, Vk → ith and kth node voltages respectively
Vik, Vi – Vik → Voltage across the element i – k
jik → Source current in parallel with element i – k
iik → Self-admittance of the element i – k
ik → Current flowing through the element i – k

Hence, current
flowing through the
element,
iik + jik = yik νik

The diagonal elements of [Y] represent self-admittances and off-diagonal


elements in [Y] represent mutual admittances of the elements.
Off-diagonal elements are zeros if elements have no mutual coupling.
Cont’d
Example
 For the power system network shown in Figure,
 (i) Draw the oriented graph
 (ii) Formulate the element node incidence matrix, bus incidence matrix, basic
cutset incidence matrix, augmented cutset incidence matrix, basic loop
incidence matrix, augmented loop incidence matrix, and path incidence matrix
 (iii) Formulate primitive Impedance and admittance matrix (take reactance of
each element j0.1 p.u).
Network Equation and Matrix
 A power system is a large and complex network, which consists
of a number of elements such as generators, transformers,
transmission lines, controllers, and switching devices.

 Though the primitive network describes the characteristics of


individual elements it does not provide information about
network characteristics such as connections.

 Therefore we require transforming the primitive network


matrices into network matrices.

 Network matrices can be developed either in the bus frame,


branch frame or loop frame of reference.
Cont’d
 In these frame of references network matrices can be:
or
Where:
-VBus matrix contains bus voltages,
-IBus matrix represents injected currents into the buses
-ZBus is known as bus impedance matrix for an n-bus
power system.
 The dimensions of these matrices are n × 1, n × 1 and n
× n respectively.
 The network equations in admittance form can be
written as:

where YBus = Z–1Bus


Cont’d
 In the loop frame of reference, the admittance form of
network equations can be written as:

 The size of matrices in the network equation of loop frame


depends on the number of basic loops or links.
 In addition, the performance equations can be written in
branch frame as:

 Here, the dimensions of these matrices depend upon the


number of branches in a graph of a given power system
network.
Bus Admittance Matrix
 Bus admittance matrix (YBus) for an n-bus power system is
a square matrix of size (n × n).
 The leading diagonal elements represent the self- or short-
circuit driving point admittances with respect to each bus.

 The off-diagonal elements are the short-circuit transfer


admittances or the admittances common to any two buses.

 YBus can be obtained through the following methods:


 Direct inspection method
 Step-by-step procedure
 Singular transformation method
 Non-singular transformation method
Direct Inspection Method
 In this method the YBus matrix is developed by simply inspecting
the structure of the network without developing any kind of
equations.
 In power flow studies, generators are represented as complex
power sources i.e., they are represented by a complex number S
as:

Where SGi/SDi = complex power generated /load at the i bus,


PGi/PDi, QGi/ QDi, = active & reactive powers generated /loaded at the ith bus

Now, the net power injected into the ith


bus Si is the difference of SGi and SDi.
Cont’d
 Transmission lines are represented as a π-network, with series
admittances and two half-line charging admittances. The line
connecting buses i and k is represented as a π-network

yik = series admittance of the line i–k

half-line charging admittance

Gik, Bik = conductance and suscpetance of the line i – k


The values of Gik, Bik are obtained as:
Cont’d
 Applying KCL at junction 1 in Figure, the equations for net current injected
into bus 1 can be written as:

 The injected currents in terms of voltages and admittances can be written as:

Y12 = Y21 = – y12 = negative value


of series admittance connected
b/n the Buses 1 and 2.

 Similarly, the other elements can be obtained. Note that the line charging
admittances are present only in the diagonal elements of the YBus.
 It can also be understood that the above elements can be written directly, by
inspection Hence, the admittance
matrix is developed
based on the bus frame
of reference.

Injected currents
IBus and VBus are column matrices of size (n × 1) andYBus is a square matrix of size (n × n).
Network Matrices by Singular Transformation Method
 The performance equation in the admittance form is:
…………………………(1)
 The relation between branch voltages and bus voltages can
be written according to Equation 2.15 as:
………………………….(2)
 where [v] is the (e × 1) column matrix of branch voltages,[V]
is (n × 1 × 1) the column matrix of bus voltages, and A is the
bus incidence matrix. By substituting, Equation (2) in
Equation (1), ….(3)
 Pre-multiplying both sides of the above equation by .
 So, represents the sum of all currents meeting at the bus.
Therefore according to KCL
 Y bus, Ibus

You might also like