VTechWorks staff will be away for the Thanksgiving holiday beginning at noon on Wednesday, November 27, through Friday, November 29. We will resume normal operations on Monday, December 2. Thank you for your patience.
 

Minimal PMU placement for graph observability: a decomposition approach

Simple item page
dc.contributor.authorBrueni, Dennis J.en
dc.contributor.committeechairHeath, Lenwood S.en
dc.contributor.committeememberAllison, Donald C. S.en
dc.contributor.committeememberBoisen, Monte B. Jr.en
dc.contributor.departmentComputer Science and Applicationsen
dc.date.accessioned2014-03-14T21:48:31Zen
dc.date.adate2009-10-31en
dc.date.available2014-03-14T21:48:31Zen
dc.date.issued1993-12-06en
dc.date.rdate2009-10-31en
dc.date.sdate2009-10-31en
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.en
dc.description.degreeMaster of Scienceen
dc.format.extentviii, 92 leavesen
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-10312009-020314en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-10312009-020314/en
dc.identifier.urihttp://hdl.handle.net/10919/45368en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V855_1993.B784.pdfen
dc.relation.isformatofOCLC# 30505899en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V855 1993.B784en
dc.subject.lcshPhase measurement unitsen
dc.titleMinimal PMU placement for graph observability: a decomposition approachen
dc.typeThesisen
dc.type.dcmitypeTexten
thesis.degree.disciplineComputer Science and Applicationsen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Name:
LD5655.V855_1993.B784.pdf
Size:
135.23 MB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses