A parallel approach for ultra-fast state estimation in large power system using graph partitioning theory


  • Behnam Karim Sarmadi phd candidate at university of mohaghegh adrebili
  • Ahmad Salehi Dobakhshari




State estimation, graph, clustering, eigenvalues, applied mathematics


This paper introduces a novel approach for multi-area state estimation in large transmission networks through the application of graph partitioning theory. By harnessing the eigenvalues and eigenvectors of the Laplacian matrix, a large-scale transmission network is partitioned into manageable sections. Within these partitions, state estimation processes run in parallel, markedly improving efficiency compared to conventional methods. Linear state estimation is employed within each area, expediting computations and making it adaptable to large-scale networks, which traditionally pose computational challenges. The method's efficacy is demonstrated through comprehensive validation, commencing with small networks and extending to real-world applications on the IEEE 118-bus test system and the 9241-bus European high-voltage transmission network. In comparison to the integrated network method, our approach has achieved state estimation answers with reduced computation time. The partitioning of the integrated network into multi areas has effectively mitigated computational loads, showcasing its potential for enhancing operational efficiency and reliability in complex power transmission systems. This approach not only offers a robust solution for state estimation but also represents a significant stride toward advancing the field of state estimation, promising to bolster the stability and performance of modern power grids.






Research Papers