Fault detection of broken rotor bar in LS-PMSM using random forests
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
This paper proposes a new approach to diagnose broken rotor bar failure in a line start-permanent magnet synchronous motor (LS-PMSM) using random forests. The transient current signal during the motor startup was acquired from a healthy motor and a faulty motor with a broken rotor bar fault. We extracted 13 statistical time domain features from the startup transient current signal, and used these features to train and test a random forest to determine whether the motor was operating under normal or faulty conditions. For feature selection, we used the feature importances from the random forest to reduce the number of features to two features. The results showed that the random forest classifies the motor condition as healthy or faulty with an accuracy of 98.8% using all features and with an accuracy of 98.4% by using only the mean-index and impulsion features. The performance of the random forest was compared with a decision tree, Naive Bayes classifier, logistic regression, linear ridge, and a support vector machine, with the random forest consistently having a higher accuracy than the other algorithms. The proposed approach can be used in industry for online monitoring and fault diagnostic of LS-PMSM motors and the results can be helpful for the establishment of preventive maintenance plans in factories.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Pandya, D. H., Upadhyay, S. H., & Harsha, S. P. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.01.033 · Cited by 350 · cited 1×
“Similar techniques have also been used to analyze vibration [12–16] and acoustic [17] signals of induction motors.”
MethodKarami, M., Mariun, N., Rezazadeh Mehrjou, M., Ab Kadir, M. Z. A., Misron, N., & Mohd Radzi, M. A. (2014) · Mathematical Problems in Engineering · doi:10.1155/2014/132647 · Cited by 31
Self-citation
Cited by
Machine Learning in Predictive Maintenance towards Sustainable Smart Manufacturing in Industry 4.0
Çınar, Z. M., Abdussalam Nuhu, A., Zeeshan, Q., Korhan, O., Asmael, M., & Safaei, B. (2020) · Sustainability · doi:10.3390/su12198211 · Cited by 834
Chen, W., Li, Y., Xue, W., Shahabi, H., Li, S., Hong, H., Wang, X., Bian, H., Zhang, S., Pradhan, B., et al. (2020) · Science of The Total Environment · doi:10.1016/j.scitotenv.2019.134979 · Cited by 505
Syafrudin, M., Alfian, G., Fitriyani, N. L., & Rhee, J. (2018) · Sensors · doi:10.3390/s18092946 · Cited by 401
“In the case of fault prediction, machine learning algorithms such as Random Forest are highly effective in detecting abnormal events in a process and thus can help avoid productivity loss [47–49].”
MethodAli, S. A., Parvin, F., Vojteková, J., Costache, R., Linh, N. T. T., Pham, Q. B., Vojtek, M., Gigović, L., Ahmad, A., & Ghorbani, M. A. (2021) · Geoscience Frontiers · doi:10.1016/j.gsf.2020.09.004 · Cited by 249
Bhuiyan, E. A., Akhand, M. M. A., Das, S. K., Ali, M. F., Tasneem, Z., Islam, M. R., Saha, D. K., Badal, F. R., Ahamed, M. H., & Moyeen, S. I. (2020) · International Journal of Automation and Computing · doi:10.1007/s11633-020-1250-3 · Cited by 68
Metadata
- Authors
- Quiroz, J. C., Mariun, N., Mehrjou, M. R., Izadi, M., Misron, N., & Mohd Radzi, M. A.
- Venue
- Measurement
- Publisher
- Elsevier BV
- Published
- 2018-02
- Volume
- 116
- Pages
- 273-280
- ISSN
- 0263-2241 (ISSN-L)
- OpenAlex
- W2767634046
- Cited by
- 148
- References
- 3
- FWCI
- 6.72
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.