(1998)
*Markov Chains for Multipartitioning Power System State Estimation Networks.*
Electric Power System Research, 45 (2).
pp. 135-140.

## Abstract

This paper presents a new and efficient algorithm for multipartitioning an observable power system state estimation network into observable subnetworks. The partitioning algorithm, which uses the spanning tree of an observable network, is based on Markov chains and has a stochastic basis, rather than a heuristic derivation. This algorithm is faster and provides all the possible optimal partitions of a spanning tree. Once the spanning tree is optimally partitioned into full rank subspanning trees, the interconnected lines between the partitioned subnetworks can be obtained directly from the original network. Computational examples using large power networks are given, to illustrate the properties of the proposed algorithm.

Item Type: | Article |
---|---|

Subjects: | Electrical |

Department: | College of Engineering and Physics > Electrical Engineering |

Depositing User: | Dr SHARIF IQBAL SHEIKH |

Date Deposited: | 15 Mar 2008 13:58 |

Last Modified: | 01 Nov 2019 13:23 |

URI: | http://eprints.kfupm.edu.sa/id/eprint/347 |