A Tractable Failure Probability Prediction Model for Predictive Maintenance Scheduling of Large-Scale Modular-Multilevel-Converters

A Tractable Failure Probability Prediction Model for Predictive Maintenance Scheduling of Large-Scale Modular-Multilevel-Converters

Fu, J. (TU Delft Team Bart De Schutter; Dalian Maritime University)
Peyghami, Saeed (Aalborg University)
Nunez, Alfredo (TU Delft Railway Engineering)
Blaabjerg, Frede (Aalborg University)
De Schutter, B.H.K. (TU Delft Delft Center for Systems and Control)

Delft Center for Systems and Control

2023

Predictive maintenance scheduling of modular-multilevel-converters (MMCs) requires estimations of the failure probabilities of MMCs during a period of time in the future. Particularly, the predicted future failure probabilities are influenced by two main factors, the mission profiles of the MMCs and the maintenance decisions on the MMCs during the prediction period. This paper proposes a failure probability prediction model (FPM) for MMCs by considering these two factors. First, the expectations of the failure probabilities of the components for all the scenarios of mission profiles are obtained. Second, in predictive maintenance scheduling problems, the decisions to perform the maintenance actions are represented by binary variables. When the number of submodules is very large, using the binomial probability form currently used in reliability engineering to express the 'r-out-of-n' failure probability of arms of the MMCs is intractable. Thus, this paper proposes a tractable form (T-form) in FPM by observing that the submodules on one arm are homogeneous. Furthermore, an approximation method, i.e., clustering and assignment (C&A), is proposed to reduce the computation times for calculating the parameters needed by the proposed T-form. Then, we perform a case study that assesses the accuracy and computation time of the C&A approach. The results show that the accuracy of the C&A approach is high and that the computation time is reduced significantly compared with the accurate method. We also show that the computation time for solving the predictive maintenance scheduling problem can be reduced hugely by using the T-form instead of the binomial probability form.

http://resolver.tudelft.nl/uuid:ee148827-c765-4afc-bade-fbef69a2f773

https://doi.org/10.1109/TPEL.2023.3241317

2023-08-01

0885-8993

IEEE Transactions on Power Electronics, 38 (5), 6533-6544

Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Institutional Repository

journal article

© 2023 J. Fu, Saeed Peyghami, Alfredo Nunez, Frede Blaabjerg, B.H.K. De Schutter