/img alt="Imagem da capa" class="recordcover" src="""/>
Tese
Análise de desempenho de algoritmos para classificação de sequências representando faltas do tipo curto-circuito em linhas de transmissão de energia elétrica
Maintaining power quality in electrical power systems depends on addressing the major disturbances that may arise in their generation, transmission and distribution. Within this context, many studies have been developed aiming to detect and classify short circuit faults in electrical systems through...
Autor principal: | FREIRE, Jean Carlos Arouche |
---|---|
Grau: | Tese |
Idioma: | por |
Publicado em: |
Universidade Federal do Pará
2020
|
Assuntos: | |
Acesso em linha: |
http://repositorio.ufpa.br:8080/jspui/handle/2011/12282 |
Resumo: |
---|
Maintaining power quality in electrical power systems depends on addressing the major disturbances that may arise in their generation, transmission and distribution. Within this context, many studies have been developed aiming to detect and classify short circuit faults in electrical systems through the analysis of the electrical signal behavior. Transmission line fault classification systems can be divided into two types: online and post fault classification systems. In the post-missing scenario the signal sequences to be evaluated for classification have variable length (duration). In sequence classification it is possible to use conventional classifiers such as Artificial Neural Networks, Support Vector Machine, K-nearest neighboors and Random forest. In these cases, the classification process usually requires a sequence preprocessing or a front end stage that converts the raw data into sensitive parameters to feed the classifier, which may increase the computational cost of the classification system. An alternative to this problem is the FBSC-FrameBased-Sequence Classification (FBSC) architecture. The problem with FBSC architecture is that it has many degrees of freedom in designing the model (front end plus classifier) and it should be evaluated using a complete dataset and rigorous methodology to avoid biased conclusions. Considering the importance of using efficient short-circuit fault classification methodologies and mainly with low computational cost, this paper presents the results of the KNN-DTW (K-Nearest Neighbor) algorithm analysis study associated with Dynamic similarity measurement. Time Warping (DTW) and HMM (Hidden Markov Model) algorithm for fault classification task. These two techniques allow the direct use of data without the need for front ends for signal pre-processing, as well as being able to handle multivariate and variable time series, such as signal sequences for the post-miss case. To develop the two proposed systems for classification, simulated data of short-circuit faults from the UFPAFaults public database were used. To compare results with methodologies already presented in the literature for the problem, the FBSC architecture was also evaluated for the same database. In the case of FBSC architecture, different front ends and classifiers were used. The comparative assessment was performed from the measurement of error rate, computational cost and statistical tests. The results showed that the HMM-based classifier was more suitable for the problem of classification of short circuits on transmission lines. |