Allocation of phasor measurement unit using an admissible searching‐based algorithm A‐star and binary search tree for full interconnected power network observability

Abstract

AbstractIn this research work, an admissible searching‐based algorithm A‐star and binary search tree is proposed to unravel the optimal phasor measurement unit (PMU) placement problem (OPPP) for achieving full interconnected power network observability considering contingencies. The proposed method is an advanced version of the best‐first search method that finds minuscule paths to the best solution. Moreover, it is an optimal and complete search method. Optimal signifies that the proposed method is guaranteed to unravel the minimum cost from origin to the terminus point and Complete denotes that it is going to determine all the possible paths that are available to us from the origin to the destination. The binary tree is used for this purpose as its structural design is well‐matched with the proposed method. Integrating an A‐star algorithm and binary search tree enhances the optimization and performance toward unraveling the OPPP. Also, for more than one solution of OPPP, redundancy measurement is taken into consideration. The proposed method is applied on standard IEEE‐14, ‐30, ‐118, New England‐39, and northern regional power grid (NRPG) 246‐bus test systems. Furthermore, to check the scalability of the proposed method, the Polish 2383‐bus system is considered. The obtained experimental results were compared to established procedures published in peer‐reviewed journals, and the proposed methodology outperformed the other comparison approaches. Thus, the proposed method successfully accomplishes complete observability of the power networks.