Processing math: 18%
A journal of IEEE and CAA , publishes high-quality papers in English on original theoretical/experimental research and development in all areas of automation
Chuang Chen, Ningyun Lu, Bin Jiang and Cunsong Wang, "A Risk-Averse Remaining Useful Life Estimation for Predictive Maintenance," IEEE/CAA J. Autom. Sinica, vol. 8, no. 2, pp. 412-422, Feb. 2021. doi: 10.1109/JAS.2021.1003835
Citation: Chuang Chen, Ningyun Lu, Bin Jiang and Cunsong Wang, "A Risk-Averse Remaining Useful Life Estimation for Predictive Maintenance," IEEE/CAA J. Autom. Sinica, vol. 8, no. 2, pp. 412-422, Feb. 2021. doi: 10.1109/JAS.2021.1003835

A Risk-Averse Remaining Useful Life Estimation for Predictive Maintenance

doi: 10.1109/JAS.2021.1003835
Funds:  This work was support by Natural Science Foundation of China (61873122)
More Information
  • Remaining useful life (RUL) prediction is an advanced technique for system maintenance scheduling. Most of existing RUL prediction methods are only interested in the precision of RUL estimation; the adverse impact of over-estimated RUL on maintenance scheduling is not of concern. In this work, an RUL estimation method with risk-averse adaptation is developed which can reduce the over-estimation rate while maintaining a reasonable under-estimation level. The proposed method includes a module of degradation feature selection to obtain crucial features which reflect system degradation trends. Then, the latent structure between the degradation features and the RUL labels is modeled by a support vector regression (SVR) model and a long short-term memory (LSTM) network, respectively. To enhance the prediction robustness and increase its marginal utility, the SVR model and the LSTM model are integrated to generate a hybrid model via three connection parameters. By designing a cost function with penalty mechanism, the three parameters are determined using a modified grey wolf optimization algorithm. In addition, a cost metric is proposed to measure the benefit of such a risk-averse predictive maintenance method. Verification is done using an aero-engine data set from NASA. The results show the feasibility and effectiveness of the proposed RUL estimation method and the predictive maintenance strategy.

     

  • IMPROVING operation quality and reducing operation costs are two major concerns in many enterprises [1]–[3]. Unexpected downtimes often mean unbearably high costs. Orienting at Industry 4.0 or made in China 2025, maintenance technology is more attracted to predictability [4]. Based on online condition monitoring information, predictive maintenance (PdM) can output some indicators to show the levels of system health states or the estimation of their remaining useful life (RUL) [5]. These indicators can assist maintenance decision-making, such as to obtain the optimal maintenance time and the ordering time of spare parts. There is an increasingly common view that PdM outperforms traditional maintenance strategies such as time-based maintenance and corrective maintenance. It has attracted considerable attentions in recent years [6]–[10].

    RUL estimation is the most important step in a PdM strategy. With the estimated RUL, one can schedule maintenance activities confidently for a degrading system [11]–[13]. There are many studies attempting to improve the precision of RUL estimation. However, few of them considered it from a maintenance perspective. Maintenance scheduling is the ultimate goal of RUL prognostics. In general, an under-estimated RUL is better than an over-estimated one under the same or close prediction error, because with over-estimated RUL, the risk of unexpected shutdowns will surge and may sometimes cause disastrous consequences. Therefore, it is necessary and significant to properly correct the misleading RUL estimation and then reduce possible wrong decisions of maintenance scheduling.

    To do so, a risk-averse RUL estimation method is proposed for predictive maintenance. Firstly, features that can reflect system degradation trend are selected. Then, the latent structure between degradation features and the RUL labels is modeled by a support vector regression (SVR) algorithm and a long short-term memory (LSTM) network separately, since SVR and LSTM are currently two well recognized prognostics tools. To enhance the robustness of prognostics and increase their marginal utility, the SVR model and the LSTM model are combined via three connection parameters to generate a new hybrid model. The risk-averse adaptation is realized by optimizing the three connection parameters to minimize a cost function online. From the perspective of maintenance scheduling, a cost metric is also developed for measuring the benefit provided by risk-averse prognostics.

    The remainder of this paper is organized as follows. Section II reviews the related work. Section III presents a risk-averse RUL estimation method for predictive maintenance. The major steps include selection of degradation features, prognostic model training, risk-averse adaptation, and online prognostics. Verification is conducted using the NASA data set of aero-engines in Section IV. Section V draws the conclusions and discusses the possible future work.

    This section presents the state-of-art of RUL prognostics in recent years. From the perspective of prognostic procedures, these existing RUL prognostics studies can be roughly divided into three branches: degradation state based, regression based, and pattern matching based prognostic methods [14].

    For degradation state based methods, RUL is usually estimated in two steps: estimating system health state and then inferring the RUL using a failure threshold. For instance, a fuzzy c-means algorithm was employed to partition the run-to-failure condition monitoring data, and the final RUL was estimated by a multivariate health estimation model and a multivariate degradation prediction model [15]. In [16], the run-to-failure data were divided into four states using several belief functions, and RUL was estimated as the transition duration from the degraded state to the failure state. In [17], RUL was estimated by projection with the combination of degradation modeling and a particle filter algorithm, where the parameters of probability distribution at the last step of online updating were regarded as the final RUL distribution.

    The regression based methods are devoted to predicting the evolution behavior of a degradation indicator so that the estimation of RUL can be obtained when the degradation indicator reaches an end-of-life (EOL) criterion. In this branch, support vector regression (SVR) is the mainstream technology. For example, in [18], a particle swarm optimization algorithm was employed to optimize the configuration parameters of SVR; the estimated RUL was obtained by the SVR based one-step time series prediction [19]. In [20], a particle filter and an SVR were combined to estimate the capacity degradation of a lithium-ion battery, and the RUL was defined by the probability distribution parameters.

    The above two branches of prognostic methods are strongly dependent on the setting of such failure threshold, which is a challenging issue in practice. The pattern matching based method raises attentions alternatively. They aim to identify the right trend along with its EOL value from the sample datasets. In [21], the degradation was represented as one-dimensional health indicator trajectory using linear regression, and the RUL of the current sample was obtained by comprehensive analysis of similar trajectories. Similar ideas can be found in [22]–[24]. However, the pattern matching method relies on the quality of the sample’s datasets. In the absence of matched patterns, the estimated result is quite wayward.

    Recently, two new RUL prognostics methods, which require no estimation of health states or setting of failure threshold, have been published [14], [25]. They attempt to build the direct mapping relationship between degradation features and RUL using data-driven techniques. In [14], SVR was used to build such a direct relationship. In [25], long short-term memory (LSTM) networks were employed. The two models have shown their advantages in higher prognostics precision.

    Generally speaking, for a single prediction model, prediction precision shows a trend of diminishing marginal utility [26]. One possible solution is to develop a hybrid model which can maintain the positive parts of each modeling method and prevent the diminishing marginal utility problem of a simple prediction model. For this purpose, a hybrid model that combines the SVR and LSTM models is considered in this paper. Further, on the basis of [14] and [25], the risk-averse adaptation is investigated to contribute to predictive maintenance, which is the main contribution of this paper.

    The scheme of the proposed risk-averse RUL estimation based predictive maintenance strategy is shown in Fig. 1. It contains two phases: offline training and online application.

    Figure  1.  Framework of the proposed PdM strategy.

    In the offline phase, the raw run-to-failure data (with known EOLs) are first transformed into a set of features using the degradation feature selection module. The features should reflect the degradation trend of the system. Next, the SVR and LSTM models are separately trained for learning the relationship between the features and the RULs. Also, the two models are fused by several connection parameters, and the parameters are determined using an evolutionary algorithm.

    In the online phase, the online condition monitoring data (with unknown EOL) are collected and appended to get a section of trajectories, and then processed in the same manner as that in the offline phase to extract degradation features. Right after, the features are fed into the well-trained SVR and LSTM models, and the two models output the estimated RULs independently. The ultimate RUL estimation is obtained by the risk-averse hybrid model for maintenance decision-making.

    The process of degradation feature selection can be illustrated in Fig. 2. Usually, system degradation is a slow and monotonic process, which means that the degradation features should exhibit certain tendencies [27]. Moving average is a simple but effective skill for tendency extraction. Given a time series {s1,s2,,sl}, using moving average, the degradation trend (namely the degradation features discussed below) can be obtained, i.e.,

    Figure  2.  Process of degradation feature selection.
    γi=si+si1++sin+1n,i=n,n+1,,l (1)

    where si denotes the monitored indicator of system at moment i, and n is the moving window size.

    Irrelevant or redundant features affect the performance of learning algorithms. Therefore, it is necessary to eliminate such features and only maintain contributory ones. Correlation and consistency indicators [15] can be employed for such purposes.

    The correlation indicator reflects the linear correlation between a feature and the length of an observed sequence, which is formulized as

    Corr=16li=1d2i(γi)l(l21) (2)

    where di(γi) denotes the difference between ranks for each γi and i. More precisely, the data sets {γi}li=1 and {i}li=1 can be rearranged in numerical order from large to small, and the difference between ranks for each γi and i is the position difference of γi and i in the sorted data sets. The correlation indicator ranges from –1 to 1, and a feature with greater absolute value of Corr implies stronger linear correlations.

    The consistency indicator reflects the consistent tendency of a feature in all samples, which can be calculated by

    Con=1NNj=1ρ(Corrj) (3)

    where N is the number of samples and ρ(x)={1x>00.5x=00x<0. The consistency indicator ranges from 0 to 1, and a feature with a consistency indicator of 0 or 1 indicates that the degradation trend is completely identical for all samples.

    Thus, the rule for extracting the degradation features is to choose the features that satisfy the conditions, |Corr|ϑ and Con=0or1. Here, ϑ is the correlation threshold and is generally set between 0.5 and 1.

    This step is to develop a model that can accurately describe the relationship between the degradation features and the corresponding RUL, i.e.,

    RUL=F(features). (4)

    To the best of our knowledge, SVR and LSTM models are currently two well recognized prognostics models. SVR model was developed from support vector machine (SVM). With an error range, the predicted value falling within the error range is regarded as the correct prediction [28]. SVR is effective in establishing nonlinear mapping relationships because its learning algorithm comes from a convex optimization problem. However, it cannot handle dependencies amongst multiple time series, so it lacks the overall perception ability. LSTM model is a special type of neural network which can handle dependency between successive steps. The mapping relationship is realized by the cooperation of three gates (input gate, forget gate and output gate) [29], [30]. Nevertheless, the LSTM model structure is difficult to optimize, and as a result, its performance is difficult to improve.

    As stated before, a hybrid model can maintain the positive aspects of each modeling method and prevent the diminishing marginal utility problem of simple prediction models. Thus, a hybrid model that combines the SVR and LSTM models is developed via three connection parameters (w1, w2, b), as illustrated in Fig. 3. It is noted that to be exact, the ε-SVR and vanilla LSTM models are chosen according to [14] and [25]. The fusion structure enables information exchange between the two models. Through such information exchange, a better RUL estimation can be achieved.

    Figure  3.  Fusion structure of SVR and LSTM models.

    In Fig. 3, ˆySVR and ˆyLSTM denote the estimated RULs of SVR and LSTM models respectively; while ˆySVR and ˆyLSTM denote the normalized values calculated by

    ˆySVR=ˆySVRmin (5)
    \hat y_{L\!S\!T\!M}^\dagger = \frac{{{{\hat y}_{L\!S\!T\!M}} - \min ({{\hat y}_{L\!S\!T\!M}})}}{{\max ({{\hat y}_{L\!S\!T\!M}}) - \min ({{\hat y}_{L\!S\!T\!M}})}} (6)

    where \min ( \cdot ) and \max ( \cdot ) denote the minimum and maximum operations, respectively. Besides, the parameters {w_1} and {w_2} denote the weights of SVR and LSTM models, respectively, while the parameter b denotes the bias of the hybrid model. Based on a hyperbolic tangent activation function, the estimated RUL, denoted by {\hat y^\dagger }, is gained as

    \begin{split} {{\hat y}^\dagger } \; &= \tanh \left( {\left[ {{w_1},\;{w_2}} \right]\left[ \begin{array}{l} \hat y_{S\!V\!R}^\dagger \\ \hat y_{L\!S\!T\!M}^\dagger \\ \end{array} \right] + b} \right) \\ & = \frac{{{e^{{w_1}\hat y_{S\!V\!R}^\dagger + {w_2}\hat y_{L\!S\!T\!M}^\dagger + b}} - {e^{ - ({w_1}\hat y_{S\!V\!R}^\dagger + {w_2}\hat y_{L\!S\!T\!M}^\dagger + b)}}}}{{{e^{{w_1}\hat y_{S\!V\!R}^\dagger + {w_2}\hat y_{L\!S\!T\!M}^\dagger + b}} + {e^{ - ({w_1}\hat y_{S\!V\!R}^\dagger + {w_2}\hat y_{L\!S\!T\!M}^\dagger + b)}}}}. \end{split} (7)

    It should be noted that, the activation function of (7) is adopted to handle the nonlinearity of the fusion structure. The fusion structure can be a simple linear expression. However, linear expressions often do not perform well compared with the above nonlinear form. Observed from (7), the range of hyperbolic tangent activation function is between −1 and 1, and this also explains the purpose of normalization using (5) and (6).

    Lastly, the RUL estimation is obtained after an inverse normalization, i.e.,

    \hat y = {\hat y^\dagger }(U - L) + L (8)

    where U and L denote the upper and lower bounds associated with {\hat y_{S\!V\!R}} and {\hat y_{L\!S\!T\!M}}, and it is obvious that U is between \max ({\hat y_{S\!V\!R}}) and \max ({\hat y_{L\!S\!T\!M}}), while L is between \min ({\hat y_{S\!V\!R}}) and \min ({\hat y_{L\!S\!T\!M}}). For simplification, one can take their midpoints, i.e.,

    U = \frac{{\max ({{\hat y}_{S\!V\!R}}) + \max ({{\hat y}_{L\!S\!T\!M}})}}{2} (9)
    L = \frac{{\min ({{\hat y}_{S\!V\!R}}) + \min ({{\hat y}_{L\!S\!T\!M}})}}{2}. (10)

    Now, the remaining problem is to determine the three parameters ({w_1}, {w_2} and b) to meet the design requirement of risk-averse adaptation.

    It is a common view that underestimated RUL is relatively better than the overestimated one under the same or close prediction error. Accordingly, the hybrid model should consider the objective of reducing the overestimation rate while maintaining a reasonable underestimation level. In this context, the error function below is given to incline more to the underestimated RUL, i.e.,

    e = \left\{ \begin{aligned} & \hat y - y,\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;{\rm{if}}\;\;\hat y - y \leq 0 \\ & ({C_c}/{C_p})(\hat y - y)\;,\;\;{\rm{if}}\;\;\hat y - y > 0 \end{aligned} \right. (11)

    where y is an actual RUL, \hat y is the predicted one, {C_c} is the corrective maintenance cost, and {C_p} is the preventive maintenance cost. Here, {C_p} refers to all costs associated with the preventive maintenance actions, such as replacing the worn parts with new ones, system cleaning and adjustment, and the inventory cost of spare parts. {C_c} refers to the total cost due to sudden failure, including human damage cost, equipment damage cost, and out-of-stock cost in the case of unavailable spare parts. {C_c}/{C_p} is the penalty multiplier for the overestimation error. For example, one has to pay ¥ 1000 for corrective maintenance when the system suddenly fails, whereas preventive maintenance only costs ¥ 100 if well-timed preventive maintenance activities are taken. To be reasonable, the extra cost should be borne by the over- estimated RUL, and the penalty multiple for overestimation error should be 10.

    Thereupon, the minimization error function (cost function) is defined as

    \begin{split} \min \;z =\;& \frac{{\sum\nolimits_{j = 1}^N {\sum\nolimits_{i,\;\hat y_i^j - y_i^j \leq 0}^{{l_j}} {\left| {\hat y_i^j - y_i^j} \right|} } }}{{\sum\nolimits_{j = 1}^N {{l_j}} }} \\ & +\frac{{\sum\nolimits_{j = 1}^N {\sum\nolimits_{i,\;\hat y_i^j - y_i^j > 0}^{{l_j}} {\left| {({C_c}/{C_p})(\hat y_i^j - y_i^j)} \right|} } }}{{\sum\nolimits_{j = 1}^N {{l_j}} }} \end{split} (12)

    where {l_j} is the RUL sequence length of the j-th sample. With this penalty mechanism, the cost function forces the prognostics to shift from overestimation to underestimation. The values of {w_1}, {w_2}, and b are selected by minimizing the function (12).

    Considering the complexity of (12), it is difficult to get a closed-form solution. From a usability standpoint, one can obtain a group of feasible sub-optimal solutions rather than a closed-form optimal solution by using evolution algorithms [31]. In this paper, the grey wolf optimization (GWO) algorithm is selected to estimate the values of {w_1}, {w_2}, and b.

    GWO algorithm is an emerging technique in the field of evolutionary algorithms. It is inspired by the intelligent activities of grey wolf population hunting and has been proved to be superior to traditional algorithms, such as genetic algorithm (GA), particle swarm optimization (PSO) algorithm, and differential evolution (DE) algorithm [32]. Unfortunately, the GWO algorithm generates an initial population in a random manner. Although the initial population has a certain population diversity, the population level may not be good, affecting the convergence speed and precision of the algorithm. After randomly generating the initial population, embedding a selection operator will help improve the optimization performance of the GWO algorithm [33]. In addition, the GWO algorithm must balance the global searching and the local searching. Without an effective balance mechanism, the algorithm may fall into local optimum. To overcome this problem, one can modify the convergence factor. More specifically, the linear convergence factor is replaced by a nonlinear convergence factor. The nonlinear convergence factor will drive the algorithm to search globally in the early stage, and turn to local searching later. This improved algorithm is named as GWO-II algorithm in this paper.

    Fig. 4 shows the implementation process of the GWO-II algorithm. Based on the GWO-II algorithm, the three parameters ({w_1}, {w_2}, b) can be solved by the following steps.

    Figure  4.  Implementation process of GWO-II algorithm.

    Step 1: Initialize the parameters, including the population size S, the maximum number of iterations T, and each individual position {Q_k} = ({w_1},{w_2},b) with k = 1,2, \ldots,S.

    Step 2: Embed a selection operator. The fitness values of all individuals in the population are first calculated according to (12). Subsequently, these fitness values are arranged in ascending order. All individuals are divided into the front, middle, or back segment. Individuals in the front are better solutions. Finally, each segment is randomly selected according to the proportion of 1.0, 0.8, and 0.6. For the individuals who lost 20% in the middle segment and 40% in the back segment, the individuals in the front segment are supplemented to form a new population with the same population size.

    Step 3: Find out the three most influential grey wolves in the new population. They are noted as \alpha , \beta , and \delta in turn. The three wolves will lead the population to surround, hunt and attack the prey (target solution).

    Step 4: Calculate the convergence factor and update the coefficient vectors. The proposed convergence factor \varpi is reduced from 2 to 0 in a nonlinear way of (13). After that, the coefficient vectors A and C can be updated by (14) and (15).

    \varpi = 2 - 2{\left( {\frac{{{e^{t/T}} - 1}}{{e - 1}}} \right)^2} (13)
    A = 2\varpi \cdot {r_1} - \varpi \qquad (14)
    C = 2 \cdot {r_2}\;\;\qquad\qquad (15)

    where t is the current number of iterations, and {r_1} and {r_2} are the random vectors between [0,1].

    Step 5: Update the positions of the three best wolves by

    {Q_\alpha }(t + 1) = {Q_\alpha }(t) - {A_1}\left| {{C_1}{Q_\alpha }(t) - Q(t)} \right| (16)
    {Q_\beta }(t + 1) = {Q_\beta }(t) - {A_2}\left| {{C_2}{Q_\beta }(t) - Q(t)} \right| (17)
    {Q_\delta }(t + 1) = {Q_\delta }(t) - {A_3}\left| {{C_3}{Q_\delta }(t) - Q(t)} \right|. (18)

    Step 6: Update the individual position by

    Q(t + 1) = \frac{{{Q_\alpha }(t + 1) + {Q_\beta }(t + 1) + {Q_\delta }(t + 1)}}{3}. (19)

    Step 7: Terminate the algorithm if the termination criterion is reached and output the optimal individual position. Otherwise, go back to Step 3 and continue the algorithm.

    The well-trained SVR and LSTM models together with the obtained optimal connection parameters ({w_1}, {w_2}, and b) can result in a high-performance hybrid model, which will be used to predict the RUL online. With the online monitoring data of an in-service system, we seek to predict how long the system can be operated safely, that is, to predict the time span between the current moment and the future true system failure moment.

    Fig. 5 illustrates the RUL estimation for an in-service system. Suppose that there are currently available monitoring data from time 1 to K and three feature sequences (denoted by {x_1}, {x_2}, and {x_3}) are extracted from the available monitoring data. The SVR and LSTM models constitute the hybrid model, whereas the two base models have different prediction strategies. As for the LSTM model, it needs to handle the dependency between successive steps, but the SVR model does not. Therefore, the two models must be treated differently when predicting the RUL. In fact, the SVR model directly receives the feature vector (x_1^K,x_2^K,x_3^K) of the K-th moment and produces the estimated RUL, \hat y_K^{SVR}. Regarding the LSTM model, it feeds on the three feature sequences and outputs a RUL sequence with K predictions, \hat y_1^{LSTM}, \; \ldots, \hat y_k^{LSTM},\; \ldots,\hat y_K^{LSTM}. Among them, the \hat y_K^{LSTM} represents the estimated RUL of the LSTM model. When the \hat y_K^{SVR} and \hat y_K^{LSTM} are given to the fusion structure with the obtained optimal connection parameters ({w_1}, {w_2}, and b), the final estimated RUL {\hat y_K} is obtained. Hence, a failure may occur at time K + {\hat y_K}.

    Figure  5.  Illustration of RUL estimation for an in-service system.

    With the estimated RUL of the in-service system, one can schedule the maintenance activity, as shown in Fig. 6. Clearly, preventive maintenance activity should be implemented before the estimated failure time. Assuming that the time margin of the reliability is \eta , the maintenance activities will be taken at time K + {\hat y_K} - \eta .

    Figure  6.  Illustration of maintenance scheduling.

    There are two possible scenarios in real-world maintenance activities. If the scheduled preventive maintenance moment is conducted earlier than the actual failure moment of the in-service system, the preventive maintenance is effective. On the other hand, if the in-service system fails earlier than the scheduled preventive maintenance moment, the preventive maintenance is void and corrective maintenance must be taken.

    The maintenance cost rate (MCR), defined as the ratio between the total maintenance cost and total life cycle duration, can be used to estimate the performance of the RUL estimation. The estimated RUL with lower MCR is considered to have better performance. It intends to measure the benefit provided by risk-averse prognostics. When the in-service system still works but the preventive maintenance is performed, the MCR is given by

    MC{R_p} = \frac{{{C_p}}}{{K + {{\hat y}_K} - \eta }}. (20)

    On the other hand, if the system fails, corrective maintenance must be carried out. In this event, the total maintenance cost is {C_c} and the total life cycle duration is K + y. Thus, according to the definition of MCR, the MCR of the corrective maintenance is given by

    MC{R_c} = \frac{{{C_c}}}{{K + y}}. (21)

    In general, the prediction accuracy of a model is between 50% and 100%. The 100% prediction accuracy means perfect prognostics, whereas the 50% prediction accuracy implies unsatisfactory prediction results. In this sense, the estimated failure time in (20) is supposed to satisfy 0.5(K + y) \leq K + {\hat y_K} \leq K + y. Thus, for the ideal PdM case with perfect prognostics, the MCR becomes

    MC{R_{ideal}} = \frac{{{C_p}}}{{K + y}}. (22)

    It is worth noting that the ideal PdM case is only an ideal hypothesis which cannot be achieved in practice. However, the MC{R_{ideal}} can help understand the gap between reality and ideal. In addition, this inequality, 0.5(K + y) \leq K + {\hat y_K} - \eta, can also be satisfied considering that the time margin \eta is usually small. As mentioned before, the corrective maintenance is more expensive than the preventive maintenance and this means that {C_c} > 2{C_p} is reasonable. Through 0.5(K + y) \leq K + {\hat y_K} - \eta and {C_c} > 2{C_p}, one can get {({{C_c}})}/{({K + y})} > {({{C_p}})}/{({K + {{\hat y}_K} - \eta })}. Therefore, the proposed cost metric tends to favor lead prediction. In other words, the overestimated RUL will be more costly than the underestimated RUL.

    To verify the performance of the proposed risk-averse RUL estimation method and the PdM strategy, a turbofan engine degradation simulation dataset [34] is considered. The dataset consists of multivariate time series signals generated by C-MAPSS. Fig. 7 shows a sketch of the main components of the turbofan engine, including the fan, low-pressure compressor (LPC), high-pressure compressor (HPC), high pressure turbine (HPT), and low pressure turbine (LPT). A total of 21 signals that can describe the degradation process were generated, as shown in Table I. The first nine signals were obtained by direct measurement of Sensors 1–9, while the rest were gained by soft measurement of Sensors 10–21 [35].

    Figure  7.  Sketch of the main components of the engine [35].
    Table  I.  Description of the Sensor Data [35]
    IDSymbolDescriptionUnits
    1T2Total temperature at fan inletºR
    2T24Total temperature at LPC outletºR
    3T30Total temperature at HPC outletºR
    4T50Total temperature at LPT outletºR
    5P2Pressure at fan inletpsia
    6P15Total pressure in bypass-ductpsia
    7P30Total pressure at HPC outletpsia
    8NfPhysical fan speedrpm
    9NcPhysical core speedrpm
    10eprEngine pressure ratio (P50/P2)
    11Ps30Static pressure at HPC outletpsia
    12phiRatio of fuel flow to Ps30pps/psi
    13NRfCorrected fan speedrpm
    14NRcCorrected core speedrpm
    15BPRBypass ratio
    16farBBurner fuel-air ratio
    17htBleedBleed enthalpy
    18Nf_dmdDemanded fan speedrpm
    19PCNfR_dmdDemanded corrected fan speedrpm
    20W31HPT coolant bleedlbm/s
    21W32LPT coolant bleedlbm/s
     | Show Table
    DownLoad: CSV

    Dataset “FD001” is used in this paper. It describes the gradual degradation process of HPC under one failure mode and one operating condition. The dataset contains three.txt files: “train_FD001.txt”, “test_FD001.txt” and “RUL_FD001.txt”. “train_FD001.txt” records the complete life cycles of 100 engines from the beginning to failure, “test_FD001.txt” is composed of 100 incomplete time series ending up prior to failure, and “RUL_FD001.txt” provides the actual RUL values.

    Based on the provided dataset, the first step is to extract the degradation features of the engines. According to Section III-B, the moving average technique is utilized for tendency extraction, and the moving window size n is set to 20. Next, the correlation and consistency indicators of each sensor are calculated using (2) and (3), as shown in Table II. In this paper, the sensor with absolute value of correlation indicator greater than 0.7 is regarded as a stronger linear correlation. Thus, the sensors that satisfy \left| {Corr} \right| \geq 0.7 and Con = 0\;{\rm{or}}\;1 will be selected.

    Table  II.  Correlation and Consistency Indicators for 21 Signals
    Sensor IDCorrConAction
    1[0, 0]0.5
    2[0.76, 0.99]1
    3[0.69, 0.98]1
    4[0.84, 0.99]1
    5[0, 0]0.5
    6[–0.11, 0.90]0.8
    7[–0.99, –0.71]0
    8[0.12, 1]1
    9[–0.95, 1]0.71
    10[0, 0]0.5
    11[0.83, 1]1
    12[–0.99, –0.85]0
    13[–0.13, 0.99]0.99
    14[–0.99, 1.00]0.6
    15[0.79, 0.99]1
    16[0, 0]0.5
    17[0.73, 0.99]1
    18[0, 0]0.5
    19[0, 0]0.5
    20[–0.99, –0.82]0
    21[–0.99, –0.73]0
     | Show Table
    DownLoad: CSV

    Considering that sensors 1, 3, 5, 6, 8, 9, 10, 13, 14, 16, 18, and 19 do not meet the limitation of the correlation indicator, they will be eliminated. Subsequently, the remaining sensors will be tested by the consistency indicator. These sensors that have passed the test will be maintained. Thus, the remaining nine sensors are selected, i.e., the sensors 2, 4, 7, 11, 12, 15, 17, 20, and 21.

    With the obtained degradation features, the SVR and LSTM models are separately trained to establish the nonlinear mapping relationship between the features and the RUL. In this experiment, the number of hidden units, learning rate, and dropout probability of the LSTM model are specified as 200, 0.01, and 0.5, respectively. The SVR hyper-parameters, such as box constraint, Gaussian kernel scale parameter and ε, are set to 1, 1, and 0.1, respectively.

    Considering that the degradation of the engine is usually not noticeable before running for a while, this means it may not be reasonable to estimate the RUL at this stage [36]. Thus, this paper clips the responses at the RUL threshold 150, which is determined via several trials with best performance on the test dataset. That is to say, the models will treat the instances with higher RULs as equal, which enables the models to learn more essential mapping relationship when the engines are close to failing. Fig. 8 shows the parts of prediction results on the test set.

    Figure  8.  Prediction results on several test samples.

    For the test engines ID 31 and ID 38, the predicted values of the LSTM model are closer to the actual values than those of the SVR model. However, for test engine ID 78, the SVR model outperforms the LSTM model. Besides, it is observed from the test engine ID 91 that the prediction curve of the LSTM model is approaching the actual curve prior to Cycle 155. After that, the SVR model has the upper hand. These results indicate that each of the studied SVR and LSTM models has its own benefits and drawbacks, and there is no clear-cut winning method. Nevertheless, it must be pointed out that late prediction is intolerable. For example, there are obvious late predictions for the test engine ID 78, and the consequences of the late predictions may be catastrophic. Therefore, the risk-averse adaptation is necessary, and the next section will present the verification results for the risk-averse RUL estimation.

    The GWO-II algorithm is used to determine the values of {w_1}, {w_2}, and b. To enable the GWO-II algorithm to reach a convergence state, the population size is set to 20 and the maximum number of iterations is set to 50. The search spaces of the three parameters are set between −10 and 10. Also, the corrective maintenance cost and preventive maintenance cost are assumed to be 500 and 100, respectively. Generally speaking, it is difficult to describe a four-dimensional space, such as {w_1}, {w_2}, b, and {\textit{z}}. For visualization, the three-dimensional view of {w_1}, {w_2}, and {\textit{z}} is depicted in Fig. 9. This figure shows the distribution of the grey wolf population during the optimization process.

    Figure  9.  Search process of GWO-II algorithm for parameters {w_1} and {w_2}.

    In the initial stage, the grey wolves are randomly distributed in the space. Through the surrounding, hunting, and attacking operations, the grey wolf population is able to obtain the information about the prey (optimal solution) [37]. Thus, as the number of iterations increases, the grey wolves gradually gather into the optimal solution area. At the 30th iteration, the GWO-II algorithm finds the optimal solution, that is {w_1} = 0.22, {w_2} = 0.89, and b = - 0.05.

    With the obtained values of {w_1}, {w_2}, and b, the hybrid model is used to estimate the RULs on the test set. Fig. 10 shows the estimated RUL results on 100 test samples using the hybrid model. It is observed that the estimated values can not only follow the changes in actual values but also approach the actual ones. This implies that the use of the hybrid model is feasible to predict the RULs.

    Figure  10.  Estimated RUL results for 100 test samples.

    Fig. 11 shows the distribution of errors for SVR, LSTM and hybrid models. The prognostics on the left side of the red dotted line refers to the lead prediction. It is obvious that the hybrid model has more lead predictions compared with the SVR and LSTM models. Specifically, the numbers of lead predictions for SVR, LSTM, and hybrid models are 40, 44, and 70, respectively. The results imply that both SVR and LSTM models tend to late predictions. However, as mentioned before, such late predictions are intolerable due to the potential for catastrophic consequences. Unlike the simple SVR or LSTM models, their combination gives good results. This should be attributed to the fusion structure proposed in Section III-C and the penalty mechanism proposed in Section III-D.

    Figure  11.  Distribution of errors for SVR, LSTM and hybrid models.

    It should be pointed out that the lead prediction without considering the prediction error is meaningless. Thus, the root mean square errors (RMSEs) of the three models are calculated and shown in Fig. 11. The RMSE of the hybrid model is 19.11, which is lower than 24.61 of the SVR and 20.16 of the LSTM, indicating that the hybrid model is superior in prediction precision as well. To sum up, the lead prediction number and the prediction precision of the hybrid model meet the expected goal, which is to reduce the over estimation rate while maintaining a reasonable under estimation level, showing that the proposed risk-averse RUL estimation approach is effective.

    In this section, the proposed RUL estimation method will be evaluated from the perspective of predictive maintenance. According to the maintenance scheduling in Section III-E, as an illustration, Table III gives the maintenance cost rates of three RUL prognostic strategies for test engines ID 1–10. Here, “Tm” denotes the planned maintenance moment, “P” indicates that the maintenance action taken (MAT) is preventive maintenance, and “C” indicates that the MAT is corrective maintenance. The time margin of the reliability, \eta , is considered as 10.

    Table  III.  Maintenance Cost Rates for Test Engines ID 1–10
    Test engine IDFailure momentSVR modelLSTM modelHybrid model
    TmMATMCRTmMATMCRTmMATMCR
    1143149.09C3.50167.94C3.50138.84P0.72
    2147135.91P0.74176.34C3.40149.65C3.40
    3195184.50P0.54173.46P0.58169.90P0.59
    4188170.99P0.58175.57P0.57168.50P0.59
    5189178.67P0.56186.06P0.54175.73P0.57
    6198198.39C2.53201.94C2.53189.85P0.53
    7251264.87C1.99223.72P0.45224.32P0.45
    8261233.20P0.43229.75P0.44224.44P0.45
    9166146.02P0.68169.00C3.01149.36P0.67
    10288284.26P0.35250.86P0.40250.69P0.40
     | Show Table
    DownLoad: CSV

    From the given MCRs, it is obvious that the corrective maintenance is more costly than the preventive maintenance. From the maintenance activities taken, the use of hybrid model, instead of the SVR or LSTM model, allows improving the accuracy of maintenance decisions. For example, for the test engines ID 1, 6, and 7, the scheduled maintenance actions using SVR model are unreasonable. The similar situation can be found in the LSTM model, such as the test engines ID 1, 2, 6, and 9. Best of all, the use of hybrid model leads to correct the maintenance decisions for the test engines ID 1, 6, 7, and 9, which is significant for ensuring the operation safety and reliability of the engines. Besides, it is observed that the MCR of the hybrid model is sometimes higher than that of SVR and LSTM models under the preventive maintenance, but it is allowable compared with the corrective maintenance.

    The MCRs for the 100 test samples can be visualized in Fig. 12. The test samples are divided into five groups, and each group has 20 engines. The average MCR of each group is calculated based on different prognostic approaches (SVR, LSTM, hybrid models, and ideal PdM case). Evidently, no matter which group, the average MCR of the hybrid model is lower than those of the SVR and LSTM models. Based on this, the average MCRs of the four prognostic approaches for all test samples are calculated. In detail, the average MCR for the SVR model is 1.49, 1.20 for the LSTM model, 0.80 for the hybrid model and, 0.50 for the ideal PdM case. Compared with the SVR and LSTM models, the average MCR of the hybrid model is reduced by 46.44% and 33.41%, respectively. Also, there is only a MCR gap of 0.3 between the hybrid model and the ideal model. These results show that the benefits the risk-averse RUL estimation brings are considerable, and the proposed approach can significantly reduce the maintenance cost rate and is approaching the ideal one.

    Figure  12.  MCRs for 100 test samples using SVR, LSTM and hybrid models.

    In this work, an RUL estimation method with risk-averse adaptation has been proposed. It hybridizes two mainstream models, SVR and LSTM, in the field of RUL prognosis. The proposed estimation method can enhance the robustness of prediction, increase the marginal utility, and reduce the over-estimation rate while maintaining a reasonable under estimation level. Besides, an embedded degradation feature selection module can obtain crucial features that reflect system degradation trends, and a proposed maintenance cost rate can measure the benefit provided by risk-averse prognostics.

    The verification results using NASA data repository reveal the feasibility and effectiveness of the proposed method. According to the number of lead predictions, the prediction errors, the accuracy of maintenance decisions, and the maintenance cost rate, the proposed hybrid model is indeed better than the single models. Above all, the precise and risk-averse RUL estimation is significant for a system to keep safe and stable operation.

    The proposed method can also be applied to other engineering systems subjected to single failure modes. Considering that the failure of some engineering systems may be caused by coupling actions of various failure modes, our future work will focus on the investigation of the systems with multiple failure modes.

  • [1]
    C. Hu, H. Pei, X. Si, D. Du, Z. Pang, and X. Wang, “A prognostic model based on DBN and diffusion process for degrading bearing,” IEEE Trans. Ind. Electron., to be published. DOI: 10.1109/TIE.2019.2947839.
    [2]
    P. C. Lopes Gerum, A. Altay, and M. Baykal-Gürsoy, “Data-driven predictive maintenance scheduling policies for railways,” Transp. Res. Pt. C-Emerg. Technol., vol. 107, pp. 137–154, Oct. 2019. doi: 10.1016/j.trc.2019.07.020
    [3]
    Y. Lei, N. Li, L. Guo, N. Li, T. Yan, and J. Lin, “Machinery health prognostics: A systematic review from data acquisition to RUL prediction,” Mech. Syst. Signal Proc., vol. 104, pp. 799–834, May 2018. doi: 10.1016/j.ymssp.2017.11.016
    [4]
    K. T. Nguyen and K. Medjaher, “A new dynamic predictive maintenance framework using deep learning for failure prognostics,” Reliab. Eng. Syst. Saf., vol. 188, pp. 251–262, Aug. 2019. doi: 10.1016/j.ress.2019.03.018
    [5]
    K. Wang, “Intelligent predictive maintenance (IPdM) system–Industry 4.0 scenario,” WIT Trans. Eng. Sci., vol. 113, pp. 259–268, 2016.
    [6]
    F. Civerchia, S. Bocchino, C. Salvadori, E. Rossi, L. Maggiani, and M. Petracca, “Industrial Internet of Things monitoring solution for advanced predictive maintenance applications,” J. Ind. Inf. Integr., vol. 7, pp. 4–12, Sept. 2017.
    [7]
    J. Wang, L. Zhang, L. Duan, and R. X. Gao, “A new paradigm of cloudbased predictive maintenance for intelligent manufacturing,” J. Intell. Manuf., vol. 28, no. 5, pp. 1125–1137, Jun. 2017. doi: 10.1007/s10845-015-1066-0
    [8]
    M. Baptista, S. Sankararaman, I. P. de Medeiros, C. Nascimento Jr, H. Prendinger, and E. M. Henriques, “Forecasting fault events for predictive maintenance using data-driven techniques and ARMA modeling,” Comput. Ind. Eng., vol. 115, pp. 41–53, Jan. 2018. doi: 10.1016/j.cie.2017.10.033
    [9]
    B. O. Gombé, G. G. Mérou, K. Breschi, H. Guyennet, J. M. Friedt, V. Felea, and K. Medjaher, “A SAW wireless sensor network platform for industrial predictive maintenance,” J. Intell. Manuf., vol. 30, no. 4, pp. 1617–1628, Apr. 2019. doi: 10.1007/s10845-017-1344-0
    [10]
    K. A. Nguyen, P. Do, and A. Grall, “Joint predictive maintenance and inventory strategy for multi-component systems using Birnbaum’s structural importance,” Reliab. Eng. Syst. Saf., vol. 168, pp. 249–261, Dec. 2017. doi: 10.1016/j.ress.2017.05.034
    [11]
    S. Khan and T. Yairi, “A review on the application of deep learning in system health management,” Mech. Syst. Signal Proc., vol. 107, pp. 241–265, Jul. 2018. doi: 10.1016/j.ymssp.2017.11.024
    [12]
    C. Zhang, C. Wang, N. Lu, and B. Jiang, “An RBMs-BN method to RUL prediction of traction converter of CRH2 trains,” Eng. Appl. Artif. Intell., vol. 85, pp. 46–56, Oct. 2019. doi: 10.1016/j.engappai.2019.06.001
    [13]
    K. T. Huynh, I. T. Castro, A. Barros, and C. Berenguer, “On the use of mean residual life as a condition index for condition-based maintenance decision-making,” IEEE Trans. Syst. Man Cybern. -Syst., vol. 44, no. 7, pp. 877–893, Jul. 2014. doi: 10.1109/TSMC.2013.2290772
    [14]
    R. Khelif, B. Chebel-Morello, S. Malinowski, E. Laajili, F. Fnaiech, and N. Zerhouni, “Direct remaining useful life estimation based on support vector regression,” IEEE Trans. Ind. Electron., vol. 64, no. 3, pp. 2276–2285, Mar. 2016.
    [15]
    C. Wang, N. Lu, Y. Cheng, and B. Jiang, “A data-driven aero-engine degradation prognostic strategy,” IEEE T. Cybern., to be published. DOI: 10.1109/TCYB.2019.2938244.
    [16]
    E. Ramasso, M. Rombaut, and N. Zerhouni, “Joint prediction of continuous and discrete states in time-series based on belief functions,” IEEE T. Cybern., vol. 43, no. 1, pp. 37–50, Feb. 2013. doi: 10.1109/TSMCB.2012.2198882
    [17]
    Q. Miao, L. Xie, H. Cui, W. Liang, and M. Pecht, “Remaining useful life prediction of lithium-ion battery with unscented particle filter technique,” Microelectron. Reliab., vol. 53, no. 6, pp. 805–810, Jun. 2013. doi: 10.1016/j.microrel.2012.12.004
    [18]
    T. Qin, S. Zeng, and J. Guo, “Robust prognostics for state of health estimation of lithium-ion batteries based on an improved PSO–SVR model,” Microelectron. Reliab., vol. 55, no. 9–10, pp. 1280–1284, Sept. 2015. doi: 10.1016/j.microrel.2015.06.133
    [19]
    A. Soualhi, K. Medjaher, and N. Zerhouni, “Bearing health monitoring based on Hilbert–Huang transform, support vector machine, and regression,” IEEE Trans. Instrum. Meas., vol. 64, no. 1, pp. 52–62, Jan. 2015. doi: 10.1109/TIM.2014.2330494
    [20]
    H. Dong, X. Jin, Y. Lou, and C. Wang, “Lithium-ion battery state of health monitoring and remaining useful life prediction based on support vector regression-particle filter,” J. Power Sources, vol. 271, pp. 114–123, Dec. 2014. doi: 10.1016/j.jpowsour.2014.07.176
    [21]
    T. Wang, J. Yu, D. Siegel, and J. Lee, “A similarity-based prognostics approach for remaining useful life estimation of engineered systems,” in Proc. Int. Conf. Prognostics Health Manage., Denver, CO, USA, 2008, pp. 1–6.
    [22]
    S. Malinowski, B. Chebel-Morello, and N. Zerhouni, “Remaining useful life estimation based on discriminating shapelet extraction,” Reliab. Eng. Syst. Saf., vol. 142, pp. 279–288, Oct. 2015. doi: 10.1016/j.ress.2015.05.012
    [23]
    F. Xue, P. Bonissone, A. Varma, W. Yan, N. Eklund, and K. Goebel, “An instance-based method for remaining useful life estimation for aircraft engines,” J. Failure Anal. Prevention, vol. 8, no. 2, pp. 199–206, Apr. 2008. doi: 10.1007/s11668-008-9118-9
    [24]
    E. Zio and F. D. Maio, “A data-driven fuzzy approach for predicting the remaining useful life in dynamic failure scenarios of a nuclear system,” Reliab. Eng. Syst. Saf., vol. 95, no. 1, pp. 49–57, Jan. 2010. doi: 10.1016/j.ress.2009.08.001
    [25]
    Y. Wu, M. Yuan, S. Dong, L. Lin, and Y. Liu, “Remaining useful life estimation of engineered systems using vanilla LSTM neural networks,” Neurocomputing, vol. 275, pp. 167–179, Jan. 2018. doi: 10.1016/j.neucom.2017.05.063
    [26]
    M. Esmaelian, H. Shahmoradi, and M. Vali, “A novel classification method: A hybrid approach based on extension of the UTADIS with polynomial and PSO-GA algorithm,” Appl. Soft. Comput., vol. 49, pp. 56–70, Dec. 2016. doi: 10.1016/j.asoc.2016.07.017
    [27]
    X. Jia, M. Zhao, Y. Di, Q. Yang, and J. Lee, “Assessment of data suitability for machine prognosis using maximum mean discrepancy,” IEEE Trans. Ind. Electron., vol. 65, no. 7, pp. 5872–5881, Jul. 2018. doi: 10.1109/TIE.2017.2777383
    [28]
    S. Sharifian, and M. Barati, “An ensemble multiscale wavelet-GARCH hybrid SVR algorithm for mobile cloud computing workload prediction,” Int. J. Mach. Learn. Cybern., vol. 10, no. 11, pp. 3285–3300, Nov. 2019. doi: 10.1007/s13042-019-01017-1
    [29]
    C. Wang, N. Lu, S. Wang, Y. Cheng, and B. Jiang, “Dynamic long short-term memory neural-network-based indirect remaining-useful-life prognosis for satellite lithium-ion battery,” Appl. Sci.-Basel, vol. 8, no. 11, Article ID 2078, Nov. 2018. DOI: 10.3390/app8112078.
    [30]
    M. Martínez-García, Y. Zhang, K. Suzuki, and Y. Zhang, “Measuring system entropy with a deep recurrent neural network model,” in Proc. IEEE 17th Int. Conf. Ind. Informat., Helsinki, Finland, 2019, pp. 1253–1256.
    [31]
    M. Martínez-García, Y. Zhang, and T. Gordon, “Memory pattern identification for feedback tracking control in human–machine systems,” Hum. Factors, pp. 1–17, Oct. 2019.
    [32]
    S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Adv. Eng. Softw., vol. 69, pp. 46–61, Mar. 2014. doi: 10.1016/j.advengsoft.2013.12.007
    [33]
    H. Faris, I. Aljarah, M. A. Al-Betar, and S. Mirjalili, “Grey wolf optimizer: a review of recent variants and applications,” Neural Comput. Appl., vol. 30, no. 2, pp. 413–435, Jul. 2018. doi: 10.1007/s00521-017-3272-5
    [34]
    NASA. "Prognostic Data Repository". [Online]. Available: https://ti.arc.nasa.gov/tech/dash/groups/pcoe/prognostic-data-repository/. Accessed on: Sept. 2019.
    [35]
    A. Saxena, K. Goebel, D. Simon, and N. Eklund, “Damage propagation modeling for aircraft engine run-to-failure simulation,” in Proc. Int. Conf. Prognostics Health Manage., Denver, CO, USA, 2008, pp. 1–9.
    [36]
    F. O. Heimes, “Recurrent neural networks for remaining useful life estimation,” in Proc. Int. Conf. Prognostics Health Manage., Denver, CO, USA, 2008, pp. 1−6.
    [37]
    R. E. Precup, R. C. David, and E. M. Petriu, “Grey wolf optimizer algorithm-based tuning of fuzzy control systems with reduced parametric sensitivity,” IEEE Trans. Ind. Electron., vol. 64, no. 1, pp. 527–534, Jan. 2017. doi: 10.1109/TIE.2016.2607698
  • Related Articles

    [1]Hongxing Xiong, Guangdeng Chen, Hongru Ren, Hongyi Li. Broad-Learning-System-Based Model-Free Adaptive Predictive Control for Nonlinear MASs Under DoS Attacks[J]. IEEE/CAA Journal of Automatica Sinica, 2025, 12(2): 381-393. doi: 10.1109/JAS.2024.124929
    [2]Chenxi Gu, Xinli Wang, Kang Li, Xiaohong Yin, Shaoyuan Li, Lei Wang. Enhanced Tube-Based Event-Triggered Stochastic Model Predictive Control With Additive Uncertainties[J]. IEEE/CAA Journal of Automatica Sinica, 2025, 12(3): 596-605. doi: 10.1109/JAS.2024.124974
    [3]Shulei Zhang, Runda Jia. A Self-Healing Predictive Control Method for Discrete-Time Nonlinear Systems[J]. IEEE/CAA Journal of Automatica Sinica, 2025, 12(4): 668-682. doi: 10.1109/JAS.2024.124620
    [4]Luigi D’Alfonso, Francesco Giannini, Giuseppe Franzè, Giuseppe Fedele, Francesco Pupo, Giancarlo Fortino. Autonomous Vehicle Platoons In Urban Road Networks: A Joint Distributed Reinforcement Learning and Model Predictive Control Approach[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(1): 141-156. doi: 10.1109/JAS.2023.123705
    [5]Bingrong Xu, Jianhua Yin, Cheng Lian, Yixin Su, Zhigang Zeng. Low-Rank Optimal Transport for Robust Domain Adaptation[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(7): 1667-1680. doi: 10.1109/JAS.2024.124344
    [6]Bing Zhu, Xiaozhuoer Yuan, Li Dai, Zhiwen Qiang. Finite-Time Stabilization for Constrained Discrete-time Systems by Using Model Predictive Control[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(7): 1656-1666. doi: 10.1109/JAS.2024.124212
    [7]Xiongbo Wan, Chaoling Zhang, Fan Wei, Chuan-Ke Zhang, Min Wu. Hybrid Dynamic Variables-Dependent Event-Triggered Fuzzy Model Predictive Control[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(3): 723-733. doi: 10.1109/JAS.2023.123957
    [8]Qian Hu, Jiayi Ma, Yuan Gao, Junjun Jiang, Yixuan Yuan. MAUN: Memory-Augmented Deep Unfolding Network for Hyperspectral Image Reconstruction[J]. IEEE/CAA Journal of Automatica Sinica, 2024, 11(5): 1139-1150. doi: 10.1109/JAS.2024.124362
    [9]Zefeng Zheng, Luyao Teng, Wei Zhang, Naiqi Wu, Shaohua Teng. Knowledge Transfer Learning via Dual Density Sampling for Resource-Limited Domain Adaptation[J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(12): 2269-2291. doi: 10.1109/JAS.2023.123342
    [10]A. Daniel Carnerero, Daniel R. Ramirez, Daniel Limon, Teodoro Alamo. Kernel-Based State-Space Kriging for Predictive Control[J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(5): 1263-1275. doi: 10.1109/JAS.2023.123459
    [11]Qiwu Zhu, Qingyu Xiong, Zhengyi Yang, Yang Yu. RGCNU: Recurrent Graph Convolutional Network With Uncertainty Estimation for Remaining Useful Life Prediction[J]. IEEE/CAA Journal of Automatica Sinica, 2023, 10(7): 1640-1642. doi: 10.1109/JAS.2023.123369
    [12]Yunan Qiu, Zhenyu Lu, Shanpu Fang. A Short-Term Precipitation Prediction Model Based on Spatiotemporal Convolution Network and Ensemble Empirical Mode Decomposition[J]. IEEE/CAA Journal of Automatica Sinica, 2022, 9(4): 738-740. doi: 10.1109/JAS.2022.105479
    [13]Wenjin Zhang, Jiacun Wang, Fangping Lan. Dynamic Hand Gesture Recognition Based on Short-Term Sampling Neural Networks[J]. IEEE/CAA Journal of Automatica Sinica, 2021, 8(1): 110-120. doi: 10.1109/JAS.2020.1003465
    [14]Jamal Banzi, Isack Bulugu, Zhongfu Ye. Learning a Deep Predictive Coding Network for a Semi-Supervised 3D-Hand Pose Estimation[J]. IEEE/CAA Journal of Automatica Sinica, 2020, 7(5): 1371-1379. doi: 10.1109/JAS.2020.1003090
    [15]Hao Zhang, Yongdan Li, Zhihan Lv, Arun Kumar Sangaiah, Tao Huang. A Real-Time and Ubiquitous Network Attack Detection Based on Deep Belief Network and Support Vector Machine[J]. IEEE/CAA Journal of Automatica Sinica, 2020, 7(3): 790-799. doi: 10.1109/JAS.2020.1003099
    [16]Wenying Zhang, Huaguang Zhang, Jinhai Liu, Kai Li, Yang Dongsheng, Tian Hui. Weather Prediction With Multiclass Support Vector Machines in the Fault Detection of Photovoltaic System[J]. IEEE/CAA Journal of Automatica Sinica, 2017, 4(3): 520-525. doi: 10.1109/JAS.2017.7510562
    [17]Xia Wang, Jun Zhao. Logic-based Reset Adaptation Design for Improving Transient Performance of Nonlinear Systems[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(4): 440-448.
    [18]Song Deng, Dong Yue, Xiong Fu, Aihua Zhou. Security Risk Assessment of Cyber Physical Power System Based on Rough Set and Gene Expression Programming[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(4): 431-439.
    [19]Yan Song, Haifeng Lou, Shuai Liu. Distributed Model Predictive Control with Actuator Saturation for Markovian Jump Linear System[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(4): 374-381.
    [20]Xiaohua Xia, Jiangfeng Zhang. Operation Efficiency Optimisation Modelling and Application of Model Predictive Control[J]. IEEE/CAA Journal of Automatica Sinica, 2015, 2(2): 166-172.

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(12)  / Tables(3)

    Article Metrics

    Article views (2572) PDF downloads(97) Cited by()

    Highlights

    • Degradation feature selection procedure helps to lessen calculative burden.
    • Hybrid model helps to enhance prediction robustness and increase marginal utility.
    • Evolutionary algorithm helps to determine hybrid model parameters.
    • Cost function with penalty mechanism allows alleviating prediction risk.
    • Cost metric allows measuring risk-averse predictive maintenance benefit.

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return