Groebner bases algorithm for optimal PMU placement

被引:12
|
作者
Becejac, Vladimir [1 ]
Stefanov, Predrag [1 ]
机构
[1] Univ Belgrade, Sch Elect Engn, Dept Power Syst, Belgrade, Serbia
关键词
Phasor measurement unit; Groebner bases; Nonlinear programming; System observability; MEASUREMENT UNIT PLACEMENT; OBSERVABILITY; FORMULATION; NETWORK;
D O I
10.1016/j.ijepes.2019.105427
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper a new method for solving optimal phasor measurement units (PMU) placement problem for full observability in power systems is proposed. A new algorithm is based on forming and solving Groebner bases set of equations for a defined optimization problem. The technique of Groebner bases is applicable wherever the problem may be presented by the set of polynomials and as such, it can be found in a variety of applied mathematics problems. Groebner bases of the set of polynomials represents the canonical form equivalent to the original set, similar to the way the row echelon form for linear systems represents the triangular form of the linear equations set. The canonical form of the Groebner bases polynomials, along with the utilization of recursive algorithms, allows the solution to be effortlessly obtained. Optimal phasor measurement units placement (OPP) problem can be presented in a linear or nonlinear polynomial form, both of which are used in this paper. The settings of OPP problem have been proposed in this paper with the inclusion of zero injection buses (ZIBs), in normal system states and considering contingency related to PMU outage. The problem formulation is defined according to the application of Groebner bases technique. The proposed model is capable of obtaining the full set of optimal solutions instead of only one or partial solutions. The efficiency of the proposed method is tested on IEEE 14-bus, IEEE 24-bus, IEEE 30-bus, IEEE 118-bus and Polish 2383-bus test system and the results are compared with those of some recently reported methods.
引用
收藏
页数:10
相关论文
共 50 条
  • [31] Hybrid Approach Based on Global Search Algorithm for Optimal Placement of μPMU in Distribution Networks
    Chen, Xuebing
    Chen, Tengpeng
    Tseng, King Jet
    Sun, Yuhao
    Amaratunga, Gehan
    2016 IEEE INNOVATIVE SMART GRID TECHNOLOGIES - ASIA (ISGT-ASIA), 2016, : 559 - 563
  • [32] Observability of power systems with optimal PMU placement
    Carvalho, Margarida
    Klimentova, Xenia
    Viana, Ana
    COMPUTERS & OPERATIONS RESEARCH, 2018, 96 : 330 - +
  • [33] Optimal PMU placement for small-signal stability assessment using Genetic algorithm
    Tarif, Toufik
    Ladjici, Ahmed Amine
    Chabane, Yasmina
    PROCEEDINGS 2018 3RD INTERNATIONAL CONFERENCE ON ELECTRICAL SCIENCES AND TECHNOLOGIES IN MAGHREB (CISTEM), 2018, : 196 - 201
  • [34] Optimal Placement of PMU using Probabilistic Approach
    Kumar, Sanjay
    2014 RECENT ADVANCES IN ENGINEERING AND COMPUTATIONAL SCIENCES (RAECS), 2014,
  • [35] Optimal PMU placement problem in octahedral networks
    Prabhu, Savari
    Deepa, S.
    Elavarasan, Rajvikram Madurai
    Hossain, Eklas
    RAIRO-OPERATIONS RESEARCH, 2022, 56 (05) : 3449 - 3459
  • [36] Optimal PMU placement: A comprehensive literature review
    Yuill, William
    Edwards, A.
    Chowdhury, S.
    Chowdhury, S. P.
    2011 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING, 2011,
  • [37] Optimal PMU Placement for State Estimation Robustness
    Gol, Murat
    Abur, Ali
    2014 IEEE PES INNOVATIVE SMART GRID TECHNOLOGIES CONFERENCE EUROPE (ISGT EUROPE), 2014,
  • [38] Optimal PMU Placement in the Presence of Conventional Measurements
    Jin, Zhaoyang
    Hou, Yueting
    Yu, Yue
    Ding, Lei
    INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS, 2022, 2022
  • [39] Unified PMU Placement Algorithm for Power Systems
    Amare, Kunal
    Centeno, Virgilio A.
    Pal, Anamitra
    2015 NORTH AMERICAN POWER SYMPOSIUM (NAPS), 2015,
  • [40] Intersection points algorithm for piecewise algebraic curves based on Groebner bases
    Lang, Feng-Gong
    Wang, Ren-Hong
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2009, 29 (1-2) : 357 - 366