<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">80577</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2026.080577</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Satellite Failure Prognosis with Cascaded Temporal Convolution and Transformer Network for Multi-Scale Features</article-title>
<alt-title alt-title-type="left-running-head">Satellite Failure Prognosis with Cascaded Temporal Convolution and Transformer Network for Multi-Scale Features</alt-title>
<alt-title alt-title-type="right-running-head">Satellite Failure Prognosis with Cascaded Temporal Convolution and Transformer Network for Multi-Scale Features</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Shi</surname><given-names>Yu</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Dong</surname><given-names>Yunfeng</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>sinosat@buaa.edu.cn</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Tian</surname><given-names>Lu</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<aff id="aff-1"><label>1</label><institution>School of Astronautics, Beihang University</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>National Superior College for Engineers, Beihang University</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>The 15th Research Institute of China Electronic Technology Corporation</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Yunfeng Dong. Email: <email>sinosat@buaa.edu.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2026</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>15</day><month>06</month><year>2026</year>
</pub-date>
<volume>88</volume>
<issue>2</issue>
<elocation-id>17</elocation-id>
<history>
<date date-type="received">
<day>12</day>
<month>02</month>
<year>2026</year>
</date>
<date date-type="accepted">
<day>03</day>
<month>05</month>
<year>2026</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2026 The Authors. Published by Tech Science Press.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>The Authors</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_80577.pdf"></self-uri>
<abstract>
<p>Failure prognosis provides critical decision-making support for Integrated System Health Management (ISHM), ensuring the operational safety of satellites in orbit. Temporal Convolutional Networks (TCNs), known for their capability in processing time-series data, have become an important approach for failure prognosis. The gradual performance degradation of satellites, combined with multi-physics coupling effects, gives rise to multi-scale features. However, existing TCN based failure prognosis methods remain limited in their ability to simultaneously capture both local and global features, posing challenges when processing such multi-scale features. To address this issue, a Cascaded Temporal Convolution and Transformer Network (CTCTN) framework is proposed for satellite failure prognosis and uncertainty quantification. The CTCTN first adaptively aligns the feature dimensions of the Depthwise Separable Temporal Convolution (DS-TC) block and the Transformer module through Adaptive Average Pooling (AAP), enabling both local feature extraction and global dependency modeling. A heteroscedastic Huber loss function is then designed to optimize the mean and variance of the CTCTN output. Finally, epistemic and aleatoric uncertainties are separately estimated and used to construct probabilistic prediction intervals. A satellite model is developed, and a run-to-failure dataset is constructed to validate the proposed CTCTN framework using a performance degradation scenario caused by damage to the Solar Array Paddle (SAP) of a Low Earth Orbit (LEO) satellite. Experimental results demonstrate that the proposed CTCTN method not only achieves more accurate Remaining Useful Life (RUL) predictions but also effectively quantifies uncertainty arising from multi-scale features. This work provides a reference case for failure prognosis in LEO satellites and offers decision support for ISHM.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Failure prognosis</kwd>
<kwd>temporal convolution</kwd>
<kwd>transformer</kwd>
<kwd>uncertainty quantification</kwd>
<kwd>low earth orbit satellite</kwd>
<kwd>remaining useful life</kwd>
</kwd-group></article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Failure prognosis is a key element in supporting decision-making for Integrated System Health Management (ISHM) [<xref ref-type="bibr" rid="ref-1">1</xref>], as it aims to prevent mission capability loss resulting from performance degradation of satellite components. As space activities continue to intensify in Low Earth Orbit (LEO), the impact of space debris has correspondingly escalated [<xref ref-type="bibr" rid="ref-2">2</xref>&#x2013;<xref ref-type="bibr" rid="ref-4">4</xref>]. Among satellite subsystems, the Solar Array Paddle (SAP) could be damaged by space debris, leading to a degradation in electrical power generation [<xref ref-type="bibr" rid="ref-5">5</xref>&#x2013;<xref ref-type="bibr" rid="ref-8">8</xref>]. By estimating the Remaining Useful Life (RUL) of components [<xref ref-type="bibr" rid="ref-9">9</xref>], failure prognosis enables ISHM frameworks to implement corrective measures and maintain satellite reliability.</p>
<p>Current research on failure prognosis primarily falls into two categories: model-driven methods and data-driven methods [<xref ref-type="bibr" rid="ref-9">9</xref>]. Model-driven approaches rely on prior knowledge to model the degradation process. Muthusamy and Kumar [<xref ref-type="bibr" rid="ref-10">10</xref>] proposed a method combining a general path model with Bayesian updating to dynamically predict the RUL of Control Moment Gyros (CMGs). Park et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] employed an adaptive extended Kalman filter for failure prognosis of a reaction wheel motor. However, model-driven approaches are highly dependent on expert knowledge and are often limited by the complexity of parameter estimation.</p>
<p>In recent years, data-driven failure prognosis approaches have attracted growing interest due to their ability to evaluate system health status by extracting degradation trends from historical operational data [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>]. Machine learning constitutes a primary technique in data-driven prognosis, encompassing techniques such as Random Forests (RFs) [<xref ref-type="bibr" rid="ref-14">14</xref>&#x2013;<xref ref-type="bibr" rid="ref-16">16</xref>] and Support Vector Machine (SVM) [<xref ref-type="bibr" rid="ref-17">17</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>]. Khelif et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] applied support vector regression to model the direct relationship between sensor values and Health Indicators (HIs), allowing RUL prediction for turbofan engines throughout the degradation process. Empirical Mode Decomposition (EMD) has been adopted to preprocess bearing degradation signals, thereby facilitating SVM based RUL estimation [<xref ref-type="bibr" rid="ref-21">21</xref>]. Despite these advances, conventional machine learning techniques often struggle to process high dimensional features. In contrast, deep learning excels at extracting temporal patterns from complex degradation data [<xref ref-type="bibr" rid="ref-22">22</xref>,<xref ref-type="bibr" rid="ref-23">23</xref>], including models based on Recurrent Neural Networks (RNNs) [<xref ref-type="bibr" rid="ref-24">24</xref>] and Convolutional Neural Networks (CNNs) [<xref ref-type="bibr" rid="ref-25">25</xref>].</p>
<p>RNN captures temporal dependencies in time-series data by incorporating recurrent connections within their hidden layers. Long Short-Term Memory (LSTM) networks build upon standard RNN architectures by incorporating gating mechanisms that facilitate long-term information retention. Che et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] developed an LSTM based recurrent network to extract patterns from sensor data and validated its effectiveness for RUL prediction using NASA&#x2019;s engine dataset. Wu et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] applied an LSTM based model for engine performance prognosis. Sirajul Islam and Rahimi [<xref ref-type="bibr" rid="ref-28">28</xref>] developed a two-step LSTM method for reaction wheels failure prognosis. Isbilen et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] proposed a hybrid algorithm that integrates LSTM networks with similarity based techniques, achieving superior performance in RUL prediction accuracy. Nevertheless, their study also highlighted the high computational demands associated with LSTM architecture.</p>
<p>In comparison, CNN identifies local features in historical data through sequential convolution and pooling operations, making them well suited for RUL prediction tasks. Building on this, the Temporal Convolutional Network (TCN), originally inspired by WaveNet [<xref ref-type="bibr" rid="ref-30">30</xref>], substantially enlarges the temporal receptive field, enabling models to learn long-scale temporal patterns. Chen et al. [<xref ref-type="bibr" rid="ref-31">31</xref>] transformed time-frequency features of historical data into HI and introduced the Bayesian optimization based adversarial TCN for RUL prediction. Deng et al. [<xref ref-type="bibr" rid="ref-32">32</xref>] constructed a multi-scale TCN by stacking multi-scale dilated causal convolution residual block, enabling the learning of multi-scale features. Nevertheless, TCN based architectures still struggle to process both local and global features simultaneously, making them insufficiently adapted for satellite failure prognosis.</p>
<p>Attention-based hybrid methods demonstrate superior capabilities in processing complex features. Hsu et al. [<xref ref-type="bibr" rid="ref-33">33</xref>] enhanced time-series feature extraction by serially combining TCN with LSTM networks and attention layers. Liu et al. [<xref ref-type="bibr" rid="ref-34">34</xref>] introduced a network with parallel TCN and LSTM branches integrated with a Convolutional Block Attention Module (CBAM) to address the performance limitations of models that consider only short-term or long-term dependencies. Zou and Lin [<xref ref-type="bibr" rid="ref-35">35</xref>] achieved multi-timescale feature extraction for aircraft engines by fusing information from multiple TCN blocks via a multi-channel attention mechanism. Furthermore, Transformer-based hybrid architectures [<xref ref-type="bibr" rid="ref-36">36</xref>,<xref ref-type="bibr" rid="ref-37">37</xref>], which benefit from the global dependency modeling capability of multi-head attention, are attracting growing research interest. Although these methods have shown strong performance in RUL prediction for industrial equipment, there are still many challenges for satellite failure prognosis.</p>
<p>The main challenge for current failure prognosis research in satellites is effectively extracting multi-scale features. Owing to the stringent reliability requirements in satellite design, component performance degradation typically occurs slowly and progressively, leading to long-term degradation process. Furthermore, satellite systems are highly complex and strongly coupled [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-38">38</xref>]. Historical data is influenced by various factors, such as orbital dynamics and attitude maneuvers, each characterized by different temporal periods. These multi-scale features pose significant difficulties for current prognosis methods. The SAP serves as the primary power supply component by converting solar energy into electrical power. Unlike other components, the SAP is directly exposed to the harsh space environment and is therefore more vulnerable to damage from space debris impacts, which can degrade its power generation capacity [<xref ref-type="bibr" rid="ref-39">39</xref>&#x2013;<xref ref-type="bibr" rid="ref-41">41</xref>]. For LEO satellites, attitude maneuvers typically occur on the order of minutes, whereas the orbital period is more than ten times longer. In contrast, the degradation process of the SAP unfolds over a much longer timescale. Consequently, in LEO satellite SAP degradation scenarios, the combined effects of orbital dynamics and attitude maneuvers on historical data generate multi-scale features, creating significant challenges for satellite failure prognosis.</p>
<p>To address these challenges, this paper proposes a Cascade Temporal Convolution and Transformer Network (CTCTN) for satellite failure prognosis and uncertainty quantification. Given the gradual degradation process and the presence of multi-scale features, network architectures relying solely on either TCNs or Transformers are insufficient to satisfy predictive performance requirements. To overcome this limitation, a network architecture is designed in which Transformer modules are cascaded after Depthwise Separable Temporal Convolution (DS-TC) blocks and connected through Adaptive Average Pooling (AAP). This architecture exploits the DS-TC blocks&#x2019; strengths in local feature extraction and dimensionality reduction, while simultaneously enhancing the Transformer module&#x2019;s ability to model global dependencies. Furthermore, multi-scale features introduce uncertainty into prediction outcomes. To quantify this uncertainty, a heteroscedastic Huber loss function is designed that incorporates variance-based uncertainty constraints to jointly optimize the two output branches of the CTCTN, namely the predictive mean and predictive variance. Subsequently, Monte Carlo Dropout (MCD) is employed to separately estimate epistemic and aleatoric uncertainties based on the predicted mean and variance. To validate both the prediction accuracy and uncertainty quantification capability of the proposed CTCTN method, a satellite model is developed, and a run-to-failure dataset involving SAP degradation in a LEO satellite is constructed.</p>
<p>The main contributions of this paper are summarized as follows.
<list list-type="order">
<list-item>
<p>To address the challenge of multi-scale feature extraction in satellite failure prognosis, a CTCTN method is proposed. The preceding DS-TC blocks are responsible for local feature extraction and dimensionality reduction, while the subsequent Transformer modules model global dependencies. AAP enables the adaptively cascading of these two components, preserving multi-scale information and supporting progressive feature fusion from local to global representations.</p></list-item>
<list-item>
<p>Target optimizations are incorporated into the CTCTN architecture to enhance training efficiency and stability for long sequences, multi-parameter networks. Depthwise separable convolutions reduce the number of training parameters while maintaining effective temporal feature processing capability, thereby improving training efficiency. Furthermore, replacing the Rectified Linear Unit (ReLU) with the Gaussian Error Linear Unit (GELU) offers smooth activation properties that are particularly beneficial for stabilizing Transformer training.</p></list-item>
<list-item>
<p>An uncertainty quantification framework is developed for satellite failure prognosis that jointly accounts for both epistemic and aleatoric uncertainties. The CTCTN employs dual output branches to predict the mean and variance and a heteroscedastic Huber loss function is designed to optimize these outputs. MCD is then applied to the dual-branch network outputs to separately estimate the epistemic and aleatoric uncertainties.</p></list-item>
</list></p>
<p>The remainder of this paper is organized as follows: <xref ref-type="sec" rid="s2">Section 2</xref> defines the problem and the evaluation criteria for satellite failure prognosis. <xref ref-type="sec" rid="s3">Section 3</xref> describes the proposed CTCTN framework for satellite failure prognosis and uncertainty quantification. <xref ref-type="sec" rid="s4">Section 4</xref> presents a case study for simulation and analyzes the results. Finally, <xref ref-type="sec" rid="s5">Section 5</xref> concludes the work and suggests some future directions.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Description of the Satellite Failure Prognosis Problem</title>
<p>This section formulates the satellite failure prognosis problem and describes the performance metrics used to evaluate the proposed prediction methods. Satellites operate in a highly complex space environment, where onboard components are susceptible to performance degradation caused by factors such as radiation exposure and collisions with space debris. Such degradation can ultimately impair a satellite&#x2019;s ability to perform mission-critical functions. As illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, a component&#x2019;s life cycle generally consists of two stages: a healthy stage and a degradation stage.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>True RUL in the component&#x2019;s life cycle and the predicted RUL with confidence interval.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-1.tif"/>
</fig>
<p>The satellite failure prognosis problem aims to predict the RUL of a satellite at time <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> based on historical observations, while simultaneously estimating prediction confidence intervals between <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Upper</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Lower</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> through uncertainty quantification. As shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, the solid blue line represents the true RUL, the red dashed line indicates the predicted RUL, and the gray shaded region highlights the confidence interval of the prediction. The RUL of the component is defined as follows:<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>FPT</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mo>&#x2212;</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>FPT</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>EOL</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mtext>&#xA0;</mml:mtext><mml:mo>&#x2212;</mml:mo><mml:mtext>&#xA0;</mml:mtext><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>FPT</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>FPT</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where the First Prediction Time (FPT) [<xref ref-type="bibr" rid="ref-42">42</xref>] denotes the moment at which a component&#x2019;s performance begins to degrade, whereas the End of Life (EOL) defines the point at which the RUL reaches zero.</p>
<p>During the healthy stage, RUL remains fixed to one, highlighting that the component operates at full performance. Based on <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>FPT</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, RUL decreases monotonically as deterioration progresses. To mitigate satellite failures, component- and mission-specific RUL thresholds are integrated to trigger predefined emergency protocols prior to critical functionality loss.</p>
<p>Root Mean Squared Error (RMSE) and Mean Absolute Error (MAE) are used to quantitatively evaluate prediction accuracy. Both metrics measure the deviation between <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Predicted</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>True</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, as defined below:<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>|</mml:mo><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Predicted</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>True</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>R</mml:mi><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Predicted</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>True</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:msqrt></mml:math></disp-formula>where lower RMSE and MAE values indicate better predictive accuracy.</p>
<p>In addition, two other metrics are employed to evaluate the uncertainty intervals: Prediction Interval Coverage Probability (PICP), which evaluates the accuracy of the predicted interval, and Mean Prediction Interval Width (MPIW), which quantifies the uncertainty. These metrics are expressed as follows:<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>P</mml:mi><mml:mi>I</mml:mi><mml:mi>C</mml:mi><mml:mi>P</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>M</mml:mi><mml:mi>P</mml:mi><mml:mi>I</mml:mi><mml:mi>W</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>n</mml:mi></mml:mfrac><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>[</mml:mo><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Upper</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Lower</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents a flag indicating if the true value lies within the prediction interval. If the true value falls outside <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Upper</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> or <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>R</mml:mi><mml:mi>U</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mrow><mml:mtext>Lower</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> boundaries, <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>; otherwise, <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. A narrower interval, reflected by a lower MPIW, typically results in a reduced PICP. Therefore, a combined analysis of both metrics provides an assessment of the method&#x2019;s uncertainty quantification performance.</p>
<p>When combined together, these four metrics (e.g., RMSE, MAE, PICP, and MPIW) form a comprehensive framework for assessing the performance of the prognosis method.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Methods</title>
<p>To address the challenges of failure prognosis and uncertainty quantification associated with SAP degradation in LEO satellites, this paper proposes the CTCTN framework. Stacked DS-TC blocks are first cascaded with Transformer modules through AAP, enabling effective local feature extraction and global dependency modeling for multi-scale features. The heteroscedastic Huber loss function is then designed during training to optimize both the mean and variance outputs of CTCTN. Moreover, MCD is applied during testing to quantify epistemic and aleatoric uncertainties. Finally, the framework generates predictions for the RUL along with their corresponding prediction intervals.</p>
<sec id="s3_1">
<label>3.1</label>
<title>The Structure of Cascaded Temporal Convolution and Transformer Network (CTCTN)</title>
<p>The proposed CTCTN structure consists of four key parts: DS-TC block, AAP, Transformer module, Multi-Head Attention Pooling (MHAP). These parts collectively facilitate hierarchical feature extraction and cross-scale fusion, enhancing the representation of degradation patterns.</p>
<p>The DS-TC block preserves the temporal modeling capabilities of conventional TCN while improving computational efficiency through the depthwise separable convolutions. Serving as the foundational unit of the DS-TC block, the dilated causal convolution (DCC) expands the receptive field without increasing the kernel size by adjusting the dilation rate. The receptive field comparison with standard convolution is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The receptive field: (<bold>a</bold>) standard convolution; (<bold>b</bold>) dilated causal convolution.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-2.tif"/>
</fig>
<p>The causal convolution structure enables the network to learn historical information in the temporal data and avoid the effect of future information. Notably, this study incorporates depthwise and pointwise convolutions into the DCC, resulting in a depthwise separable convolution structure, as illustrated in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The structure of depthwise separable convolution.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-3.tif"/>
</fig>
<p>Under identical input-output conditions, the computational cost of traditional convolution is given by <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>c</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x00D7;</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x00D7;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>N</mml:mi></mml:math></inline-formula>, whereas the cost of depthwise separable convolution is expressed as <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>DSC</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>Depth</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>Point</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x00D7;</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x00D7;</mml:mo><mml:mi>M</mml:mi><mml:mo>+</mml:mo><mml:msubsup><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x00D7;</mml:mo><mml:mi>M</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>N</mml:mi></mml:math></inline-formula>. The computational cost ratio between the two convolution types is <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow><mml:mtext>N</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>K</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, demonstrating that depthwise separable convolution effectively reduces the computational burden. Following this, batch normalization and activation functions are incorporated via residual skip connections to form a DS-TC block, as illustrated in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. A depthwise separable convolution consists of a depthwise convolution followed by a pointwise convolution. In this study, the depthwise convolution is implemented as a DCC. By stacking <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>i</mml:mi></mml:math></inline-formula> DS-TC blocks with dilation rates set to <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msup><mml:mn>2</mml:mn><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> in each block, multi-scale feature extraction is achieved.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The structure of the proposed DS-TC block.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-4.tif"/>
</fig>
<p>A dimension mismatch exists between the output features of the DS-TC blocks and the input features of the cascaded Transformer modules, which is addressed by AAP. Specifically, the length of the input temporal sequences varies depending on the task, leading to a corresponding change in the output feature dimension of the DS-TC blocks. Additionally, the number of stacked layers in both the DS-TC blocks and Transformer modules, as well as the parameters within the network, contribute to the mismatch in feature dimensions. Considering that the output feature dimension of the DS-TC block is <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:mo>(</mml:mo><mml:mi>B</mml:mi><mml:mo>,</mml:mo><mml:mi>C</mml:mi><mml:mo>,</mml:mo><mml:mi>T</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>B</mml:mi></mml:math></inline-formula> denotes batch size, <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>C</mml:mi></mml:math></inline-formula> represents the number of channels, and <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mi>T</mml:mi></mml:math></inline-formula> stands the time steps, the AAP is used. It performs global average pooling across the <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mi>T</mml:mi></mml:math></inline-formula> time steps for each channel, downsampling the temporal dimension to a fixed length <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>Transformer</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> which matches the input dimension of the Transformer module. Therefore, the cascading mechanism in this paper is expressed as <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mrow><mml:mtext>Transformer</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mtext>AAP</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mrow><mml:mtext>DS-TC</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The output of the DS TC block <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mrow><mml:mtext>DS-TC</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is connected to the input of the Transformer module <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mrow><mml:mtext>Transformer</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> through AAP. Moreover, global average pooling not only preserves the key features of the channels but also suppresses noise interference, which is particularly advantageous for processing data from sensors exposed to space environments.</p>
<p>The Transformer module receives features from the AAP to capture global dependencies. The structure of Transformer module is shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. The DS-TC block reduces the dimension of the temporal sequence, thereby reducing the computational cost of the Transformer module. Furthermore, AAP further aligns the feature dimensions, ensuring compatibility with the input requirements of the Transformer module. Initially, the features are added to the Transformer module through positional encoding. It encodes the positional information of the input sequence, enabling the network to learn how relative positions affect the structure, thus allowing it to extract temporal features. Global dependencies across different timesteps within the features are then captured through stacked Transformer encoders. The self-attention mechanism in Transformer enables each time step to attend to all other steps simultaneously, breaking the limitation of local receptive fields in traditional CNN or RNN. This is particularly beneficial for satellite data, where long-period events (e.g., orbital period) require modeling dependencies across many time steps. In multi-head attention setup, each head can learn to focus on different temporal scale, enabling the Transformer to process multi-scale features present in satellite failure scenarios. Notably, the activation function used in the Transformer encoders in this study is GELU which is preferred in attention-based Transformer architectures due to its beneficial properties, including nonlinearity, differentiability, and smoothness. These unique properties contribute significantly to training stability of the network. The output features of the stacked Transformer encoders in <xref ref-type="fig" rid="fig-5">Fig. 5</xref> form a tensor of shape <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:mo>(</mml:mo><mml:mi>B</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>B</mml:mi></mml:math></inline-formula> denotes the batch size, <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mtext>Transformer</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> the sequence length, and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:mtext>Transformer</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> the feature dimension determined by the Transformer&#x2019;s hidden dimension. This representation preserves global contextual information and is subsequently fed into the MHAP module for further feature aggregation.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The structure of the Transformer module.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-5.tif"/>
</fig>
<p>MHAP extracts multi-dimensional features from the Transformer output and a following fully connected layer outputs predicted mean and variance of RUL. Unlike conventional average or max pooling, it introduces a learnable query vector to compute a weighted sum over the entire sequence, leveraging the multi-head attention mechanism for enhanced feature fusion. Specifically, the input sequence <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula> and the expanded learnable query vector are linearly projected as follows.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">q</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mspace width="negativethinmathspace" /><mml:mi mathvariant="bold-italic">y</mml:mi></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">Q</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">K</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">V</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">V</mml:mi></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msubsup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">Q</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msubsup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, and <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msubsup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">V</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> are trainable weight matrices that project the input into query, key, and value representations for each individual attention head. The attention scores for each head are normalized as follows.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mtext>softmax</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">Q</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub><mml:msubsup><mml:mi mathvariant="bold-italic">K</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">T</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msqrt><mml:msub><mml:mi mathvariant="bold-italic">d</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:msub></mml:msqrt><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mi mathvariant="bold-italic">d</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">K</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> donates the dimension of the key vectors, which is used to prevent gradient explosion. The score matrix encodes the similarity weights between the query and each position in the sequence. Notably, the attention distribution learned by each head differs, incorporating multi-dimensional degradation features. Subsequently, the value vectors are weighted and combined using the attention scores to generate the output vector for each head, as follows.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">O</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">A</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mi mathvariant="bold-italic">o</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">n</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">V</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">h</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>finally, the concatenated outputs from all heads are integrated into the attention output through a linear layer, as follows.
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mrow><mml:mi mathvariant="bold-italic">O</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext>Concat</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">O</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">O</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x22EF;</mml:mo><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">O</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi mathvariant="bold-italic">u</mml:mi></mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">t</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">H</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">O</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msup><mml:mi mathvariant="bold-italic">W</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">O</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the output weight matrix. The output features are subsequently passed through a fully connected layer, yielding a two-dimensional vector representing the predicted mean and variance of RUL.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Epistemic and Aleatoric Uncertainty Quantification</title>
<p>To quantify the uncertainty arising from multi-scale features, this paper proposes a method framework for quantifying both epistemic and aleatoric uncertainty, comprising two stages: network training and testing. During training, the outputs of the CTCTN are used as inputs to a heteroscedastic Huber loss function for network parameter optimization. During testing, epistemic and aleatoric uncertainties are then quantified through the MCD method to calculate confidence intervals.</p>
<p>In the training stage, the heteroscedastic Huber loss function is designed to optimize the the mean <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> and variance <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> output branches of the CTCTN. The network&#x2019;s prediction is assumed to follow a Gaussian distribution: <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi mathvariant="bold-italic">N</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi mathvariant="bold-italic">x</mml:mi></mml:math></inline-formula> denotes the input data and <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi mathvariant="bold-italic">y</mml:mi></mml:math></inline-formula> corresponds to the predicted output [<xref ref-type="bibr" rid="ref-43">43</xref>,<xref ref-type="bibr" rid="ref-44">44</xref>]. To train this dual-output network, a heteroscedastic Huber loss function is given as follows.
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mrow><mml:mrow><mml:mtext>total</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mrow><mml:mrow><mml:mtext>huber</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:msub><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mrow><mml:mrow><mml:mtext>uncertainty</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mrow><mml:mrow><mml:mtext>huber</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x003C;</mml:mo><mml:mi>&#x03B4;</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03B4;</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mrow><mml:mrow><mml:mtext>uncertainty</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi mathvariant="bold-italic">N</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mo>{</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>10</mml:mn><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msub><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mrow><mml:mrow><mml:mtext>huber</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is the Huber loss and <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msub><mml:mi mathvariant="bold-italic">L</mml:mi><mml:mrow><mml:mrow><mml:mtext>uncertainty</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> is a variance-based uncertainty constraint. The Huber loss [<xref ref-type="bibr" rid="ref-45">45</xref>], tailored for regression tasks, integrates the characteristics of both mean squared error and mean absolute error, thereby mitigating noise sensitivity and improving model robustness. The uncertainty constraint includes a variance calibration term <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo>[</mml:mo><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and a variance regularization term <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>10</mml:mn><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The variance calibration term consists of the variance and the standardized residual <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mspace width="negativethinmathspace" /><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">i</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:math></inline-formula>. The predicted variance directly limits variance overestimation, while the residual term associates prediction errors with variance. The variance regularization term contains the natural logarithmic function to restrict excessive growth of variance and avoids instability when variance approaches zero. Network parameters are optimized using the AdamW algorithm.</p>
<p>In the testing stage, MCD is used to quantify predictive uncertainty. Originally introduced as a regularization method to avoid overfitting, dropout randomly deactivates neurons during training, thereby reducing reliance on specific network pathways. MCD extends this strategy by maintaining dropout activation in the testing stage. By executing multiple stochastic forward passes, it produces a distribution over predictions, which facilitates the estimation of uncertainty.</p>
<p>Predictive uncertainty is quantified using the mean and variance of the outputs from MCD. This uncertainty consists of two components: epistemic and aleatoric uncertainty [<xref ref-type="bibr" rid="ref-46">46</xref>,<xref ref-type="bibr" rid="ref-47">47</xref>]. Epistemic uncertainty stems from the variability of network parameters (e.g., weights) and reflects the uncertainty of the network itself. It arises when limited training data prevent accurate estimation of optimal parameters. Aleatoric uncertainty is attributed to noise from the data acquisition process (e.g., sensor error, environmental disturbance) and is not related to the model parameters. Even when the network parameters are fixed, aleatoric uncertainty persists due to randomness in the outputs. The total predictive uncertainty is given by:<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> represent epistemic and aleatoric uncertainty, respectively [<xref ref-type="bibr" rid="ref-48">48</xref>]. Epistemic uncertainty arises from variations in network parameters, which induce fluctuations in the expectation <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. This variability is quantified by <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, reflecting the intrinsic uncertainty within the network. In contrast, aleatoric uncertainty, expressed as <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>, directly captures the variance due to data noise. The 95% Confidence Interval (CI) [<xref ref-type="bibr" rid="ref-49">49</xref>] for predictions can be expressed as.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mi>C</mml:mi><mml:mi>I</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mtext>E</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>1.96</mml:mn><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mtext>Var</mml:mtext></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>The CTCTN Framework for Satellite Failure Prognosis and Uncertainty Quantification</title>
<p>To address the challenge of multi-scale feature extraction in SAP degradation for LEO satellites, this paper proposes a CTCTN framework for satellite failure prognosis and uncertainty quantification, as illustrated in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The proposed framework consists of three main components: scenario configuration and data processing, prediction network construction, and uncertainty quantification.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>The CTCTN framework for satellite failure prognosis and uncertainty quantification.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-6.tif"/>
</fig>
<p>In the first component, a LEO satellite simulation scenario is developed using a digital satellite development platform [<xref ref-type="bibr" rid="ref-50">50</xref>,<xref ref-type="bibr" rid="ref-51">51</xref>]. Subsequently, failures are injected into the satellite model during simulation to generate run-to-failure data, from which a satellite run-to-failure dataset is constructed under diverse operational conditions.</p>
<p>In the second component, the CTCTN architecture is proposed by combining temporal convolution with attention mechanisms to extract multi-scale degradation features from historical data. The network stacks DS-TC blocks to achieve local feature extraction and dimensionality reduction. An AAP then adaptively aligns feature dimensions, facilitating cascading of DS-TC blocks and Transformer modules. The Transformer module utilizes self-attention mechanisms to perform global contextual modeling of temporal features, establishing dependencies across different temporal scales and highlighting critical degradation patterns. By incorporating learnable query vectors with a multi-head attention, MHAP facilitates cross-scale feature interactions. Finally, fully connected layers are used to output the predictive mean and variance of the RUL.</p>
<p>In the third component, both epistemic and aleatoric uncertainties are quantified. During training, a heteroscedastic Huber loss function is employed to optimize the network parameters by jointly learning the predictive mean and variance of the RUL. The Huber loss function computes residuals using a piecewise structure. The uncertainty constraint processes predictive variance through a variance calibration term and a variance regularization term. During testing, the MCD method is applied to quantify both epistemic and aleatoric uncertainties. The proposed framework ultimately produces predictive intervals for RUL.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experiments and Results</title>
<p>The failure prognosis performance of the proposed CTCTN method is evaluated using an SAP degradation scenario for a LEO satellite. Firstly, a satellite model is developed based on a digital satellite development platform [<xref ref-type="bibr" rid="ref-50">50</xref>,<xref ref-type="bibr" rid="ref-51">51</xref>] which enables the construction of C&#x002B;&#x002B; satellite model code frameworks through standardized configuration files [<xref ref-type="bibr" rid="ref-38">38</xref>]. This satellite model is used to simulate the power generation degradation process resulting from SAP damage caused by space debris impacts [<xref ref-type="bibr" rid="ref-5">5</xref>&#x2013;<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-41">41</xref>,<xref ref-type="bibr" rid="ref-52">52</xref>]. The multi-scale features of the degradation process are analyzed by comparing the timescales of orbital dynamics, attitude maneuvers, and degradation process. Secondly, a dataset comprising run-to-failure data under various operational conditions is constructed to evaluate the predictive performance of the proposed CTCTN method for the SAP degradation scenario. An optimal set of hyperparameters is selected via grid search based on both predictive performance and uncertainty quantification performance. Ablation experiments are then conducted to validate the effectiveness of the CTCTN design. Finally, the proposed CTCTN is compared against current failure prognosis methods, demonstrating its superior predictive performance for the satellite SAP degradation scenario.</p>
<p>The failure scenario simulation and prognosis are performed using a Dell workstation equipped with Intel<sup>&#x00AE;</sup> Core&#x2122; i7-8700 CPU @ 3.20 GHz, 16 GB of RAM, and an NVIDIA GeForce GTX 1050 Ti GPU with 4 GB of VRAM. The software configuration of the simulation and prognosis are C&#x002B;&#x002B; and Python, respectively.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Dataset Description</title>
<p>A LEO satellite model is developed to generate run-to-failure datasets under various operational conditions. Space debris poses a serious threat to satellite safety, and a damage to SAP can lead to significant degradation of power generation capacity [<xref ref-type="bibr" rid="ref-39">39</xref>,<xref ref-type="bibr" rid="ref-40">40</xref>]. Accurate RUL prediction for satellites SAP degradation is therefore critical [<xref ref-type="bibr" rid="ref-53">53</xref>]. Accordingly, this study develops a satellite model to simulate the power output degradation process of a damaged SAP. The satellite model integrates multiple subsystems, including attitude and orbit control, power, thermal control, propulsion, payload, and structure subsystem. For more model details, readers can refer to references [<xref ref-type="bibr" rid="ref-54">54</xref>,<xref ref-type="bibr" rid="ref-55">55</xref>]. The attitude and orbit control subsystem governs orbital and attitude maneuvers, while the power and thermal control subsystems manage energy and thermal balance, respectively. In the healthy state, the output power of the SAP is expressed as follows:<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mi>&#x03B7;</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>W</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> identifies whether the solar wings are in the Earth&#x2019;s shadow, <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> quantifies the solar irradiance, <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the area of the photovoltaic array on the solar wings, <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>&#x03B7;</mml:mi></mml:math></inline-formula> denotes the photoelectric conversion efficiency of the array, <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>W</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> describes the angle between the normal vector of the solar wings and the sunlight&#x2019;s direction, <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the power temperature coefficient of the solar wings, <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> encompasses additional coefficients, and <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the temperature differential from the standard temperature of the solar wings.</p>
<p>At a random time during the simulation, a failure is injected, after which the output power of the SAP begins to degrade. The injected parameter is the degradation duration <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>duration</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>. Both the failure injection time and the degradation duration are randomized to generate diverse operating conditions for network training and to enhance its generalization capability. Following fault injection, the degraded output power of the SAP is expressed as <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mo>,</mml:mo><mml:mi>deg</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mtext>radation</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>deg</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:msup></mml:math></inline-formula>, where <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mi>k</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>duration</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi></mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>degradation</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> represents the simulation time of the degradation process, and <italic>k</italic> denotes the degradation coefficient. To account the uncertainty in the degradation process, a multiplicative uniform noise of &#x00B1;5% is introduced to the degradation coefficient.</p>
<p>The initial parameters for the satellite model based on the real LEO satellite (referred to as SL) are listed in <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>The initial configuration parameters for the satellite model.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Value</th>
</tr>
</thead>
<tbody>
<tr>
<td>Orbit elements</td>
<td>{7,018,455 m, 0.002, 97.948&#x00B0;, 284.766&#x00B0;, 217.387&#x00B0;, 142.619&#x00B0;}</td>
</tr>
<tr>
<td>Attitude</td>
<td>{0&#x00B0;, 0&#x00B0;, 0&#x00B0;}</td>
</tr>
<tr>
<td>Charge voltage (V)</td>
<td>28.324</td>
</tr>
<tr>
<td>Capacity (mAh)</td>
<td>70,000</td>
</tr>
<tr>
<td>SAP area (m<sup>2</sup>)</td>
<td>6</td>
</tr>
<tr>
<td>SAP photoelectricity conversion efficiency</td>
<td>0.3</td>
</tr>
<tr>
<td>SAP power-temperature coefficient</td>
<td>&#x2212;0.0002</td>
</tr>
<tr>
<td>SAP Max Output Power (W)</td>
<td>1260</td>
</tr>
<tr>
<td>Initial time (UTC)</td>
<td>2019-9-22 00:00:00</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> presents a comparison between the telemetry data of SL and the simulation data generated by the satellite model. In <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, the solid line represents the telemetry data, while the marked line denotes the simulation data. It can be observed that the orbital and attitude of the satellite model are consistent with telemetry data. Moreover, the trends of component parameters&#x2014;such as current, voltage, and temperature&#x2014;also exhibit strong agreement. These results confirm that the operating condition of the satellite model are consistent with SL.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Comparison between telemetry data and simulation data: (<bold>a</bold>) position; (<bold>b</bold>) velocity; (<bold>c</bold>) attitude angular; (<bold>d</bold>) attitude angular velocity; (<bold>e</bold>) torque of the wheel; (<bold>f</bold>) bus voltage; (<bold>g</bold>) battery charging and discharging current; (<bold>h</bold>) SAP current; (<bold>i</bold>) SAP temperature.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-7a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-7b.tif"/>
</fig>
<p>The multi-scale features in the degradation process are analyzed using the simulation data shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, under both normal and degraded states. In <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, the blue line represents the normal operational data, while the red line corresponds to the run-to-failure data. Moreover, the <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>EOL</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> at 32,100 s and the <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>FPT</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> at 7000 s are both marked using red dashed lines. The orbital period, highlighted by a blue box, is 6000 s. A 2000-s window, highlighted by the green box, of SAP output power before the moment <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> (marked by a yellow star) is used as a sample, with the RUL at <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> serving as the label.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>The simulation data in normal and SAP degradation scenario.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-8.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, the output power of SAP exhibits progressive degradation following fault injection. This simulation is based on the performance degradation process of a damaged SAP described in previous studies [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-52">52</xref>]. During the initial degradation stage, the limited extent of damage has only a minor impact on SAP power generation. The power subsystem is still able to maintain energy balance, and battery capacity remains largely unchanged. Subsequently, as the severity of degradation increases, the energy balance is disrupted, leading to an accelerated battery consumption. Due to the continuously changing relative positions of the satellite, Earth, and Sun, the satellite periodically enters Earth&#x2019;s shadow. During these eclipse periods, the SAP cannot perform photoelectric conversion, causing its power output to drop to zero. The satellite also adjusts its attitude to an Earth-pointing mode during this time. It is noteworthy that the RUL cannot be inferred from the power data during eclipse, introducing uncertainty into the prediction. After exiting the eclipse, the satellite readjusts its attitude to a Sun-pointing mode, and the SAP power gradually recovers. Compared to the orbital period, the satellite&#x2019;s attitude maneuver occurs rapidly, while SAP degradation is a slow process. These factors give rise to multi-scale features in the SAP power degradation process.</p>
<p>The satellite run-to-failure dataset comprises simulation data from 10 operational conditions, with the specific failure scenario parameters detailed in <xref ref-type="table" rid="table-2">Table 2</xref>. The simulation model records data at a frequency of 1 Hz (once per second). Starting from the 2500-s into the simulation, the SAP output power over the preceding 2000 s is collected every 5 min as a sample. A total of 1022 samples are collected, with the number of samples per operating condition detailed in <xref ref-type="table" rid="table-2">Table 2</xref>. The RUL at the time of sample collection, normalized between 0 and 1 according to <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, is assigned as the label. This data processing and labeling strategy is the same as logic of real satellite failure prognosis, where the RUL at a moment is inferred from recent historical data. Each operational condition is simulated once to generate the corresponding samples. To evaluate generalization capability, a leave-one-out strategy is adopted. Specifically, one operating condition is used as the test set, while the remaining conditions constitute the training set, and the average value of the evaluation metrics across all conditions are calculated. To mitigate overfitting, 20% of the training samples are reserved as a validation set.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>The configuration of 10 operational conditions in the satellite run-to-failure dataset.</title>
</caption>
<table>
<colgroup>
<col align="center" width="20mm"/>
<col align="center" width="30mm"/>
<col align="center" width="30mm"/>
<col align="center" width="30mm"/>
<col align="center" width="20mm"/> </colgroup>
<thead>
<tr>
<th>Condition Number</th>
<th>Failure Initiation Time (min)</th>
<th>Failure Duration (min)</th>
<th>Total Simulation Duration (min)</th>
<th>Sample Number</th>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>108</td>
<td>128</td>
<td>236</td>
<td>48</td>
</tr>
<tr>
<td>2</td>
<td>175</td>
<td>651</td>
<td>826</td>
<td>166</td>
</tr>
<tr>
<td>3</td>
<td>108</td>
<td>462</td>
<td>570</td>
<td>121</td>
</tr>
<tr>
<td>4</td>
<td>275</td>
<td>166</td>
<td>441</td>
<td>89</td>
</tr>
<tr>
<td>5</td>
<td>308</td>
<td>171</td>
<td>479</td>
<td>96</td>
</tr>
<tr>
<td>6</td>
<td>75</td>
<td>622</td>
<td>697</td>
<td>140</td>
</tr>
<tr>
<td>7</td>
<td>108</td>
<td>309</td>
<td>417</td>
<td>84</td>
</tr>
<tr>
<td>8</td>
<td>75</td>
<td>367</td>
<td>442</td>
<td>89</td>
</tr>
<tr>
<td>9</td>
<td>341</td>
<td>135</td>
<td>476</td>
<td>96</td>
</tr>
<tr>
<td>10</td>
<td>41</td>
<td>455</td>
<td>496</td>
<td>93</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Hyperparameter</title>
<p>To avoid the impact of hyperparameters on prediction performance, random search is adopted for hyperparameter optimization. The search ranges and corresponding results are listed in <xref ref-type="table" rid="table-3">Table 3</xref>. To reduce the risk of overfitting, a dropout rate is set to 0.2. GELU is used as the activation function to provide a smooth, non-linear activation. The AdamW optimizer is employed to minimize the loss function and update network parameters. The learning rate is set to 0.001, the batch size is set to 128, and the number of epochs is 500. &#x03B1; and &#x03B4; are set to 0.1 and 1, respectively, in proposed heteroscedastic Huber loss function. Finally, the number of Monte Carlo iterations is set to 100.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>The optimal hyperparameters of the proposed CTCTN.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Parameter</th>
<th>Range</th>
<th>Configuration</th>
</tr>
</thead>
<tbody>
<tr>
<td>Convolution channels</td>
<td>[16, 32, 64]</td>
<td>16</td>
</tr>
<tr>
<td>Kernel size</td>
<td>[3, 5, 7]</td>
<td>7</td>
</tr>
<tr>
<td>DS-TC layers</td>
<td>[1, 2, 3, 4]</td>
<td>2</td>
</tr>
<tr>
<td>Transformer dimensions</td>
<td>[16, 32, 64]</td>
<td>64</td>
</tr>
<tr>
<td>Heads</td>
<td>[4, 8, 16]</td>
<td>16</td>
</tr>
<tr>
<td>Transformer layers</td>
<td>[1, 2, 3, 4]</td>
<td>3</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Predicted Results</title>
<p>The predictive performance of the proposed CTCTN is evaluated using the satellite run-to-failure dataset. <xref ref-type="fig" rid="fig-9">Fig. 9</xref> illustrates the predicted RUL for operational conditions 9 and 10 under the leave-one-out testing. In the upper subplot, the blue line denotes the true RUL, the red line represents the predicted RUL, and the gray-shaded area indicates the 95% confidence interval. In the lower subplot, the blue points correspond to epistemic uncertainty, the red points to aleatoric uncertainty, and the black points to total uncertainty.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>The predicted RUL and uncertainty quantification results: (<bold>a</bold>) operational condition 9; (<bold>b</bold>) operational condition 10.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-9.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, the proposed CTCTN effectively predicts the RUL of the satellite SAP. During the healthy stage, the predicted RUL closely matches the true RUL, and the associated uncertainty remains stable. In the degradation stage, both the predicted RUL and uncertainty exhibit periodic fluctuations, which are particularly pronounced under operational condition 10. These fluctuations correspond to eclipse periods, during which the SAP generates zero power, thereby affecting the RUL prediction. Despite this, the overall degradation trends of the true and predicted RUL remain consistent, and the true RUL is consistently encompassed within the predicted uncertainty interval. Furthermore, in the uncertainty quantification results, the aleatoric uncertainty is larger than the epistemic uncertainty, representing the main part of the total uncertainty. This indicates that the network has effectively learned the degradation patterns, while the multi-scale features of the satellite system primarily contribute to the aleatoric uncertainty in the predicted RUL. In summary, the proposed CTCTN framework effectively predicts the RUL of the satellite SAP and provides well uncertainty quantification.</p>

</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Ablation Experiment</title>
<p>To validate the effectiveness of the cascaded design in CTCTN, ablation experiments are conducted on modules and connection types. Experimental configurations are listed in <xref ref-type="table" rid="table-4">Table 4</xref>, where Models A and B include only a single module, while Models C, D, and E employ different connection types.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>The configuration of failure scenarios.</title>
</caption>
<table>
<colgroup>
<col align="center" width="17mm"/>
<col align="center" width="19mm"/>
<col align="center" width="19mm"/>
<col align="center" width="35mm"/>
<col align="center" width="42mm"/> </colgroup>
<thead>
<tr>
<th>Model</th>
<th>DS-TC</th>
<th>Transformer</th>
<th>Connection Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td>Model A</td>
<td>&#x221A;</td>
<td>&#x00D7;</td>
<td>&#x2013;</td>
<td>Only DS-TC</td>
</tr>
<tr>
<td>Model B</td>
<td>&#x00D7;</td>
<td>&#x221A;</td>
<td>&#x2013;</td>
<td>Only Transformer</td>
</tr>
<tr>
<td>Model C</td>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td>0</td>
<td>Parallel TC-Transformer</td>
</tr>
<tr>
<td>Model D</td>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td>1</td>
<td>Cascade Transformer-TC</td>
</tr>
<tr>
<td>Model E</td>
<td>&#x221A;</td>
<td>&#x221A;</td>
<td>2</td>
<td>Cascade TC-Transformer</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The prediction results of each model are presented in <xref ref-type="table" rid="table-5">Table 5</xref>, demonstrating the effectiveness of the proposed CTCTN structure. Firstly, compared to Model A, Model E achieves RMSE reductions of 50%, with corresponding MAE reductions of 49%. Similarly, compared to Model B, Model E reduces RMSE by 45%, and MAE by 42%. There results indicate that Models A and B, which incorporate only a single module, exhibit limited predictive capability for multi-scale degradation features, as they are restricted to processing either local or global features alone. Secondly, Model E reduces RMSE by 54% compared to Model C, with MAE reductions of 58%. Compared to Model D, Model E achieves RMSE reductions of 55%, and MAE reductions of 57%. These results demonstrate the impact of different connection types on predictive performance for the satellite SAP degradation process.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Prediction results of the ablation experiment.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Method</th>
<th colspan="2">RMSE</th>
<th colspan="2">MAE</th>
<th colspan="2">PICP</th>
<th colspan="2">MPIW</th>
</tr>
</thead>
<tbody>
<tr>
<td>Model A</td>
<td>0.2471</td>
<td>(-)</td>
<td>0.1835</td>
<td>(-)</td>
<td>0.8813</td>
<td>(-)</td>
<td>0.7879</td>
<td>(-)</td>
</tr>
<tr>
<td>Model B</td>
<td>0.2233</td>
<td>(&#x002B;9.63%)</td>
<td>0.1595</td>
<td>(&#x002B;13.11%)</td>
<td>0.8494</td>
<td>(&#x2212;3.62%)</td>
<td>0.7103</td>
<td>(&#x002B;9.84%)</td>
</tr>
<tr>
<td>Model C</td>
<td>0.2695</td>
<td>(&#x2212;9.06%)</td>
<td>0.2206</td>
<td>(&#x2212;20.20%)</td>
<td>0.8318</td>
<td>(&#x2212;5.62%)</td>
<td>0.7265</td>
<td>(&#x002B;7.79%)</td>
</tr>
<tr>
<td>Model D</td>
<td>0.2747</td>
<td>(&#x2212;11.16%)</td>
<td>0.2160</td>
<td>(&#x2212;17.70%)</td>
<td>0.8213</td>
<td>(&#x2212;6.81%)</td>
<td>0.6959</td>
<td>(&#x002B;11.67%)</td>
</tr>
<tr>
<td>Model E</td>
<td>0.1236</td>
<td>(&#x002B;49.98%)</td>
<td>0.0930</td>
<td>(&#x002B;49.32%)</td>
<td>0.9829</td>
<td>(&#x002B;11.53%)</td>
<td>0.6879</td>
<td>(&#x002B;12.69%)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The impact of connection types on predictive performance is further examined. Model C shows no improvements over Model A and B. This suggests that, the parallel structure fails to fully exploit the advantages of the single module. In model D, the Transformer first transforms multi-scale features into a global representation, but the subsequent DS-TC is unable to sufficiently capture local patterns, resulting in a poor predictive performance. In contrast, the proposed cascaded design&#x2014;where the DS-TC preceding the Transformer&#x2014;achieves effective multi-scale feature fusion and superior prognostics. This arrangement allows the DS-TC to extract local features while performing dimensionality reduction, and simultaneously enhances the Transformer&#x2019;s capacity to model long-range dependencies.</p>
<p>Furthermore, the capability for uncertainty quantification is evaluated using the PICP and MPIW metrics. Model E achieves the highest PICP values and the narrowest MPIW. This indicates that the proposed CTCTN structure not only provides the most reliable coverage of uncertainty intervals but also produces the tightest interval widths, demonstrating superior uncertainty quantification performance for satellite failure prognosis.</p>
<p>A comparative analysis is further conducted to evaluate performance differences among different modules integrated after the Cascade TC-Transformer. The results are summarized in <xref ref-type="table" rid="table-6">Table 6</xref>. Compared with the Global Average Pooling (GAP), MHAP achieves a 63% reduction in RMSE and a 69% reduction in MAE. The inferior predictive performance of GAP can be attributed to its averaging across all time steps, which limits its ability to capture multiscale feature variations. In addition, compared with the Classification (CLS) token, MHAP yieldes a 46% reduction in both RMSE and MAE. By leveraging the multi-head attention mechanism, MHAP exhibits a stronger capability for extracting multi-scale features than the CLS token. Consequently, MHAP is better suited for the satellite fault prognosis task.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Prediction results of CTCTN with different module.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Method</th>
<th>RMSE</th>
<th>MAE</th>
<th>PICP</th>
<th>MPIW</th>
</tr>
</thead>
<tbody>
<tr>
<td>Cascade TC-Transformer with CLS token</td>
<td>0.3336</td>
<td>0.2987</td>
<td>0.9210</td>
<td>1.0269</td>
</tr>
<tr>
<td>Cascade TC-Transformer &#x002B; GAP</td>
<td>0.2287</td>
<td>0.1708</td>
<td>0.8598</td>
<td>0.7142</td>
</tr>
<tr>
<td>Cascade TC-Transformer &#x002B; MHAP</td>
<td>0.1236</td>
<td>0.0930</td>
<td>0.9829</td>
<td>0.6879</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_5">
<label>4.5</label>
<title>Comparison Experiment</title>
<p>To further validate the performance of the proposed CTCTN for satellite failure prognosis, it is compared with current prognostic methods. The specific configurations of these comparative methods are detailed as follows, with hyperparameters kept consistent with those of the proposed method:<list list-type="order">
<list-item>
<p>MCA-TCN [<xref ref-type="bibr" rid="ref-35">35</xref>]: The network integrates three TCN blocks with multi-channel attention for feature fusion. Each TCN block contains three dilated convolutional layers with 16 channels and a kernel size of seven. The fused features are processed by a GRU layer with 18 hidden units, followed by a fully connected layer for the RUL.</p></list-item>
<list-item>
<p>TCLSTM [<xref ref-type="bibr" rid="ref-33">33</xref>]: This network uses a TCN module with one layer and 16 channels, followed by an LSTM layer with 16 hidden units and an attention mechanism. The TCN kernel size is seven. The attended features are passed to a fully connected layer for output.</p></list-item>
<list-item>
<p>Attention-BiLSTM [<xref ref-type="bibr" rid="ref-56">56</xref>]: The network architecture consists of a two-layer BiLSTM with an attention mechanism, where each LSTM layer comprises 16 hidden units.</p></list-item>
<list-item>
<p>Transformer-LSTM [<xref ref-type="bibr" rid="ref-36">36</xref>]: This architecture employs a three-layer Transformer followed by a two-layer LSTM. The Transformer module is configured with 16 heads, while each LSTM layers contains 16 hidden units.</p></list-item>
<list-item>
<p>Informer [<xref ref-type="bibr" rid="ref-57">57</xref>]: The network employs a ProbSparse self-attention mechanism to reduce computational complexity, stacking three encoder layers with distilling operations to progressively shorten the sequence length. A global average pooling layer followed by a fully connected layer outputs the predicted mean and variance of the RUL.</p></list-item>
<list-item>
<p>PatchTST [<xref ref-type="bibr" rid="ref-58">58</xref>]: The model segments the input univariate time series into patches of length 16 with a stride of 8, linearly projecting each patch into a 64-dimensional representation. After processing by three Transformer encoder layers, the feature of the last patch is fed into a fully connected layer to produce the RUL mean and variance.</p></list-item>
<list-item>
<p>CNN-Transformer [<xref ref-type="bibr" rid="ref-37">37</xref>]: The network composed of a two-layer CNN followed by a three-layer Transformer. CNN uses 16 channels with a kernel size of seven, whereas the Transformer is configured with 16 heads.</p></list-item>
</list></p>
<p><xref ref-type="fig" rid="fig-10">Fig. 10</xref> presents the prediction results of all methods under operating conditions 9 and 10, where the lines represent the true RUL and the predicted RUL of each method and the scatter plots depict the overall uncertainty. It is evident that the proposed CTCTN achieves superior predictive performance. Specifically, during the healthy state, the RUL predicted by CTCTN remains consistently close to the true RUL. In contrast, methods including CNN-Transformer and MCA-TCN yield lower RUL predictions under condition 9. Furthermore, during the degradation state, the predicted RUL from CTCTN more accurately tracks the true RUL, whereas TCLSTM, Attention-BiLSTM, Transformer-LSTM, and CNN-Transformer exhibit larger fluctuations.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>The predicted RUL and uncertainty quantification results of all methods: (<bold>a</bold>) operational condition 9; (<bold>b</bold>) operational condition 10.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-10.tif"/>
</fig>
<p>The statistic prediction results of all methods are summarized in <xref ref-type="fig" rid="fig-11">Fig. 11</xref> and <xref ref-type="table" rid="table-7">Table 7</xref>. To avoid the impact of randomness, 10 repetitions of the experiment are conducted and the mean and variance are reported. The findings demonstrate that the proposed CTCTN method achieves the best overall performance in terms of both prediction accuracy and uncertainty quantification. TCLSTM exploits the strengths of TCN in extracting temporal features from historical data for RUL prediction. However, their feature extraction capabilities are limited in the satellite SAP degradation scenario, which involves multi-scale features. Although TCLSTM incorporates an attention mechanism, its single-head attention cannot simultaneously capture degradation patters across multiple time scales. A similar limitation is also observed in the attention-based MCA-TCN. The predictive performance of Transformer-LSTM is constrained by its preceding Transformer module, which is consistent with the findings of the ablation study. Although the architecture of CNN-Transformer is similar to that of the proposed CTCTN, CNNs have limited capacity in processing temporal data. Attention-BiLSTM, owing to its residual connections, effectively mitigates the vanishing gradient problem and consequently achieves relatively low RMSE. Informer and PatchTST are recent strong baselines. Compared with Informer, the proposed CTCTN reduces RMSE and MAE by 10.60% and 12.65%, respectively. Furthermore, while achieving a PICP of 98.48%, the proposed CTCTN also yields a relatively low MPIW. In summary, the proposed CTCTN effectively captures multi-scale features in satellite SAP degradation data, leading to state-of-the-art predictive performance and superior uncertainty quantification.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Prediction results of the comparative experiment: (<bold>a</bold>) MCA-TCN; (<bold>b</bold>) TCLSTM; (<bold>c</bold>) Attention-BiLSTM; (<bold>d</bold>) Transformer-LSTM; (<bold>e</bold>) CNN-Transformer; (<bold>f</bold>) Informer; (<bold>g</bold>) PatchTST; (<bold>h</bold>) Proposed CTCTN.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-11a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-11b.tif"/>
</fig><table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Prediction results of the comparative experiment.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Method</th>
<th>RMSE</th>
<th>MAE</th>
<th>PICP</th>
<th>MPIW</th>
</tr>
</thead>
<tbody>
<tr>
<td>MCA-TCN</td>
<td>0.2058 &#x00B1; 0.0189</td>
<td>0.1654 &#x00B1; 0.0175</td>
<td>0.9417 &#x00B1; 0.0180</td>
<td>0.7950 &#x00B1; 0.0164</td>
</tr>
<tr>
<td>TCLSTM</td>
<td>0.2057 &#x00B1; 0.0086</td>
<td>0.1571 &#x00B1; 0.0066</td>
<td>0.9049 &#x00B1; 0.0141</td>
<td>0.7518 &#x00B1; 0.0143</td>
</tr>
<tr>
<td>Attention-BiLSTM</td>
<td>0.1497 &#x00B1; 0.0077</td>
<td>0.1117 &#x00B1; 0.0066</td>
<td>0.9265 &#x00B1; 0.0112</td>
<td>0.6356 &#x00B1; 0.0082</td>
</tr>
<tr>
<td>Transformer-LSTM</td>
<td>0.2598 &#x00B1; 0.0105</td>
<td>0.1933 &#x00B1; 0.0093</td>
<td>0.8053 &#x00B1; 0.0167</td>
<td>0.6702 &#x00B1; 0.0231</td>
</tr>
<tr>
<td>CNN-Transformer</td>
<td>0.2732 &#x00B1; 0.0075</td>
<td>0.2174 &#x00B1; 0.0080</td>
<td>0.8406 &#x00B1; 0.0271</td>
<td>0.7318 &#x00B1; 0.0262</td>
</tr>
<tr>
<td>Informer</td>
<td>0.1525 &#x00B1; 0.0091</td>
<td>0.1189 &#x00B1; 0.0077</td>
<td>0.9732 &#x00B1; 0.0080</td>
<td>0.7501 &#x00B1; 0.0172</td>
</tr>
<tr>
<td>PatchTST</td>
<td>0.1591 &#x00B1; 0.0072</td>
<td>0.1227 &#x00B1; 0.0064</td>
<td>0.9697 &#x00B1; 0.0042</td>
<td>0.7457 &#x00B1; 0.0295</td>
</tr>
<tr>
<td>Proposed CTCTN</td>
<td>0.1236 &#x00B1; 0.0087</td>
<td>0.0930 &#x00B1; 0.0074</td>
<td>0.9829 &#x00B1; 0.0046</td>
<td>0.6879 &#x00B1; 0.0316</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_6">
<label>4.6</label>
<title>Analysis of Computational Complexity</title>
<p>For resource-constrained satellite applications, computational complexityof the prognostic method is critical. <xref ref-type="table" rid="table-8">Table 8</xref> presents the parameter counts, FLOP counts, and average inference time per sample for each comparative method. It can be observed that the proposed CTCTN achieves a computational efficiency that satisfies the requirements for real-time processing. Specifically, compared with Informer and PatchTST, the proposed CTCTN achieves better predictive performance while having lower inference time and fewer parameters.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Computational complexity of all methods.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/> </colgroup>
<thead>
<tr>
<th>Method</th>
<th>Parameters</th>
<th>FLOPs</th>
<th>Inference Time (ms/sample)</th>
</tr>
</thead>
<tbody>
<tr>
<td>MCA-TCN</td>
<td>19.786K</td>
<td>1.213G</td>
<td>0.3227</td>
</tr>
<tr>
<td>TCLSTM</td>
<td>3.826K</td>
<td>15.068M</td>
<td>0.0420</td>
</tr>
<tr>
<td>Attention-BiLSTM</td>
<td>11.810K</td>
<td>665.662M</td>
<td>0.0841</td>
</tr>
<tr>
<td>Transformer-LSTM</td>
<td>8.050K</td>
<td>130.057M</td>
<td>0.1236</td>
</tr>
<tr>
<td>CNN-Transformer</td>
<td>3.690K</td>
<td>25.412M</td>
<td>0.3562</td>
</tr>
<tr>
<td>Informer</td>
<td>113.778K</td>
<td>5.585G</td>
<td>3.112</td>
</tr>
<tr>
<td>PatchTST</td>
<td>102.194K</td>
<td>803.718M</td>
<td>1.0177</td>
</tr>
<tr>
<td>Proposed CTCTN</td>
<td>69.970K</td>
<td>184.490M</td>
<td>0.1463</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_7">
<label>4.7</label>
<title>Discussion</title>
<p>Based on the experiments presented above, the proposed CTCTN achieves superior prognostic performance compared with existing methods in the satellite SAP degradation scenario. This advantage arises from the alignment between the network architecture and the multi-scale characteristics of the degradation process. Traditional TCN-based methods, although capable of enlarging the receptive field through stacked DCCs, still process sequences using local sliding windows, which inherently limits their ability to model global dependencies. Attention-based methods excel at capturing long-range dependencies but exhibit limited capability in modeling local temporal features. CTCTN addresses these limitations through a cascaded design that leverages complementary strengths. The front-end DS-TC block extracts local features while simultaneously reducing sequence length. The subsequent Transformer module then performs multi-head self-attention within the compressed feature space, enabling each time step to capture long-term dependencies across the entire degradation process. <xref ref-type="fig" rid="fig-12">Fig. 12</xref> shows the heat maps of the attention weights of the 4 heads in the Transformer module. The x-axis and y-axis represent the time steps being focused on and the current time step, respectively. From the diagonal distribution to the global distribution, the different distribution patterns of the attention weights indicate that features of the different time scales have been learned by the Transformer module. This progressive fusion strategy makes CTCTN superior to both single-module architectures and traditional hybrid structures. This cascaded design constitutes the core innovation of this paper.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Heat maps of attention weights from Transformer: (<bold>a</bold>) Head 2; (<bold>b</bold>) Head 5; (<bold>c</bold>) Head 8; (<bold>d</bold>) Head 15.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_80577-fig-12.tif"/>
</fig>
<p>While CTCTN demonstrates robust prognostic capability in simulated scenarios, it presents several challenges against transferring CTCTN to other prognostics domains, which also indicate promising directions for future research. The distribution differences between the source domain and the target domain limit the generalizability of the prediction methods. Therefore, cross-domain research represents a potential direction.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusions</title>
<p>To address the challenges of failure prognosis and uncertainty quantification for SAP degradation in LEO satellite, this paper proposes CTCTN. Firstly, an AAP is used to align feature dimensions between the DS-TC blocks and the Transformer modules, enabling effective extraction of multi-scale degradation features. Secondly, during training, a heteroscedastic Huber loss function is designed to jointly optimize the dual output branches of the CTCTN for predicting the RUL mean and variance. Finally, during the testing stage, the MCD method is used to quantify both epistemic and aleatoric uncertainty and estimates the predictive confidence intervals, effectively capturing uncertainty arising from multi-scale features. A satellite model is developed, and a run-to-failure dataset is constructed to validate the proposed CTCTN method under the SAP performance degradation scenario of LEO satellite. Experimental results demonstrate that the proposed CTCTN method not only achieves more accurate RUL predictions but also effectively quantifies the uncertainty associated with multi-scale degradation features.</p>
</sec>
</body>
<back>
<ack>
<p>The authors were partially supported by the Key Laboratory of Spacecraft Design Optimization and Dynamic Simulation Technologies, Ministry of Education.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: Conceptualization, Yunfeng Dong; methodology, Yu Shi; software, Yu Shi; validation, Yu Shi and Lu Tian; formal analysis, Yu Shi and Lu Tian; investigation, Yu Shi; resources, Yu Shi; data curation, Yu Shi; writing&#x2014;original draft preparation, Yu Shi and Yunfeng Dong; writing&#x2014;review and editing, Yu Shi, Yunfeng Dong and Lu Tian; visualization, Yu Shi; supervision, Yunfeng Dong; project administration, Yunfeng Dong. All authors reviewed and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The data that support the findings of this study are available from the corresponding author, upon reasonable request.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest.</p>
</sec>
<glossary content-type="abbreviations" id="glossary-1">
<title>Abbreviations</title>
<def-list>
<def-item>
<term>AAP</term>
<def>
<p>Adaptive Average Pooling</p>
</def>
</def-item>
<def-item>
<term>CBAM</term>
<def>
<p>Convolutional Block Attention Module</p>
</def>
</def-item>
<def-item>
<term>CI</term>
<def>
<p>Confidence Interval</p>
</def>
</def-item>
<def-item>
<term>CLS</term>
<def>
<p>Classification</p>
</def>
</def-item>
<def-item>
<term>CMGs</term>
<def>
<p>Control Moment Gyros</p>
</def>
</def-item>
<def-item>
<term>CNN</term>
<def>
<p>Convolutional Neural Network</p>
</def>
</def-item>
<def-item>
<term>CTCTN</term>
<def>
<p>Cascade Temporal Convolution and Transformer Network</p>
</def>
</def-item>
<def-item>
<term>DCC</term>
<def>
<p>Dilated Causal Convolution</p>
</def>
</def-item>
<def-item>
<term>DS-TC</term>
<def>
<p>Depthwise Separable Temporal Convolution</p>
</def>
</def-item>
<def-item>
<term>EMD</term>
<def>
<p>Empirical Mode Decomposition</p>
</def>
</def-item>
<def-item>
<term>EOL</term>
<def>
<p>End of Life</p>
</def>
</def-item>
<def-item>
<term>FPT</term>
<def>
<p>First Prediction Time</p>
</def>
</def-item>
<def-item>
<term>GAP</term>
<def>
<p>Global Average Pooling</p>
</def>
</def-item>
<def-item>
<term>GELU</term>
<def>
<p>Gaussian Error Linear Unit</p>
</def>
</def-item>
<def-item>
<term>HI</term>
<def>
<p>Health Indicators</p>
</def>
</def-item>
<def-item>
<term>ISHM</term>
<def>
<p>Integrated System Health Management</p>
</def>
</def-item>
<def-item>
<term>LEO</term>
<def>
<p>Low Earth Orbit</p>
</def>
</def-item>
<def-item>
<term>LSTM</term>
<def>
<p>Long Short-Term Memory</p>
</def>
</def-item>
<def-item>
<term>MAE</term>
<def>
<p>Mean Absolute Error</p>
</def>
</def-item>
<def-item>
<term>MCD</term>
<def>
<p>Monte Carlo Dropout</p>
</def>
</def-item>
<def-item>
<term>MHAP</term>
<def>
<p>Multi-Head Attention Pooling</p>
</def>
</def-item>
<def-item>
<term>MPIW</term>
<def>
<p>Mean Prediction Interval Width</p>
</def>
</def-item>
<def-item>
<term>PICP</term>
<def>
<p>Prediction Interval Coverage Probability</p>
</def>
</def-item>
<def-item>
<term>ReLU</term>
<def>
<p>Rectified Linear Unit</p>
</def>
</def-item>
<def-item>
<term>RF</term>
<def>
<p>Random Forest</p>
</def>
</def-item>
<def-item>
<term>RMSE</term>
<def>
<p>Root Mean Squared Error</p>
</def>
</def-item>
<def-item>
<term>RNN</term>
<def>
<p>Recurrent Neural Network</p>
</def>
</def-item>
<def-item>
<term>RUL</term>
<def>
<p>Remaining Useful Life</p>
</def>
</def-item>
<def-item>
<term>SAP</term>
<def>
<p>Solar Array Paddle</p>
</def>
</def-item>
<def-item>
<term>SVM</term>
<def>
<p>Support Vector Machine</p>
</def>
</def-item>
<def-item>
<term>TCN</term>
<def>
<p>Temporal Convolutional Network</p>
</def>
</def-item>
</def-list>
</glossary>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ranasinghe</surname> <given-names>K</given-names></string-name>, <string-name><surname>Sabatini</surname> <given-names>R</given-names></string-name>, <string-name><surname>Gardi</surname> <given-names>A</given-names></string-name>, <string-name><surname>Bijjahalli</surname> <given-names>S</given-names></string-name>, <string-name><surname>Kapoor</surname> <given-names>R</given-names></string-name>, <string-name><surname>Fahey</surname> <given-names>T</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Advances in integrated system health management for mission-essential and safety-critical aerospace applications</article-title>. <source>Prog Aerosp Sci</source>. <year>2022</year>;<volume>128</volume>(<issue>2</issue>):<fpage>100758</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.paerosci.2021.100758</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Foster</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>Practical system to remove lethal untracked orbital debris</article-title>. <source>J Aerosp Inf Syst</source>. <year>2022</year>;<volume>19</volume>(<issue>10</issue>):<fpage>661</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.2514/1.i010985</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gambi</surname> <given-names>JM</given-names></string-name>, <string-name><surname>Phipps</surname> <given-names>C</given-names></string-name>, <string-name><surname>Garcia del Pino</surname> <given-names>ML</given-names></string-name>, <string-name><surname>Mosser</surname> <given-names>J</given-names></string-name>, <string-name><surname>Weinm&#x00FC;ller</surname> <given-names>EB</given-names></string-name>, <string-name><surname>Alderete</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Deflection of dangerous middle-size LEO debris with autonomous space-based laser brooms via surgical actions</article-title>. <source>Acta Astronaut</source>. <year>2024</year>;<volume>217</volume>(<issue>4</issue>):<fpage>75</fpage>&#x2013;<lpage>88</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.actaastro.2024.01.021</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>&#x017D;ilkov&#x00E1;</surname> <given-names>D</given-names></string-name>, <string-name><surname>&#x0160;ilha</surname> <given-names>J</given-names></string-name>, <string-name><surname>Vojtek</surname> <given-names>P</given-names></string-name>, <string-name><surname>Rodriguez-Villamizar</surname> <given-names>J</given-names></string-name>, <string-name><surname>de Leon</surname> <given-names>J</given-names></string-name>, <string-name><surname>Matlovi&#x010D;</surname> <given-names>P</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Connecting laboratory and spectroscopic observations of aerospace materials to characterize the reflectivity of artificial space objects and debris in LEO regimes</article-title>. <source>Acta Astronaut</source>. <year>2025</year>;<volume>236</volume>(<issue>9</issue>):<fpage>479</fpage>&#x2013;<lpage>86</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.actaastro.2025.07.003</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Huang</surname> <given-names>JG</given-names></string-name>, <string-name><surname>Han</surname> <given-names>JW</given-names></string-name>, <string-name><surname>Li</surname> <given-names>HW</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>MH</given-names></string-name>, <string-name><surname>Li</surname> <given-names>XY</given-names></string-name></person-group>. <article-title>Investigation on the surface damage to solar cells by impacts of space micro-debris on low earth orbit</article-title>. <source>Acta Phys Sin</source>. <year>2008</year>;<volume>57</volume>(<issue>12</issue>):<fpage>7950</fpage>. doi:<pub-id pub-id-type="doi">10.7498/aps.57.7950</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Jiang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>P</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name></person-group>. <chapter-title>The study of space debris and meteoroid impact effects on spacecraft solar array</chapter-title>. In: <person-group person-group-type="editor"><string-name><surname>Kleiman</surname> <given-names>J</given-names></string-name></person-group>, editor. <source>Protection of materials and structures from the space environment</source>. <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2017</year>. p. <fpage>337</fpage>&#x2013;<lpage>45</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-319-19309-0_34</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Li</surname> <given-names>A</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>F</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Study on the influence of solar array damage on satellite power system</article-title>. In: <conf-name>Proceedings of the 2018 10th International Conference on Modelling, Identification and Control (ICMIC); 2018 Jul 2&#x2013;4; Guiyang, China</conf-name>. doi:<pub-id pub-id-type="doi">10.1109/ICMIC.2018.8529891</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Meng</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Li</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Modeling and analysis of non-linear phenomena of satellite power system in space environment and hazard-risk evaluations</article-title>. <source>Electronics</source>. <year>2022</year>;<volume>11</volume>(<issue>11</issue>):<fpage>1756</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics11111756</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hedayati</surname> <given-names>M</given-names></string-name>, <string-name><surname>Barzegar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Rahimi</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Fault diagnosis and prognosis of satellites and unmanned aerial vehicles: a review</article-title>. <source>Appl Sci</source>. <year>2024</year>;<volume>14</volume>(<issue>20</issue>):<fpage>9487</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app14209487</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Muthusamy</surname> <given-names>V</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>KD</given-names></string-name></person-group>. <article-title>Failure prognosis and remaining useful life prediction of control moment gyroscopes onboard satellites</article-title>. <source>Adv Space Res</source>. <year>2022</year>;<volume>69</volume>(<issue>1</issue>):<fpage>718</fpage>&#x2013;<lpage>26</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.asr.2021.09.016</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Park</surname> <given-names>HJ</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>S</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>J</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>NH</given-names></string-name>, <string-name><surname>Choi</surname> <given-names>JH</given-names></string-name></person-group>. <article-title>System-level prognostics approach for failure prediction of reaction wheel motor in satellites</article-title>. <source>Adv Space Res</source>. <year>2023</year>;<volume>71</volume>(<issue>6</issue>):<fpage>2691</fpage>&#x2013;<lpage>701</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.asr.2022.11.028</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>An</surname> <given-names>D</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>NH</given-names></string-name>, <string-name><surname>Choi</surname> <given-names>JH</given-names></string-name></person-group>. <article-title>Practical options for selecting data-driven or physics-based prognostics algorithms with reviews</article-title>. <source>Reliab Eng Syst Saf</source>. <year>2015</year>;<volume>133</volume>(<issue>7</issue>):<fpage>223</fpage>&#x2013;<lpage>36</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ress.2014.09.014</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>B</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>W</given-names></string-name></person-group>. <article-title>Remaining useful life prediction of aircraft engine based on degradation pattern learning</article-title>. <source>Reliab Eng Syst Saf</source>. <year>2017</year>;<volume>164</volume>(<issue>2</issue>):<fpage>74</fpage>&#x2013;<lpage>83</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ress.2017.02.007</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bienefeld</surname> <given-names>C</given-names></string-name>, <string-name><surname>Kirchner</surname> <given-names>E</given-names></string-name>, <string-name><surname>Vogt</surname> <given-names>A</given-names></string-name>, <string-name><surname>Kacmar</surname> <given-names>M</given-names></string-name></person-group>. <article-title>On the importance of temporal information for remaining useful life prediction of rolling bearings using a random forest regressor</article-title>. <source>Lubricants</source>. <year>2022</year>;<volume>10</volume>(<issue>4</issue>):<fpage>67</fpage>. doi:<pub-id pub-id-type="doi">10.3390/lubricants10040067</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>RS</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>AR</given-names></string-name>, <string-name><surname>Narayana</surname> <given-names>PL</given-names></string-name>, <string-name><surname>Chandrika</surname> <given-names>VS</given-names></string-name>, <string-name><surname>Bajaj</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zaitsev</surname> <given-names>I</given-names></string-name></person-group>. <article-title>Hybrid machine learning framework for predictive maintenance and anomaly detection in lithium-ion batteries using enhanced random forest</article-title>. <source>Sci Rep</source>. <year>2025</year>;<volume>15</volume>(<issue>1</issue>):<fpage>6243</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41598-025-90810-w</pub-id>; <pub-id pub-id-type="pmid">39979634</pub-id></mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zou</surname> <given-names>C</given-names></string-name>, <string-name><surname>Berecibar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Nanini-Maury</surname> <given-names>E</given-names></string-name>, <string-name><surname>Chan</surname> <given-names>JCW</given-names></string-name>, <string-name><surname>van den Bossche</surname> <given-names>P</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Random forest regression for online capacity estimation of lithium-ion batteries</article-title>. <source>Appl Energy</source>. <year>2018</year>;<volume>232</volume>:<fpage>197</fpage>&#x2013;<lpage>210</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.apenergy.2018.09.182</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cheng</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zerhouni</surname> <given-names>N</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>C</given-names></string-name></person-group>. <article-title>A hybrid remaining useful life prognostic method for proton exchange membrane fuel cell</article-title>. <source>Int J Hydrogen Energy</source>. <year>2018</year>;<volume>43</volume>(<issue>27</issue>):<fpage>12314</fpage>&#x2013;<lpage>27</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ijhydene.2018.04.160</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Nagulapati</surname> <given-names>VM</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>H</given-names></string-name>, <string-name><surname>Jung</surname> <given-names>D</given-names></string-name>, <string-name><surname>Paramanantham</surname> <given-names>S</given-names></string-name>, <string-name><surname>Brigljevic</surname> <given-names>S</given-names></string-name>, <string-name><surname>Choi</surname> <given-names>B</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A novel combined multi-battery dataset based approach for enhanced prediction accuracy of data driven prognostic models in capacity estimation of lithium ion batteries</article-title>. <source>Energy AI</source>. <year>2021</year>;<volume>5</volume>(<issue>11&#x2013;12</issue>):<fpage>100089</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.egyai.2021.100089</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yan</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>B</given-names></string-name>, <string-name><surname>Chang</surname> <given-names>M</given-names></string-name>, <string-name><surname>Muhammad</surname> <given-names>I</given-names></string-name></person-group>. <article-title>Bearing remaining useful life prediction using support vector machine and hybrid degradation tracking model</article-title>. <source>ISA Trans</source>. <year>2020</year>;<volume>98</volume>:<fpage>471</fpage>&#x2013;<lpage>82</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.isatra.2019.08.058</pub-id>; <pub-id pub-id-type="pmid">31492470</pub-id></mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khelif</surname> <given-names>R</given-names></string-name>, <string-name><surname>Chebel-Morello</surname> <given-names>B</given-names></string-name>, <string-name><surname>Malinowski</surname> <given-names>S</given-names></string-name>, <string-name><surname>Laajili</surname> <given-names>E</given-names></string-name>, <string-name><surname>Fnaiech</surname> <given-names>F</given-names></string-name>, <string-name><surname>Zerhouni</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Direct remaining useful life estimation based on support vector regression</article-title>. <source>IEEE Trans Ind Electron</source>. <year>2017</year>;<volume>64</volume>(<issue>3</issue>):<fpage>2276</fpage>&#x2013;<lpage>85</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIE.2016.2623260</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Souto</surname> <given-names>M</given-names></string-name>, <string-name><surname>das Chagas Moura</surname> <given-names>M</given-names></string-name>, <string-name><surname>Lins</surname> <given-names>I</given-names></string-name></person-group>. <article-title>Particle swarm-optimized support vector machines and pre-processing techniques for remaining useful life estimation of bearings</article-title>. <source>Eksploat I Niezawodn</source>. <year>2019</year>;<volume>21</volume>(<issue>4</issue>):<fpage>610</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.17531/ein.2019.4.10</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Song</surname> <given-names>L</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>T</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Advancements in bearing remaining useful life prediction methods: a comprehensive review</article-title>. <source>Meas Sci Technol</source>. <year>2024</year>;<volume>35</volume>(<issue>9</issue>):<fpage>092003</fpage>. doi:<pub-id pub-id-type="doi">10.1088/1361-6501/ad5223</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Mao</surname> <given-names>R</given-names></string-name>, <string-name><surname>Han</surname> <given-names>P</given-names></string-name>, <string-name><surname>Yuan</surname> <given-names>N</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>Y</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A comprehensive review of lithium-ion battery remaining useful life prediction: methodologies, datasets, performance metrics, and future perspectives</article-title>. <source>Meas Sci Technol</source>. <year>2025</year>;<volume>36</volume>(<issue>8</issue>):<fpage>082001</fpage>. doi:<pub-id pub-id-type="doi">10.1088/1361-6501/adfb97</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>B</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yan</surname> <given-names>T</given-names></string-name>, <string-name><surname>Li</surname> <given-names>N</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Recurrent convolutional neural network: a new framework for remaining useful life prediction of machinery</article-title>. <source>Neurocomputing</source>. <year>2020</year>;<volume>379</volume>:<fpage>117</fpage>&#x2013;<lpage>29</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.neucom.2019.10.064</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname> <given-names>L</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>N</given-names></string-name>, <string-name><surname>Yan</surname> <given-names>T</given-names></string-name>, <string-name><surname>Li</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Machinery health indicator construction based on convolutional neural networks considering trend burr</article-title>. <source>Neurocomputing</source>. <year>2018</year>;<volume>292</volume>(<issue>4</issue>):<fpage>142</fpage>&#x2013;<lpage>50</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.neucom.2018.02.083</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Che</surname> <given-names>C</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Fu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Ni</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Combining multiple deep learning algorithms for prognostic and health management of aircraft</article-title>. <source>Aerosp Sci Technol</source>. <year>2019</year>;<volume>94</volume>:<fpage>105423</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ast.2019.105423</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Ding</surname> <given-names>K</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>B</given-names></string-name></person-group>. <article-title>Approach for fault prognosis using recurrent neural network</article-title>. <source>J Intell Manuf</source>. <year>2020</year>;<volume>31</volume>(<issue>7</issue>):<fpage>1621</fpage>&#x2013;<lpage>33</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10845-018-1428-5</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Sirajul Islam</surname> <given-names>M</given-names></string-name>, <string-name><surname>Rahimi</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Fault prognosis of satellite reaction wheels using a two-step LSTM network</article-title>. In: <conf-name>Proceedings of the 2021 IEEE International Conference on Prognostics and Health Management (ICPHM); 2021 Jun 7&#x2013;9; Detroit (Romulus), MI, USA</conf-name>. doi:<pub-id pub-id-type="doi">10.1109/icphm51084.2021.9486655</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Isbilen</surname> <given-names>F</given-names></string-name>, <string-name><surname>Bektas</surname> <given-names>O</given-names></string-name>, <string-name><surname>Konar</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Deep learning and similarity-based models for predicting turbofan engine remaining useful life: insights from the CMAPSS dataset</article-title>. <source>Aeronaut J</source>. <year>2025</year>;<volume>129</volume>(<issue>1337</issue>):<fpage>2004</fpage>&#x2013;<lpage>35</lpage>. doi:<pub-id pub-id-type="doi">10.1017/aer.2025.25</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>van den Oord</surname> <given-names>A</given-names></string-name>, <string-name><surname>Dieleman</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Simonyan</surname> <given-names>K</given-names></string-name>, <string-name><surname>Vinyals</surname> <given-names>O</given-names></string-name>, <string-name><surname>Graves</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>WaveNet: a generative model for raw audio</article-title>. <comment>arXiv:1609.03499. 2016</comment>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>YB</given-names></string-name>, <string-name><surname>Ge</surname> <given-names>MF</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>L</given-names></string-name></person-group>. <article-title>A novel Bayesian-optimization-based adversarial TCN for RUL prediction of bearings</article-title>. <source>IEEE Sens J</source>. <year>2022</year>;<volume>22</volume>(<issue>21</issue>):<fpage>20968</fpage>&#x2013;<lpage>77</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JSEN.2022.3209894</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Deng</surname> <given-names>F</given-names></string-name>, <string-name><surname>Bi</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Remaining useful life prediction of machinery: a new multiscale temporal convolutional network framework</article-title>. <source>IEEE Trans Instrum Meas</source>. <year>2022</year>;<volume>71</volume>:<fpage>2516913</fpage>. doi:<pub-id pub-id-type="doi">10.1109/TIM.2022.3200093</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hsu</surname> <given-names>CY</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>YW</given-names></string-name>, <string-name><surname>Yan</surname> <given-names>JH</given-names></string-name></person-group>. <article-title>Temporal convolution-based long-short term memory network with attention mechanism for remaining useful life prediction</article-title>. <source>IEEE Trans Semicond Manuf</source>. <year>2022</year>;<volume>35</volume>(<issue>2</issue>):<fpage>220</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TSM.2022.3164578</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Dai</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lai</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>M</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Fu</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A noval RUL prediction method for rolling bearing: TcLstmNet-CBAM</article-title>. <source>Sci Rep</source>. <year>2025</year>;<volume>15</volume>(<issue>1</issue>):<fpage>14055</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41598-025-98845-9</pub-id>; <pub-id pub-id-type="pmid">40269223</pub-id></mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zou</surname> <given-names>J</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Multichannel attention-based TCN-GRU network for remaining useful life prediction of aero-engines</article-title>. <source>Energies</source>. <year>2025</year>;<volume>18</volume>(<issue>8</issue>):<fpage>1899</fpage>. doi:<pub-id pub-id-type="doi">10.3390/en18081899</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dint&#x00E9;n</surname> <given-names>R</given-names></string-name>, <string-name><surname>Zorrilla</surname> <given-names>M</given-names></string-name>, <string-name><surname>Veloso</surname> <given-names>B</given-names></string-name>, <string-name><surname>Gama</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Building of transformer-based RUL predictors supported by explainability techniques: application on real industrial datasets</article-title>. <source>Inf Fusion</source>. <year>2026</year>;<volume>127</volume>(<issue>2</issue>):<fpage>103892</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.inffus.2025.103892</pub-id>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Han</surname> <given-names>F</given-names></string-name>, <string-name><surname>Mo</surname> <given-names>B</given-names></string-name></person-group>. <article-title>RUL prediction method based on sequential health index evaluation with multidimensional coupled degradation data</article-title>. <source>PLoS One</source>. <year>2026</year>;<volume>21</volume>(<issue>1</issue>):<fpage>e0340645</fpage>. doi:<pub-id pub-id-type="doi">10.1371/journal.pone.0340645</pub-id>; <pub-id pub-id-type="pmid">41528990</pub-id></mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xie</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Multigranularity batch sequential design method for component-level satellite design optimization</article-title>. <source>IEEE Trans Aerosp Electron Syst</source>. <year>2024</year>;<volume>60</volume>(<issue>6</issue>):<fpage>8779</fpage>&#x2013;<lpage>90</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TAES.2024.3433325</pub-id>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Toyota</surname> <given-names>H</given-names></string-name>, <string-name><surname>Nakamura</surname> <given-names>T</given-names></string-name>, <string-name><surname>Kanaya</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sumita</surname> <given-names>T</given-names></string-name>, <string-name><surname>Hirai</surname> <given-names>T</given-names></string-name>, <string-name><surname>Kobayashi</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Evaluation of hypervelocity impact of micrometeoroids and orbital debris on next-generation space solar cells</article-title>. <source>Jpn J Appl Phys</source>. <year>2023</year>;<volume>62</volume>:<fpage>SK1047</fpage>. doi:<pub-id pub-id-type="doi">10.35848/1347-4065/acd18b</pub-id>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yuan</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Li</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Collision risk assessment for constellation satellites based on a space debris environment topological network model</article-title>. <source>Chin J Aeronaut</source>. <year>2026</year>;<volume>39</volume>(<issue>2</issue>):<fpage>103762</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cja.2025.103762</pub-id>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zheng</surname> <given-names>JD</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>J</given-names></string-name>, <string-name><surname>Pi</surname> <given-names>XL</given-names></string-name>, <string-name><surname>Zou</surname> <given-names>C</given-names></string-name>, <string-name><surname>Li</surname> <given-names>YF</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>KB</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Hypervelocity impact on volt-ampere characteristic of solar arrays by using two-stage light gas gun</article-title>. <source>Acta Phys Sin</source>. <year>2021</year>;<volume>70</volume>(<issue>18</issue>):<fpage>188801</fpage>. doi:<pub-id pub-id-type="doi">10.7498/aps.70.20210458</pub-id>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>N</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Ding</surname> <given-names>SX</given-names></string-name></person-group>. <article-title>An improved exponential model for predicting remaining useful life of rolling element bearings</article-title>. <source>IEEE Trans Ind Electron</source>. <year>2015</year>;<volume>62</volume>(<issue>12</issue>):<fpage>7762</fpage>&#x2013;<lpage>73</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIE.2015.2455055</pub-id>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Nemani</surname> <given-names>VP</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Thelen</surname> <given-names>A</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zimmerman</surname> <given-names>AT</given-names></string-name></person-group>. <article-title>Ensembles of probabilistic LSTM predictors and correctors for bearing prognostics using industrial standards</article-title>. <source>Neurocomputing</source>. <year>2022</year>;<volume>491</volume>(<issue>5</issue>):<fpage>575</fpage>&#x2013;<lpage>96</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.neucom.2021.12.035</pub-id>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yan</surname> <given-names>T</given-names></string-name>, <string-name><surname>Li</surname> <given-names>N</given-names></string-name>, <string-name><surname>Nandi</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Residual convolution long short-term memory network for machines remaining useful life prediction and uncertainty quantification</article-title>. <source>J Dyn Monit Diagn</source>. <year>2022</year>;<volume>1</volume>(<issue>1</issue>):<fpage>2</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.37965/jdmd.v2i2.43</pub-id>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Parkash</surname> <given-names>C</given-names></string-name>, <string-name><surname>Kundu</surname> <given-names>P</given-names></string-name>, <string-name><surname>Tang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Xiang</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Enhanced deep learning framework for accurate near-failure RUL prediction of bearings in varying operating conditions</article-title>. <source>Adv Eng Inform</source>. <year>2025</year>;<volume>65</volume>:<fpage>103231</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.aei.2025.103231</pub-id>.</mixed-citation></ref>
<ref id="ref-46"><label>[46]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abdar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Pourpanah</surname> <given-names>F</given-names></string-name>, <string-name><surname>Hussain</surname> <given-names>S</given-names></string-name>, <string-name><surname>Rezazadegan</surname> <given-names>D</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Ghavamzadeh</surname> <given-names>M</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A review of uncertainty quantification in deep learning: techniques, applications and challenges</article-title>. <source>Inf Fusion</source>. <year>2021</year>;<volume>76</volume>(<issue>1</issue>):<fpage>243</fpage>&#x2013;<lpage>97</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.inffus.2021.05.008</pub-id>.</mixed-citation></ref>
<ref id="ref-47"><label>[47]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Kendall</surname> <given-names>A</given-names></string-name>, <string-name><surname>Gal</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>What uncertainties do we need in Bayesian deep learning for computer vision?</article-title> <comment>arXiv:1703.04977. 2017</comment>.</mixed-citation></ref>
<ref id="ref-48"><label>[48]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>G</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>CG</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Rong</surname> <given-names>M</given-names></string-name></person-group>. <article-title>A Bayesian deep learning RUL framework integrating epistemic and aleatoric uncertainties</article-title>. <source>IEEE Trans Ind Electron</source>. <year>2021</year>;<volume>68</volume>(<issue>9</issue>):<fpage>8829</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIE.2020.3009593</pub-id>.</mixed-citation></ref>
<ref id="ref-49"><label>[49]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhen</surname> <given-names>A</given-names></string-name></person-group>. <article-title>An interpretable online prediction method for remaining useful life of lithium-ion batteries</article-title>. <source>Sci Rep</source>. <year>2024</year>;<volume>14</volume>(<issue>1</issue>):<fpage>12541</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41598-024-63160-2</pub-id>; <pub-id pub-id-type="pmid">38821997</pub-id></mixed-citation></ref>
<ref id="ref-50"><label>[50]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Lei</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Research on concept of digital satellite</article-title>. <source>Aerosp Shanghai</source>. <year>2021</year>;<volume>38</volume>:<fpage>1</fpage>&#x2013;<lpage>12</lpage>. doi:<pub-id pub-id-type="doi">10.19328/j.cnki.1006-1630.2021.01.001</pub-id>.</mixed-citation></ref>
<ref id="ref-51"><label>[51]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Ren</surname> <given-names>M</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Code generation technology of digital satellite</article-title>. In: <conf-name>Proceedings of ELM-2015 Volume 1</conf-name>. <publisher-loc>Berlin/Heidelberg, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2016</year>. p. <fpage>511</fpage>&#x2013;<lpage>9</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-319-28397-5_40</pub-id>.</mixed-citation></ref>
<ref id="ref-52"><label>[52]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mebarki</surname> <given-names>N</given-names></string-name>, <string-name><surname>Mouss</surname> <given-names>LH</given-names></string-name>, <string-name><surname>Bentrcia</surname> <given-names>T</given-names></string-name>, <string-name><surname>Benmoussa</surname> <given-names>S</given-names></string-name></person-group>. <article-title>An integrated physical model and extant data based approach for fault diagnosis and failure prognosis: application to a photovoltaic module</article-title>. <source>Microelectron Reliab</source>. <year>2025</year>;<volume>168</volume>(<issue>5</issue>):<fpage>115711</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.microrel.2025.115711</pub-id>.</mixed-citation></ref>
<ref id="ref-53"><label>[53]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sgorlon Gaiatto</surname> <given-names>C</given-names></string-name>, <string-name><surname>Antonello</surname> <given-names>F</given-names></string-name>, <string-name><surname>Segneri</surname> <given-names>D</given-names></string-name>, <string-name><surname>Sousa</surname> <given-names>B</given-names></string-name>, <string-name><surname>Abascal Palacios</surname> <given-names>B</given-names></string-name>, <string-name><surname>Schiavo</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A novel physics-based computational framework to model spacecraft solar array power under degradation: application to European space agency (ESA) cluster mission</article-title>. <source>Acta Astronaut</source>. <year>2025</year>;<volume>226</volume>(<issue>1</issue>):<fpage>341</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.actaastro.2024.10.052</pub-id>.</mixed-citation></ref>
<ref id="ref-54"><label>[54]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xie</surname> <given-names>S</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>Z</given-names></string-name></person-group>. <article-title>Genetic programming method for satellite optimization design with quantification of multi-granularity model uncertainty</article-title>. <source>Aerosp Sci Technol</source>. <year>2025</year>;<volume>156</volume>(<issue>3</issue>):<fpage>109764</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ast.2024.109764</pub-id>.</mixed-citation></ref>
<ref id="ref-55"><label>[55]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lei</surname> <given-names>M</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Multi-granularity modeling method for effectiveness evaluation of remote sensing satellites</article-title>. <source>Remote Sens</source>. <year>2023</year>;<volume>15</volume>(<issue>17</issue>):<fpage>4335</fpage>. doi:<pub-id pub-id-type="doi">10.3390/rs15174335</pub-id>.</mixed-citation></ref>
<ref id="ref-56"><label>[56]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhu</surname> <given-names>B</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>E</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>C</given-names></string-name>, <string-name><surname>Yue</surname> <given-names>S</given-names></string-name></person-group>. <article-title>An integrated attention-BiLSTM approach for probabilistic remaining useful life prediction</article-title>. <source>Comput Mater Contin</source>. <year>2026</year>;<volume>87</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>10</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2025.074009</pub-id>.</mixed-citation></ref>
<ref id="ref-57"><label>[57]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhou</surname> <given-names>H</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Xiong</surname> <given-names>H</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Informer: beyond efficient transformer for long sequence time-series forecasting</article-title>. <source>Proc AAAI Conf Artif Intell</source>. <year>2021</year>;<volume>35</volume>(<issue>12</issue>):<fpage>11106</fpage>&#x2013;<lpage>15</lpage>. doi:<pub-id pub-id-type="doi">10.1609/aaai.v35i12.17325</pub-id>.</mixed-citation></ref>
<ref id="ref-58"><label>[58]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Nie</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Nguyen</surname> <given-names>NH</given-names></string-name>, <string-name><surname>Sinthong</surname> <given-names>P</given-names></string-name>, <string-name><surname>Kalagnanam</surname> <given-names>JA</given-names></string-name></person-group>. <article-title>Time series is worth 64 words: long-term forecasting with transformers</article-title>. <comment>arXiv:2211.14730. 2023</comment>.</mixed-citation></ref>
</ref-list>
</back></article>










