A New Partitioned Algorithm of Innovation Graph Technique

This paper presents an innovation graph technique partitioned algorithm to identify multiple interacted bad data, topology changes and topology errors for the real-time large-scale electric network. First, the innovation graph technique is introduced and the reason that the innovation graph technique cannot adapt to large-scale electric network is analyzed. Second, an innovation graph technique partitioned algorithm is proposed. At last, the merits and demerits of the innovation graph technique partitioned algorithm are analyzed. Based on innovation graph technique, a simplified network which equals to the original network is constructed in the innovation graph technique partitioned algorithm and then the simplified network is used to calculate reckoned innovation of boundary branches of each sub-network. The reckoned innovations of sub-network boundary branches are used to correct the reckoned innovations of sub-network inner branches. The algorithm reduces model error superposition in the innovation graph technique, improves the accuracy of branch reckoned innovations, and blocks the error diffusion between sub-networks. Therefore the innovation graph technique partitioned algorithm can identify multiple interacted bad data, topology errors and topology changes in large-scale electric network quickly and accurately. The method can be applied on real-time large-scale electric network.. In this paper we propose a methodology to identify multiple interacted bad data, topology changes and topology errors for the power system state estimation.