DocumentCode :
776016
Title :
Network observability: theory and algorithms based on triangular factorisation and path graph concepts
Author :
Bretas, N.G.
Author_Institution :
Sao Paulo Univ., Brazil
Volume :
143
Issue :
1
fYear :
1996
fDate :
1/1/1996 12:00:00 AM
Firstpage :
123
Lastpage :
128
Abstract :
A theory is developed to test network observability, to identify possible subnetworks which might be observable, and, in case the network is not observable, to identify the minimal set of measurements (pseudo) to be added so that the network as a whole becomes observable. Algorithms to test network observability and to identify subnetworks of the entire system that might be observable are also presented. An algorithm to add a minimal set of measurements to the existing measurements, so that the network becomes observable as a whole, is developed. The theory and algorithms that result are a combination of factorisation path concepts and triangularisation of the gain matrix G. Such algorithms have the characteristics of being very simple, easy to implement, extremely fast and reliable. Algorithms resulting from this theory do not require solutions of any algebraic equation
Keywords :
observability; power system state estimation; gain matrix; network observability; path graph concepts; power networks; static state estimation; subnetworks identification; triangular factorisation;
fLanguage :
English
Journal_Title :
Generation, Transmission and Distribution, IEE Proceedings-
Publisher :
iet
ISSN :
1350-2360
Type :
jour
DOI :
10.1049/ip-gtd:19960169
Filename :
488071
Link To Document :
بازگشت