Matching Items (2)
Filtering by

Clear all filters

153915-Thumbnail Image.png
Description
Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition

Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition determining whether a finite number of measurements suffice to recover the initial state. However to employ observability for sensor scheduling, the binary definition needs to be expanded so that one can measure how observable a system is with a particular measurement scheme, i.e. one needs a metric of observability. Most methods utilizing an observability metric are about sensor selection and not for sensor scheduling. In this dissertation we present a new approach to utilize the observability for sensor scheduling by employing the condition number of the observability matrix as the metric and using column subset selection to create an algorithm to choose which sensors to use at each time step. To this end we use a rank revealing QR factorization algorithm to select sensors. Several numerical experiments are used to demonstrate the performance of the proposed scheme.
ContributorsIlkturk, Utku (Author) / Gelb, Anne (Thesis advisor) / Platte, Rodrigo (Thesis advisor) / Cochran, Douglas (Committee member) / Renaut, Rosemary (Committee member) / Armbruster, Dieter (Committee member) / Arizona State University (Publisher)
Created2015
153876-Thumbnail Image.png
Description
For a (N+1)-bus power system, possibly 2N solutions exists. One of these solutions

is known as the high-voltage (HV) solution or operable solution. The rest of the solutions

are the low-voltage (LV), or large-angle, solutions.

In this report, a recently developed non-iterative algorithm for solving the power-

flow (PF) problem using the holomorphic embedding

For a (N+1)-bus power system, possibly 2N solutions exists. One of these solutions

is known as the high-voltage (HV) solution or operable solution. The rest of the solutions

are the low-voltage (LV), or large-angle, solutions.

In this report, a recently developed non-iterative algorithm for solving the power-

flow (PF) problem using the holomorphic embedding (HE) method is shown as

being capable of finding the HV solution, while avoiding converging to LV solutions

nearby which is a drawback to all other iterative solutions. The HE method provides a

novel non-iterative procedure to solve the PF problems by eliminating the

non-convergence and initial-estimate dependency issues appeared in the traditional

iterative methods. The detailed implementation of the HE method is discussed in the

report.

While published work focuses mainly on finding the HV PF solution, modified

holomorphically embedded formulations are proposed in this report to find the

LV/large-angle solutions of the PF problem. It is theoretically proven that the proposed

method is guaranteed to find a total number of 2N solutions to the PF problem

and if no solution exists, the algorithm is guaranteed to indicate such by the oscillations

in the maximal analytic continuation of the coefficients of the voltage power series

obtained.

After presenting the derivation of the LV/large-angle formulations for both PQ

and PV buses, numerical tests on the five-, seven- and 14-bus systems are conducted

to find all the solutions of the system of nonlinear PF equations for those systems using

the proposed HE method.

After completing the derivation to find all the PF solutions using the HE method, it

is shown that the proposed HE method can be used to find only the of interest PF solutions

(i.e. type-1 PF solutions with one positive real-part eigenvalue in the Jacobian

matrix), with a proper algorithm developed. The closet unstable equilibrium point

(UEP), one of the type-1 UEP’s, can be obtained by the proposed HE method with

limited dynamic models included.

The numerical performance as well as the robustness of the proposed HE method is

investigated and presented by implementing the algorithm on the problematic cases and

large-scale power system.
ContributorsMine, Yō (Author) / Tylavsky, Daniel (Thesis advisor) / Armbruster, Dieter (Committee member) / Holbert, Keith E. (Committee member) / Sankar, Lalitha (Committee member) / Vittal, Vijay (Committee member) / Undrill, John (Committee member) / Arizona State University (Publisher)
Created2015