Optimal PMU placement based on Taguchi method considering N-1 condition

被引:0
|
作者
Chen, Gang [1 ]
Tang, Yi [1 ]
Zhang, Jihong [2 ]
Lin, Li [1 ]
机构
[1] State Key Laboratory of Power Transmission Equipment and System Security and New Technology, Chongqing University, Chongqing 400044, China
[2] Chongqing Electric Power Trading Center, Chongqing Municipal Electric Power Company, Chongqing 400014, China
关键词
Design - Observability - Taguchi methods - Cost benefit analysis - Complex networks;
D O I
暂无
中图分类号
学科分类号
摘要
The traditional PMU placement methods may be unable to observe the power system under the N-1 condition, while PMU placement methods fully considering the N-1 condition need too many PMUs to ensure the observability of entire power system. In order to overcome the shortcomings of the above methods, this paper presents a PMU placement method with better cost-benefit ratio. It is based on the principles of Taguchi robust design method. Based on the complex network theory, a set of integrated vulnerability indices calculated by complementary vulnerability index set are used to identify the important lines in the system. By doing so, the aim of the design is focused on ensuring the important lines' observability and the robustness of the placement plan under the N-1 noise. In the design, the Taguchi quality characteristic and the signal noise ratio indices are calculated to measure the PMU placement plan's observability capabilities and robustness under the N-1 noise. Finally, a two stage optimization procedure is used to determine the final plan. A sample system is used to test the performance of the PMU placement plan, and the results show that the method is very effective and practical. © 2010 State Grid Electric Power Research Institute Press.
引用
收藏
页码:28 / 32
相关论文
共 50 条
  • [31] Customized Optimal μPMU Placement Method for Distribution Networks
    Chen, Xuebing
    Chen, Tengpeng
    Tseng, King Jet
    Sun, Yuhao
    Amaratunga, Gehan
    2016 IEEE PES ASIA-PACIFIC POWER AND ENERGY ENGINEERING CONFERENCE (APPEEC), 2016, : 135 - 140
  • [32] Optimal PMU Placement with Uncertainty Using Pareto Method
    Ketabi, A.
    Nosratabadi, S. M.
    Sheibani, M. R.
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2012, 2012
  • [33] Optimal PMU placement for power system observability using Taguchi binary bat algorithm
    Vedik, Basetti
    Chandel, Ashwani K.
    MEASUREMENT, 2017, 95 : 8 - 20
  • [34] Multiple Solutions for Optimal PMU Placement Using a Topology-Based Method
    Chejarla M.K.D.
    Matam S.K.
    Chejarla, Madhu Kishore Devara (chejarlamadhukishore@gmail.com), 1600, Springer (102): : 249 - 259
  • [35] Stochastic Optimal Transmission Switching Considering N-1 Security Constraints
    Zhang, Heng
    Cheng, Haozhong
    Zhang, Jianping
    Lu, Jianzhong
    Li, Cong
    2018 IEEE POWER & ENERGY SOCIETY GENERAL MEETING (PESGM), 2018,
  • [36] Optimal Allocation of Energy Storage Considering N-1 Security Constraints Based on Chance Constraints
    Sha Q.
    Wang W.
    Gongcheng Kexue Yu Jishu/Advanced Engineering Sciences, 2019, 51 (04): : 147 - 156
  • [37] An Optimal Placement Method of Oscillation Monitoring Devices Considering the Uncertainty of Operation Condition
    Song, Zihong
    Wang, Yang
    2023 5TH ASIA ENERGY AND ELECTRICAL ENGINEERING SYMPOSIUM, AEEES, 2023, : 714 - 718
  • [38] An Optimal Scheme for PMU Placement based on Generators Grouping
    Yang, Songhao
    Zhang, Baohui
    Hojo, Masahide
    Yamanaka, Kenji
    2016 IEEE PES ASIA-PACIFIC POWER AND ENERGY ENGINEERING CONFERENCE (APPEEC), 2016, : 2260 - 2264
  • [39] Observability enhancement by optimal PMU placement considering random power system outages
    Aminifar F.
    Fotuhi-Firuzabad M.
    Shahidehpour M.
    Khodaei A.
    Energy Systems, 2011, 2 (01) : 45 - 65
  • [40] On the Optimal Placement of Micro-PMU in Distribution Networks Considering Phase Strings
    Anguswamy, Manoj Prabhakar
    Datta, Manoj
    Meegahapola, Lasantha
    Vahidnia, Arash
    2021 IEEE PES INNOVATIVE SMART GRID TECHNOLOGIES - ASIA (ISGT ASIA), 2021,