Back to results
Virginia Tech
Minimal PMU placement for graph observability: a decomposition approach
Abstract
dc:description.abstractThis thesis explores the PMU placement problem, that is, the placement of a minimal number of Phase Measurement Units (PMUs) on the nodes of a power system graph such that the entire graph is observed. The NP-completeness of PMU placement for planar bipartite graphs is shown. PMU placement algorithms are developed for graphs of bounded tree width, such as trees and outer planar graphs. Graph decompositions are used to develop efficient algorithms that produce minimal PMU covers. These algorithms are developed, analyzed, and compared theoretically. Algorithm animations were used in the study to develop insight into the problem and to understand algorithm behavior.
Degree
thesis:*- Name thesis:degree_name
- Master of Science
- Level thesis:degree_level
- masters
- Discipline thesis:degree_discipline
- Computer Science and Applications
- Department dc:contributor.department
- Computer Science and Applications
- Grantor dc:publisher
- Virginia Tech
- Year dc:date.issued
- 1993
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Brueni, Dennis J.
- Chair dc:contributor.committeechair
-
- Heath, Lenwood S.
- Committee members dc:contributor.committeemember
-
- Allison, Donald C. S.
- Boisen, Monte B. Jr.
Rights
dc:rights- Statement dc:rights
-
- In Copyright
- Licence dc:rights.uri
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Other
- etd-10312009-020314
- OAI identifier oai:identifier
- oai:vtechworks.lib.vt.edu:10919/45368