IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5360302.html
   My bibliography  Save this article

Research on Low-Resistance Grounding Fault Line Selection Based on VMD with PE and K-Means Clustering Algorithm

Author

Listed:
  • Wensi Cao
  • Chen Li
  • Zhaohui Li
  • Shuo Wang
  • Heyuan Pang
  • Yuxing Li

Abstract

Aiming at the fault line selection problem in the single-phase grounding system of the distribution network, a new fault line selection method based on VMD and permutation entropy feature extraction combined with K-means clustering algorithm is proposed. This method is a hybrid algorithm that can effectively identify fault line selection. Firstly, a simulation model is built and its zero sequence current is collected. The variational modal decomposition method is used to decompose the collected zero-sequence current into multiple intrinsic modal functions, which can not only effectively reduce the influence of harmonic components and noise in the characteristic signal but also facilitate the calculation. The extracted intrinsic mode function is calculated by permutation entropy (PE), and the calculated entropy value is constructed into a matrix to highlight the fault characteristics of the line; then, the matrix is subjected to K-means cluster analysis through the preprocessing algorithm and the faulty line is correctly distinguished. Then, regression verification is performed. Finally, it is verified by the recorded wave data of the real test site and then analyzed and compared with other algorithms. The proposed method shows that when a single-phase ground fault occurs, the ground fault line selection can be effectively identified under different transition resistances, grounding resistances, and fault distances. Therefore, this method can accurately identify the fault line selection, and the accuracy rate is 100%, which has a certain use value.

Suggested Citation

  • Wensi Cao & Chen Li & Zhaohui Li & Shuo Wang & Heyuan Pang & Yuxing Li, 2022. "Research on Low-Resistance Grounding Fault Line Selection Based on VMD with PE and K-Means Clustering Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-17, February.
  • Handle: RePEc:hin:jnlmpe:5360302
    DOI: 10.1155/2022/5360302
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/5360302.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/5360302.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/5360302?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:5360302. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.