网络拓扑可观测性的快速可观测路径搜索法

A TOPOLOGICALLY BASED FAST OBSERVABLE PATH SEARCH ALGORITHM FOR POWER SYSTEM OBSERVABILITY

提出网络拓扑可观测性的判别准则是量测图的最大生成树满秩。根据实际存在的量测配置采用P—6和Q—V两个量测图分别处理的方法以适应PQ分解或不分解的各种状态估计算法。开发了从没有结点量测的孤立点出发的可观测路径快速搜索法。

A power system is observalbe if the measurements made on it allow determination of voltage magnitude and angle at every bus. Since observability is equivalent to the existence of a spanning tree of full rank, a fast observable path search algorithm based on topology is presented in this paper. The main point of this algorithm is to find a observable path from the isolated bus on which there is no bus measurement.A P-δ decomposition technique is applied in this algorithm for varibale state estimation.