<?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">SDHM</journal-id>
<journal-id journal-id-type="nlm-ta">SDHM</journal-id>
<journal-id journal-id-type="publisher-id">SDHM</journal-id>
<journal-title-group>
<journal-title>Structural Durability &#x0026; Health Monitoring</journal-title>
</journal-title-group>
<issn pub-type="epub">1930-2991</issn>
<issn pub-type="ppub">1930-2983</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">44023</article-id>
<article-id pub-id-type="doi">10.32604/sdhm.2023.044023</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A Novel Method for Aging Prediction of Railway Catenary Based on Improved Kalman Filter</article-title><alt-title alt-title-type="left-running-head">A Novel Method for Aging Prediction of Railway Catenary Based on Improved Kalman Filter</alt-title><alt-title alt-title-type="right-running-head">A Novel Method for Aging Prediction of Railway Catenary Based on Improved Kalman Filter</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Li</surname><given-names>Jie</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
<xref ref-type="aff" rid="aff-3">3</xref><email>m18738335672@163.com</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Wang</surname><given-names>Rongwen</given-names></name>
<xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Hu</surname><given-names>Yongtao</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
<xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Li</surname><given-names>Jinjun</given-names></name>
<xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>School of Electrical Engineering and Automation, Henan Institute of Technology</institution>, <addr-line>Xinxiang, 453003</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Technology Center, Sichuan Injet Electric Co., Ltd.</institution>, <addr-line>Deyang, 618000</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Embedded System Research Institute, Xinxiang Engineering Research Center for Intelligent Condition Monitoring of Machinery</institution>, <addr-line>Xinxiang, 453003</addr-line>, <country>China</country></aff>
</contrib-group><author-notes><corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Jie Li. Email: <email>m18738335672@163.com</email></corresp></author-notes>
<pub-date date-type="collection" publication-format="electronic"><year>2024</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>11</day><month>1</month><year>2024</year></pub-date>
<volume>18</volume>
<issue>1</issue>
<fpage>73</fpage>
<lpage>90</lpage>
<history>
<date date-type="received"><day>18</day><month>7</month><year>2023</year></date>
<date date-type="accepted"><day>27</day><month>10</month><year>2023</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 Li et al.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Li et al.</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_SDHM_44023.pdf"></self-uri>
<abstract>
<p>The aging prediction of railway catenary is of profound significance for ensuring the regular operation of electrified trains. However, in real-world scenarios, accurate predictions are challenging due to various interferences. This paper addresses this challenge by proposing a novel method for predicting the aging of railway catenary based on an improved Kalman filter (KF). The proposed method focuses on modifying the priori state estimate covariance and measurement error covariance of the KF to enhance accuracy in complex environments. By comparing the optimal displacement value with the theoretically calculated value based on the thermal expansion effect of metals, it becomes possible to ascertain the aging status of the catenary. To improve prediction accuracy, a railway catenary aging prediction model is constructed by integrating the Takagi-Sugeno (T-S) fuzzy neural network (FNN) and KF. In this model, an adaptive training method is introduced, allowing the FNN to use fewer fuzzy rules. The inputs of the model include time, temperature, and historical displacement, while the output is the predicted displacement. Furthermore, the KF is enhanced by modifying its prior state estimate covariance and measurement error covariance. These modifications contribute to more accurate predictions. Lastly, a low-power experimental platform based on FPGA is implemented to verify the effectiveness of the proposed method. The test results demonstrate that the proposed method outperforms the compared method, showcasing its superior performance.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Railway catenary</kwd>
<kwd>Takagi-Sugeno fuzzy neural network</kwd>
<kwd>Kalman filter</kwd>
<kwd>aging prediction</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Science and Technology Research Project of Henan Province</funding-source>
<award-id>222102210087</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Science and Technology Research Project of Henan Province</funding-source>
<award-id>222102220102</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The aging prediction of the railway catenary is a field of great research value, which plays a significant role in promoting the railway transportation industry [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-3">3</xref>]. Many researchers use a combination of image processing and artificial intelligence to determine the degree of aging of the catenary. Chen et al. [<xref ref-type="bibr" rid="ref-4">4</xref>] proposed a convolutional neural network for the detection of contact line support devices and components, using high-resolution images from cameras to continuously detect structures in various complex contact lines. Chen et al. [<xref ref-type="bibr" rid="ref-5">5</xref>] used deep neural networks to improve learning efficiency and recognition accuracy in stages. In the first stage, a neural network is established to identify the areas of the pantograph and contact network in complex scenes. In the second stage, image feature extraction algorithms are used to detect the contact points between the pantograph and the contact network. Wu et al. [<xref ref-type="bibr" rid="ref-6">6</xref>] proposed an improved convolutional neural network and a rotating retina network, which uses neural networks combined with machine vision to detect the support structure of the railway catenary. Image processing and artificial intelligence can achieve high prediction accuracy but are easily affected by environmental interference and limited training data [<xref ref-type="bibr" rid="ref-7">7</xref>]. Moreover, the engineering applicability of such equipment is not convenient, and the development cost and equipment price are not competitive.</p>
<p>The KF is an algorithm that uses a linear system state to perform optimal estimation of the system state [<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-9">9</xref>]. To improve the performance of the KF, many researchers have begun to fuse neural networks with it. For example, the extended KF proposed in [<xref ref-type="bibr" rid="ref-10">10</xref>] uses a linearization method for nonlinear systems to solve the problem of inaccurate prediction of nonlinear systems. To address the problem of information loss in linearizing nonlinear systems, Liu et al. [<xref ref-type="bibr" rid="ref-11">11</xref>] used the unscented KF to handle nonlinearity. To deal with high-order nonlinear systems, Long et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] used multilayer neural networks to map nonlinearity. The multilayer perceptron uses historical data to learn the dynamic representation of the observation model, replacing the rough approximation of the system state and measurement state in the KF. Revach et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] proposed a neural network-aided KF, which replaces the gain with a recurrent neural network. Based on the advantages of neural networks in processing nonlinear systems, Kim et al. [<xref ref-type="bibr" rid="ref-14">14</xref>&#x2013;<xref ref-type="bibr" rid="ref-16">16</xref>] used deep neural networks to improve the KF, resulting in better estimation performance in specific application areas.</p>
<p>The FNN combines the characteristics of fuzzy control and neural networks and has many applications in the field of nonlinear state prediction. For example, in reference [<xref ref-type="bibr" rid="ref-17">17</xref>], a particle swarm optimization algorithm was used to optimize FNN, and this model was successfully applied to dynamic environmental prediction. Yang et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] proposed a method for identifying parameters of fuzzy models using recursive least squares with forgetting factors. Improved control accuracy for highly nonlinear systems. Zang et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] used FNN to predict the mixed remaining service life of railway catenary, which improves the accuracy of prediction compared to traditional methods. Narges et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] proposed a method for optimizing Fault Detection based Decision Tree strategy (FDDT) using neural networks and fuzzy algorithms. The neural network algorithm detects and distinguishes a type of load, and the fuzzy model serves as a modifier to determine the final output fault type. Jan et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] proposed a fault detection and diagnosis system using a Fuzzy Deep Neural Network algorithm.</p>
<p>The KF and the FNN have many applications in health monitoring, life prediction, nonlinear state estimation, etc. Combining the KF with the FNN can greatly improve the performance of the algorithm in certain scenarios. The aging prediction of railway catenary can be transformed into a nonlinear state estimation problem. Therefore, this paper proposes a novel improved KF algorithm that uses a T-S FNN to replace the prior state estimate of the KF. The constructed T-S FNN uses an adaptive training method to increase the efficiency of prediction. In addition, the data collected by the vibration sensor is converted into measurement error covariance for the KF. The main contributions of this paper are as follows:</p>
<p>&#x2022; Proposed a novel fusion approach. It integrates T-S FNN and KF to improve the accuracy of the aging railway catenary prediction.</p>
<p>&#x2022; An adaptive training method is proposed, which enables the FNN to use fewer fuzzy rules while maintaining the accuracy of fitting and prediction, thus reducing the computational complexity.</p>
<p>&#x2022; The vibration interference data is introduced into the KF to correct the measurement error covariance on the estimation of optimal values.</p>
<p>&#x2022; An experimental platform is built to compare with some of the latest improved KF algorithms, proving the superiority of the proposed algorithm.</p>
<p>The rest of this paper is as follows. <xref ref-type="sec" rid="s2">Section 2</xref> explains the principle of aging prediction for the railway catenary. <xref ref-type="sec" rid="s3">Section 3</xref> illustrates the structure of the proposed method. The overall program structure is described in <xref ref-type="sec" rid="s4">Section 4</xref>. <xref ref-type="sec" rid="s5">Section 5</xref> shows the comparative experiments. The conclusions are summarized in <xref ref-type="sec" rid="s6">Section 6</xref>.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Problem Statement</title>
<sec id="s2_1">
<label>2.1</label>
<title>Theoretical Displacement</title>
<p>The railway catenary model discussed in this paper is shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. Where <inline-formula id="ieqn-1">
<mml:math id="mml-ieqn-1"><mml:msub><mml:mi>L</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:math>
</inline-formula> is the distance between the weights and the catenary, and <inline-formula id="ieqn-2">
<mml:math id="mml-ieqn-2"><mml:msub><mml:mi>L</mml:mi><mml:mi>b</mml:mi></mml:msub></mml:math>
</inline-formula> is the distance between the bottom of the weights and the ground. The changes in <inline-formula id="ieqn-3">
<mml:math id="mml-ieqn-3"><mml:msub><mml:mi>L</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:math>
</inline-formula> and <inline-formula id="ieqn-4">
<mml:math id="mml-ieqn-4"><mml:msub><mml:mi>L</mml:mi><mml:mi>b</mml:mi></mml:msub></mml:math>
</inline-formula> can both serve as displacement changes in the railway catenary. However, considering that in practice, the weights will cause slight vibration of the arc with the pulley as the origin, which has a significant impact on the <inline-formula id="ieqn-5">
<mml:math id="mml-ieqn-5"><mml:msub><mml:mi>L</mml:mi><mml:mi>b</mml:mi></mml:msub></mml:math>
</inline-formula>. Therefore, the displacement value of the catenary is defined as the <inline-formula id="ieqn-6">
<mml:math id="mml-ieqn-6"><mml:msub><mml:mi>L</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:math>
</inline-formula>.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Railway catenary structure model</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-1.tif"/>
</fig>
<p>Metal cables have a specific coefficient of thermal expansion, which means that changes in ambient temperature can lead to variations in the catenary length [<xref ref-type="bibr" rid="ref-22">22</xref>]. The coefficient of thermal expansion of metals [<xref ref-type="bibr" rid="ref-23">23</xref>], <inline-formula id="ieqn-7">
<mml:math id="mml-ieqn-7"><mml:msub><mml:mi>L</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:math>
</inline-formula> can be calculated as follows:<disp-formula id="eqn-1"><label>(1)</label>
<mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mi>&#x03C6;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mi>c</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula>where <inline-formula id="ieqn-8">
<mml:math id="mml-ieqn-8"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math>
</inline-formula> is the minimum length, <inline-formula id="ieqn-9">
<mml:math id="mml-ieqn-9"><mml:mi>&#x03B3;</mml:mi></mml:math>
</inline-formula> represents the transmission coefficient of the compensating pulley, and <inline-formula id="ieqn-10">
<mml:math id="mml-ieqn-10"><mml:msub><mml:mi>L</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:math>
</inline-formula> represents the distance from the center anchor to the compensator. <inline-formula id="ieqn-11">
<mml:math id="mml-ieqn-11"><mml:mi>&#x03C6;</mml:mi></mml:math>
</inline-formula> indicates the expansion coefficient of the contact network, <inline-formula id="ieqn-12">
<mml:math id="mml-ieqn-12"><mml:msub><mml:mi>T</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:math>
</inline-formula> represents the current temperature, <inline-formula id="ieqn-13">
<mml:math id="mml-ieqn-13"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:math>
</inline-formula> represents the lowest temperature.</p>
<p>When no train passes by, the trend of ambient temperature and catenary displacement over time plotted based on data collected by sensors is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. The temperature curve is the temperature data within 24&#x2005;h, the theory curve is the displacement change trend calculated by <xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>, and the actual curve is the data collected by the displacement sensor. The data sampling period is 10&#x2005;min. From the statistical results, it can be seen that the theory value of the catenary displacement is correlated with temperature. Due to environmental interference, there is a certain dissimilarity between the displacement collected by the sensor and the theory value, but the correlation is still obvious.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The relationship between catenary displacement and temperature</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-2.tif"/>
</fig>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>The Principle of Aging Prediction</title>
<p>After being affected by sudden interference like pantograph passing, the displacement of the catenary will experience significant fluctuations. As shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, the pantograph passing effect occurred between 1000 and 2000&#x2005;s. The catenary experiences significant interference resulting in a substantial deviation from the theoretical expectations. However, once the interference diminishes, they gradually realign with the theoretical predictions.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Pantograph interference effect</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-3.tif"/>
</fig>
<p>As the catenary ages, the physical properties are altered due to cable fractures. In <xref ref-type="fig" rid="fig-4">Fig. 4</xref>, a comparison between the displacement of the aged catenary and that of a normal one is made, with the differences illustrated in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. The results indicate a substantial disparity in the displacement distribution between the aged and normal catenaries, and this difference does not spontaneously revert to the normal state for a certain period. When the detected difference surpasses a predefined threshold and persists for a specific duration, it serves as an indicator to determine whether the catenary is indeed aged [<xref ref-type="bibr" rid="ref-24">24</xref>].</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Comparison of displacement between aged and normal catenary</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-4.tif"/>
</fig><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Displacement difference between aged and normal catenary</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-5.tif"/>
</fig>
<p>The values obtained from displacement sensors are susceptible to numerous influencing factors, including rain, wind, physical disturbances, etc. Without proper filtering of these observations, it can result in erroneous assessments. The aging prediction method employed in this paper relies on catenary displacement, making it crucial to account for significant interfering factors. Other factors like temperature and corrosion can manifest as changes in displacement. However, factors that do not have an abrupt impact on displacement data do not necessitate technical consideration.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Method</title>
<sec id="s3_1">
<label>3.1</label>
<title>Traditional Architecture</title>
<p>The traditional KF architecture can be described as <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. The item <italic>R</italic> represents the measurement error covariance. The prior estimate error covariance is<disp-formula id="eqn-2"><label>(2)</label>
<mml:math id="mml-eqn-2" display="block"><mml:msubsup><mml:mi>P</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow></mml:mrow></mml:msubsup><mml:msup><mml:mi>F</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:mi>Q</mml:mi></mml:math>
</disp-formula>where <italic>F</italic> indicates the state transition matrix, <inline-formula id="ieqn-14">
<mml:math id="mml-ieqn-14"><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow></mml:mrow></mml:msubsup></mml:math>
</inline-formula> represents the posterior estimate error covariance, and <italic>Q</italic> is the process noise. <inline-formula id="ieqn-15">
<mml:math id="mml-ieqn-15"><mml:msub><mml:mi>K</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math>
</inline-formula> represents the KF gain. <italic>z</italic> indicates the actual measurement. The prior state estimate is</p><disp-formula id="eqn-3"><label>(3)</label>
<mml:math id="mml-eqn-3" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mi>F</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>B</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>
</disp-formula>
<p>where <inline-formula id="ieqn-16">
<mml:math id="mml-ieqn-16"><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>
</inline-formula> is the last posterior state estimate, <italic>B</italic> indicates the control matrix and <inline-formula id="ieqn-17">
<mml:math id="mml-ieqn-17"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>
</inline-formula> represents the input state.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Traditional KF architecture</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-6.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>High Level Architecture</title>
<p>As seen in <xref ref-type="disp-formula" rid="eqn-2">Eqs. (2)</xref> and <xref ref-type="disp-formula" rid="eqn-3">(3)</xref>, the optimal state of the KF is based on the output from the previous time, which exhibits hysteresis and is unable to effectively mitigate nonlinear interference. To enhance the anti-interference performance, this paper proposes replacing the prior state estimate equation of the KF with a T-S FNN model. The suggested structure is depicted in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. Furthermore, the corresponding prior estimate error covariance has also been substituted. Additionally, the measurement error <italic>R</italic> has been replaced by <inline-formula id="ieqn-18">
<mml:math id="mml-ieqn-18"><mml:msub><mml:mi>R</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:math>
</inline-formula>, which will be discussed in <xref ref-type="sec" rid="s3_5">Section 3.5</xref>. The design of a T-S FNN to learn how to compute <inline-formula id="ieqn-19">
<mml:math id="mml-ieqn-19"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup></mml:math>
</inline-formula> and <inline-formula id="ieqn-20">
<mml:math id="mml-ieqn-20"><mml:msubsup><mml:mi>P</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup></mml:math>
</inline-formula> as integral components of an overall KF framework involves addressing three pivotal questions:</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Proposed KF architecture</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-7.tif"/>
</fig>
<p>1) What are the inputs and outputs of the network?</p>
<p>2) How to design the structure of the network?</p>
<p>3) What methods are needed for training the network?</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Design of the Network Structure</title>
<p>Compared with the traditional Mamdani fuzzy model, the T-S FNN adopts multiple linear functions for defuzzification. This enables the T-S fuzzy model combined with a back propagation neural network to reduce fuzzy rules and achieve better training results [<xref ref-type="bibr" rid="ref-25">25</xref>]. Based on the on-site collected data characteristics, this paper proposes to design the T-S fuzzy model as a three-input single-output model. As shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, the model consists of the Premise Network and the Latter Network.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Proposed T-S FNN structure</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-8.tif"/>
</fig>
<p>The lower part shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref> is the Premise Network. The first layer is the input, represented by<disp-formula id="eqn-4"><label>(4)</label>
<mml:math id="mml-eqn-4" display="block"><mml:mi>x</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mspace width="1em" /><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mspace width="1em" /><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-21">
<mml:math id="mml-ieqn-21"><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math>
</inline-formula>, <inline-formula id="ieqn-22">
<mml:math id="mml-ieqn-22"><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math>
</inline-formula> and <inline-formula id="ieqn-23">
<mml:math id="mml-ieqn-23"><mml:msub><mml:mi>x</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>
</inline-formula> indicate time, temperature, and the history of filtered displacement value, respectively. The input membership function is designed as a bell curve</p>
<p><disp-formula id="eqn-5"><label>(5)</label>
<mml:math id="mml-eqn-5" display="block"><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mstyle displaystyle="false" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mi>n</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mo>&#x2026;</mml:mo><mml:mrow><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext></mml:mrow><mml:mi>m</mml:mi></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-24">
<mml:math id="mml-ieqn-24"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> is the center of the bell curve, <inline-formula id="ieqn-25">
<mml:math id="mml-ieqn-25"><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow></mml:mrow></mml:msubsup></mml:math>
</inline-formula> represents the width of a bell curve, <italic>n</italic> indicate the number of input, <italic>m</italic> is the number of membership function. In the discussion of this paper, <inline-formula id="ieqn-26">
<mml:math id="mml-ieqn-26"><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mn>3</mml:mn></mml:math>
</inline-formula>.</p>
<p>The second layer of the Premise Network is the fuzzy language variable layer. This layer plays a primary role in computing the membership function for each component input from the first layer, which corresponds to its respective fuzzy set. This computation is carried out as follows:</p>
<p><disp-formula id="eqn-6"><label>(6)</label>
<mml:math id="mml-eqn-6" display="block"><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:msubsup><mml:mi>A</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math>
</disp-formula>where <inline-formula id="ieqn-27">
<mml:math id="mml-ieqn-27"><mml:msubsup><mml:mi>A</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math>
</inline-formula> represents the <italic>j</italic>-th language variable of the <italic>x</italic>-th input.</p>
<p>The third layer represents the matching fuzzy rule layer, where each node corresponds to a specific fuzzy rule. The primary function of this layer is to match the fuzzy rules and compute the fitness of each rule. The fitness value is determined through the following calculation:</p>
<p><disp-formula id="eqn-7"><label>(7)</label>
<mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn><mml:mrow><mml:msub><mml:mi>i</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The third layer of the Premise Network also needs normalization. The specific calculation method is as follows:</p>
<p><disp-formula id="eqn-8"><label>(8)</label>
<mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mover><mml:mi>&#x03B1;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>After taking the minimum value and normalization, the coefficient vector <inline-formula id="ieqn-28">
<mml:math id="mml-ieqn-28"><mml:mi>&#x03BD;</mml:mi></mml:math>
</inline-formula> can be obtained</p>
<p><disp-formula id="eqn-9"><label>(9)</label>
<mml:math id="mml-eqn-9" display="block"><mml:mi>&#x03BD;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mspace width="1em" /><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mspace width="1em" /><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-10"><label>(10)</label>
<mml:math id="mml-eqn-10" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mspace width="1em" /><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math>
</disp-formula>where <italic>a</italic> and <italic>b</italic> are the coefficients. Convert the coefficients into a linear function<disp-formula id="eqn-11"><label>(11)</label>
<mml:math id="mml-eqn-11" display="block"><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mover><mml:mi>&#x03B1;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math>
</disp-formula></p>
<p>Finally, take the minimum value to obtain the output</p>
<p><disp-formula id="eqn-12"><label>(12)</label>
<mml:math id="mml-eqn-12" display="block"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mspace width="1em" /><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow><mml:mspace width="1em" /><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>The Later Network is a fusion method based on the Premise Network and fuzzy system. It receives input signals from the Premise Network and outputs the results using fuzzy inference processing based on these signals. The network structure proposed in this paper is shown in the upper half of <xref ref-type="fig" rid="fig-8">Fig. 8</xref>. The Later Network can be trained based on real-time data to improve the performance of fuzzy control. It consists of <italic>n</italic> subnetworks with the same structure, each of which generates an output.</p>
<p>The first layer of the subnetwork is the input layer, the same as the Premise Network. The second layer consists of <italic>m</italic> nodes, each of which can represent a fuzzy rule in a fuzzy model, and its main function is to calculate the consequences of each rule. The calculation method for the output of this layer is as follows:<disp-formula id="eqn-13"><label>(13)</label>
<mml:math id="mml-eqn-13" display="block"><mml:msubsup><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</disp-formula>where <italic>p</italic> indicate the usage weights of various fuzzy rules in the second layer.</p>
<p>The third layer is the output of the Later Network, which is the weighted sum of the Later Network of each rule. The weighted coefficients are the weights of each fuzzy rule, which means that the output of the Premise Network is used for the connection weights of the third layer of the Later Network:<disp-formula id="eqn-14"><label>(14)</label>
<mml:math id="mml-eqn-14" display="block"><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>&#x03B1;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:msubsup><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math>
</disp-formula></p>
<p>In summary, FNN combines the advantages of fuzzy systems and neural networks, enabling the model to not only have self-learning and parallel processing capabilities but also handle fuzzy knowledge and utilize expert experience. In the Premise Network, the use of bell curves as input membership functions reduces training parameters while improving accuracy. Use <xref ref-type="disp-formula" rid="eqn-7">Eqs. (7)</xref> and <xref ref-type="disp-formula" rid="eqn-8">(8)</xref> to calculate the output of the membership function and normalize it. Output the result through <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>, which has higher accuracy compared to constants. Using <xref ref-type="disp-formula" rid="eqn-13">Eqs. (13)</xref> and <xref ref-type="disp-formula" rid="eqn-14">(14)</xref> in the Later Network, parallel computation of the weights corresponding to each fuzzy rule is achieved.</p>
<p>After all, the output of the proposed T-S FNN model is <inline-formula id="ieqn-29">
<mml:math id="mml-ieqn-29"><mml:msub><mml:mi>D</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math>
</inline-formula>. The process noise of the proposed KF is as follows:<disp-formula id="eqn-15"><label>(15)</label>
<mml:math id="mml-eqn-15" display="block"><mml:mi>Q</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>k</mml:mi></mml:munderover><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:mrow></mml:mstyle></mml:msqrt><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math>
</disp-formula>where <italic>k</italic> indicates training data volume, <italic>d</italic> represents the historical displacement of filtered. <xref ref-type="disp-formula" rid="eqn-15">Eq. (15)</xref> elucidates that the process noise of the KF is transformed through the prediction process error of the T-S FNN model. The prior estimate error covariance and priori state estimate are defined as follows:<disp-formula id="eqn-16"><label>(16)</label>
<mml:math id="mml-eqn-16" display="block"><mml:msubsup><mml:mi>P</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>Q</mml:mi></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-17"><label>(17)</label>
<mml:math id="mml-eqn-17" display="block"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math>
</disp-formula></p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Adaptive Training Algorithm Design</title>
<p>Considering that the model of each catenary on-site is not the same, an adaptive algorithm can certainly improve the practicality of the algorithm. There are many learning algorithms for neural networks, such as Unsupervised learning algorithms based on iterative learning [<xref ref-type="bibr" rid="ref-26">26</xref>], Supervised learning algorithms [<xref ref-type="bibr" rid="ref-27">27</xref>], deep learning [<xref ref-type="bibr" rid="ref-28">28</xref>], etc. Supervised learning is suitable for big data-intensive and purposeful training. Deep learning requires a larger number of data for specific functional training. Unsupervised learning can use a small amount of data to quickly train the model. Considering real-time requirements, using an iterative Unsupervised learning algorithm to train the model can have a better effect.</p>
<p>The input membership function of the proposed fuzzy system is set to a bell curve. So the parameters that need to be adaptively updated in the Premise Network can be defined as the center value <inline-formula id="ieqn-30">
<mml:math id="mml-ieqn-30"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math>
</inline-formula> and the width value <inline-formula id="ieqn-31">
<mml:math id="mml-ieqn-31"><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow></mml:mrow></mml:msubsup></mml:math>
</inline-formula> corresponding to each node in the second layer. The Later Network needs to adaptively update the usage weights of various fuzzy rules in the second layer. Therefore, define the error cost function as follows:<disp-formula id="eqn-18"><label>(18)</label>
<mml:math id="mml-eqn-18" display="block"><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mstyle></mml:math>
</disp-formula>where <inline-formula id="ieqn-32">
<mml:math id="mml-ieqn-32"><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow></mml:math>
</inline-formula> represents the expected output of the neural network. First, fix the usage weights of various fuzzy rules <inline-formula id="ieqn-33">
<mml:math id="mml-ieqn-33"><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math>
</inline-formula>, and discuss the Premise Network. Then the output of each fuzzy rule is equal to the weight of the third layer of the Later Network. Let <inline-formula id="ieqn-34">
<mml:math id="mml-ieqn-34"><mml:msubsup><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math>
</inline-formula>, the activation function of the neural network can be defined as follows:<disp-formula id="eqn-19"><label>(19)</label>
<mml:math id="mml-eqn-19" display="block"><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-20"><label>(20)</label>
<mml:math id="mml-eqn-20" display="block"><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>4</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-21"><label>(21)</label>
<mml:math id="mml-eqn-21" display="block"><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mi>j</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>4</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-22"><label>(22)</label>
<mml:math id="mml-eqn-22" display="block"><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>3</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mstyle displaystyle="false" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mrow></mml:msup></mml:math>
</disp-formula>where <inline-formula id="ieqn-35">
<mml:math id="mml-ieqn-35"><mml:msubsup><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math>
</inline-formula> represents adaptive parameters, which is defined as follows:<disp-formula id="eqn-23"><label>(23)</label>
<mml:math id="mml-eqn-23" display="block"><mml:msubsup><mml:mi>s</mml:mi><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:msubsup><mml:mi>&#x03BC;</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">n</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">m</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">m</mml:mi></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">v</mml:mi><mml:mi mathvariant="normal">a</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">f</mml:mi><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">r</mml:mi></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>k</mml:mi><mml:mrow><mml:mo>&#x2010;</mml:mo><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">u</mml:mi><mml:mi mathvariant="normal">l</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mspace width="-140pt" /><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mi mathvariant="normal">o</mml:mi><mml:mi mathvariant="normal">t</mml:mi><mml:mi mathvariant="normal">h</mml:mi><mml:mi mathvariant="normal">e</mml:mi><mml:mi mathvariant="normal">r</mml:mi><mml:mi mathvariant="normal">w</mml:mi><mml:mi mathvariant="normal">i</mml:mi><mml:mi mathvariant="normal">s</mml:mi><mml:mi mathvariant="normal">e</mml:mi></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math>
</disp-formula></p>
<p>Above all, the partial derivative of the error concerning the central and width of the membership function is as follows:<disp-formula id="eqn-24"><label>(24)</label>
<mml:math id="mml-eqn-24" display="block"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-25"><label>(25)</label>
<mml:math id="mml-eqn-25" display="block"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>&#x03B4;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow><mml:mn>3</mml:mn></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:mstyle></mml:math>
</disp-formula></p>
<p>The learning algorithm for adjusting the parameters of the bell curve is as follows:<disp-formula id="eqn-26"><label>(26)</label>
<mml:math id="mml-eqn-26" display="block"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-27"><label>(27)</label>
<mml:math id="mml-eqn-27" display="block"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula></p>
<p>where <inline-formula id="ieqn-36">
<mml:math id="mml-ieqn-36"><mml:mi>&#x03B2;</mml:mi></mml:math>
</inline-formula> is the learning rate. Then the usage weights <inline-formula id="ieqn-37">
<mml:math id="mml-ieqn-37"><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math>
</inline-formula> can be calculated as follows:<disp-formula id="eqn-28"><label>(28)</label>
<mml:math id="mml-eqn-28" display="block"><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2202;</mml:mi><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:mrow></mml:mfrac></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mover><mml:mi>&#x03B1;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mstyle></mml:math>
</disp-formula></p>
<p><disp-formula id="eqn-29"><label>(29)</label>
<mml:math id="mml-eqn-29" display="block"><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mi>p</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x007E;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mover><mml:mi>&#x03B1;</mml:mi><mml:mo accent="false">&#x00AF;</mml:mo></mml:mover><mml:mi>j</mml:mi></mml:msub><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math>
</disp-formula></p>
<p>In summary, when designing adaptive algorithms for the FNN to select different fuzzy rules based on varying states, the inclusion of parameter <inline-formula id="ieqn-38">
<mml:math id="mml-ieqn-38"><mml:msubsup><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:msubsup></mml:math>
</inline-formula> becomes crucial. This parameter plays a pivotal role in the selection of specific fuzzy rules by matching them with the training data.</p>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Measurement Error and KF Output</title>
<p>When the accuracy of the sensor is high, its interior error range is too small compared to the error range of the system measurement error, which cannot truly reflect the system error information. Therefore, the vibration data of the catenary is proposed as the KF measurement error. Then the measurement error covariance is calculated as follows:</p>
<p><disp-formula id="eqn-30"><label>(30)</label>
<mml:math id="mml-eqn-30" display="block"><mml:msub><mml:mi>R</mml:mi><mml:mi>v</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msqrt><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>k</mml:mi></mml:munderover><mml:mrow><mml:msubsup><mml:mi>S</mml:mi><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:mrow><mml:mi>n</mml:mi></mml:mfrac></mml:mrow></mml:mstyle></mml:msqrt></mml:math>
</disp-formula>where <italic>S</italic> is the vibration data. Then the KF gain is as follows:</p>
<p><disp-formula id="eqn-31"><label>(31)</label>
<mml:math id="mml-eqn-31" display="block"><mml:msub><mml:mi>K</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>H</mml:mi><mml:msubsup><mml:mi>P</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mi>v</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mstyle></mml:math>
</disp-formula>where <italic>H</italic> is the observation matrix. Finally, the output state estimate of the KF is</p>
<p><disp-formula id="eqn-32"><label>(32)</label>
<mml:math id="mml-eqn-32" display="block"><mml:msub><mml:mi>x</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo>+</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>z</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>H</mml:mi><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup><mml:mo stretchy="false">)</mml:mo></mml:math>
</disp-formula></p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Overall Algorithm Structure</title>
<p>The process of the aging prediction method for the railway catenary proposed in this paper is shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>. First, use on-site equipment to collect training data, including time, temperature, and filtered displacement data. Secondly, the trained model output used as the prior state estimate <inline-formula id="ieqn-39">
<mml:math id="mml-ieqn-39"><mml:msubsup><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msubsup></mml:math>
</inline-formula> of the KF, and the difference between the output and the actual displacement is used as the process noise <italic>Q</italic>. Then the posteriori estimate error is obtained through iterative calculation. The high-precision displacement sensor on-site serves as the actual measurement <italic>z</italic> of the KF, and the vibration data on-site serves as the KF measurement error <inline-formula id="ieqn-40">
<mml:math id="mml-ieqn-40"><mml:msub><mml:mi>R</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:math>
</inline-formula>. Finally, the improved Kalman filtering algorithm can filter out the vibration interference caused by environmental factors such as pantograph and wind speed on the contact network. Subtract the filtered value from the theoretical value to obtain an error curve, and determine the health status of the contact network by calculating whether the error curve meets the specified threshold.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>The structure of the proposed prediction method</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-9.tif"/>
</fig>
</sec>
<sec id="s5">
<label>5</label>
<title>Experiment Validation</title>
<sec id="s5_1">
<label>5.1</label>
<title>Construction of Experimental Equipment</title>
<p>In the fields of neural networks and artificial intelligence, to validate algorithms and collect data, it is essential to establish a reasonable experimental platform [<xref ref-type="bibr" rid="ref-29">29</xref>&#x2013;<xref ref-type="bibr" rid="ref-32">32</xref>]. To obtain sufficient and accurate data, as well as the authenticity of the experiment, the equipment structure used in this experiment is shown in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>. The control unit adopts a combination of MCU and FPGA, SHT30 is a high-precision temperature and humidity sensor, and 4GCAT1 is an IoT module using the CAT1 frequency band. The product is shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>. MCU is mainly responsible for network communication and peripheral control, and FPGA is mainly responsible for the implementation and acceleration of T-S FNN algorithms.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Topological structure of functional modules in experimental equipment</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-10.tif"/>
</fig><fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Experimental equipment products</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-11.tif"/>
</fig>
<p>To show the effectiveness of the proposed method, under the coordination of the local railway department, experimental equipment was installed in a local operating railway section for experiments. The experimental setting is shown in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>. The device within the red outline is the catenary weights, and the distance between the weights and the top pulley is the displacement of the catenary. Firstly, collect catenary data in a static state to study the vibration characteristics of the catenary. For this purpose, the equipment is installed on the weights at the end of the catenary and uses high-precision thermal resistance as a sensor to obtain temperature data. Then, a rope sensor modified by an encoder is used to measure the displacement of the catenary.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>On-site installation of experimental equipment</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-12.tif"/>
</fig>
<p>Due to provisions, the complete dataset used in this experiment cannot be fully disclosed. However, for reference, some samples have been provided in the supplementary materials. The uploaded dataset sample can be found in Table S1.</p>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Performance of the Proposed Training Method</title>
<p>To illustrate the effectiveness of the proposed training algorithm, we compare the performance of the proposed adaptive algorithm with the traditional backpropagation (BP) algorithm. The experimental dataset consists of 24-h data collected at a railway site. The experimental results are presented in <xref ref-type="table" rid="table-1">Table 1</xref>, and the comparison of iteration times is depicted in <xref ref-type="fig" rid="fig-13">Fig. 13</xref>.</p>
<table-wrap id="table-1"><label>Table 1</label>
<caption>
<title>Comparison results of training methods</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left"/>
<th align="left">BP</th>
<th align="left">Proposed</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Number of fuzzy rules</td>
<td align="left">125</td>
<td align="left">89</td>
</tr>
<tr>
<td align="left">Error</td>
<td align="left">0.6</td>
<td align="left">0.75</td>
</tr>
</tbody>
</table>
</table-wrap><fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>The proposed training algorithm training error over iterations</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-13.tif"/>
</fig>
<p>The results indicate that the suggested algorithm exhibits rapid convergence, with an increase in error of only 0.15&#x2005;mm. Despite the slight growth in error, it has minimal effect on the prediction of aging. The purpose of this effect is to eliminate vague rules that bear minimal influence on the ultimate output result, thus enhancing computational efficiency.</p>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Effectiveness of the Error Correction</title>
<p>To validate the effectiveness of replacing the KF measurement error, we conduct a comparison between using sensor internal noise and vibration information within the same dataset. The parameter of comparison is the disparity between the filtered and theoretical values. As illustrated in <xref ref-type="fig" rid="fig-14">Fig. 14</xref>, the comparison showcases the filtering performance on three days of random data. Further details regarding the experimental data comparison can be found in <xref ref-type="table" rid="table-2">Table 2</xref>, and visual comparisons of the filtered data are available in Figs. S1&#x2013;S3.</p>
<fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>The impact of vibration on the KF</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-14a.tif"/>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-14b.tif"/>
</fig>
<table-wrap id="table-2"><label>Table 2</label>
<caption>
<title>Comparison of standard deviation under different measurement error</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left"/>
<th align="left">Day 1</th>
<th align="left">Day 2</th>
<th align="left">Day 3</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Internal</td>
<td align="left">544.0759</td>
<td align="left">664.6504</td>
<td align="left">263.1777</td>
</tr>
<tr>
<td align="left">Vibration</td>
<td align="left">75.5754</td>
<td align="left">80.7921</td>
<td align="left">86.0062</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be seen from the results that using vibration information as the measurement error covariance of the KF can significantly reduce the amplitude and fluctuation of the displacement difference. The comparison of the standard deviation shows that using vibration data can significantly reduce the fluctuation of the catenary displacement. The reason for this result is that using catenary vibration information as observation noise can more accurately reflect the interference carried by sensors when detecting catenary displacement.</p>
</sec>
<sec id="s5_4">
<label>5.4</label>
<title>Comparison of the Prediction Performance</title>
<p>To assess the progressive nature of the proposed algorithm, we compare it with the unscented Kalman filter (UKF) in [<xref ref-type="bibr" rid="ref-10">10</xref>] and the KalmanNet in [<xref ref-type="bibr" rid="ref-13">13</xref>]. The test set comprises three days of data collected from sensors, with the comparison parameter remaining as the difference between the filtered and theoretical values. The results of this comparison are depicted in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>, and detailed experimental data can be found in <xref ref-type="table" rid="table-3">Table 3</xref>. For a visual representation of the original filtered data comparison, refer to Figs. S4&#x2013;S6.</p>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>Comparison of filtering effects</title></caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="SDHM_44023-fig-15.tif"/>
</fig><table-wrap id="table-3"><label>Table 3</label>
<caption>
<title>Comparison of standard deviations between different algorithms</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left"/>
<th align="left">Day 1</th>
<th align="left">Day 2</th>
<th align="left">Day 3</th>
<th align="left">Mean</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Kalman</td>
<td align="left">215.4166</td>
<td align="left">118.1470</td>
<td align="left">160.2684</td>
<td align="left">187.9107</td>
</tr>
<tr>
<td align="left">UKF</td>
<td align="left">127.5826</td>
<td align="left">89.1995</td>
<td align="left">117.7021</td>
<td align="left">111.4947</td>
</tr>
<tr>
<td align="left">KalmanNet</td>
<td align="left">39.1860</td>
<td align="left">51.7298</td>
<td align="left">67.9718</td>
<td align="left">52.9625</td>
</tr>
<tr>
<td align="left">Proposed</td>
<td align="left">4.4431</td>
<td align="left">6.0577</td>
<td align="left">7.8699</td>
<td align="left">6.1236</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From the experimental results, compared to the traditional KF, the UKF, and the KalmanNet have a certain filtering effect. However, the filtering effect of the proposed algorithm is the most visible because it has made proprietary improvements to the problem discussed in this paper. From <xref ref-type="fig" rid="fig-15">Fig. 15c</xref>, it can be seen that even for relatively less obvious interference, the proposed algorithm can still achieve better filtering performance.</p>
<p>To further verify the actual aging prediction ability of the proposed algorithm, a prediction accuracy comparison is also conducted. In this experiment, the fault diagnosis threshold is set to the displacement difference of the catenary greater than 20&#x2005;mm and the duration exceeding 10&#x2005;min. The comparative experimental results are shown in <xref ref-type="table" rid="table-4">Table 4</xref>. The results show that the proposed algorithm greatly reduces the false alarm rate of faults caused by environmental factors or pantograph influence in the railway catenary system.</p>
<table-wrap id="table-4"><label>Table 4</label>
<caption>
<title>Number of false alarms</title></caption>
<table><colgroup><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/><col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left"/>
<th align="left">Day 1</th>
<th align="left">Day 2</th>
<th align="left">Day 3</th>
<th align="left">Day 4</th>
<th align="left">Day 5</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Kalman</td>
<td align="left">8</td>
<td align="left">10</td>
<td align="left">11</td>
<td align="left">3</td>
<td align="left">5</td>
</tr>
<tr>
<td align="left">UKF</td>
<td align="left">2</td>
<td align="left">4</td>
<td align="left">5</td>
<td align="left">0</td>
<td align="left">1</td>
</tr>
<tr>
<td align="left">KalmanNet</td>
<td align="left">0</td>
<td align="left">2</td>
<td align="left">1</td>
<td align="left">0</td>
<td align="left">0</td>
</tr>
<tr>
<td align="left">Proposed</td>
<td align="left">0</td>
<td align="left">1</td>
<td align="left">0</td>
<td align="left">0</td>
<td align="left">0</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>This paper proposes an improved KF algorithm to enhance the accuracy of aging prediction for the railway catenary. The suggested algorithm substitutes the priori state estimation and error in the KF procedure with the output and error of the T-S FNN model and uses the catenary vibration information as a replacement for sensor observation noise. To enhance the network&#x2019;s training efficiency, an adaptive algorithm that dynamically selects fuzzy rules is suggested. Comparative experiments are conducted on an FPGA-based data acquisition and computing platform to verify the effectiveness of the proposed algorithm. The platform utilizes a modular pipeline design that enables rapid data processing. After comparing the experimental results, it is apparent that the proposed method possesses substantial advantages over other enhanced KF algorithms.</p>
<p>The model described in this paper is based on the study of a single railway catenary system, so the variable parameters considered are relatively few, and there may be some interference factors that are not considered in practical, resulting in a certain deviation in the prediction. So to further improve the accuracy of prediction and the universality of the model in multi-catenary systems, the future research goal will be positioned in multi-catenary systems.</p>
</sec>
<sec sec-type="supplementary-material" id="s7">
<title>Supplementary Materials</title>
<supplementary-material id="SD1">
<label>Figure S1</label>
<caption><title>The impact of vibration information on filtering performance at Day 1</title></caption>
<media xlink:href="SDHM-17-44023-s001.tif"/>
</supplementary-material>
<supplementary-material id="SD2">
<label>Figure S2</label>
<caption><title>The impact of vibration information on filtering performance at Day 2</title></caption>
<media xlink:href="SDHM-17-44023-s002.tif"/>
</supplementary-material>
<supplementary-material id="SD3">
<label>Figure S3</label>
<caption><title>The impact of vibration information on filtering performance at Day 3</title></caption>
<media xlink:href="SDHM-17-44023-s003.tif"/>
</supplementary-material>
<supplementary-material id="SD4">
<label>Figure S4</label>
<caption><title>The filtering effect of the proposed algorithm at Day 1</title></caption>
<media xlink:href="SDHM-17-44023-s004.tif"/>
</supplementary-material>
<supplementary-material id="SD5">
<label>Figure S5</label>
<caption><title>The filtering effect of the proposed algorithm at Day 2</title></caption>
<media xlink:href="SDHM-17-44023-s005.tif"/>
</supplementary-material>
<supplementary-material id="SD6">
<label>Figure S6</label>
<caption><title>The filtering effect of the proposed algorithm at Day 3</title></caption>
<media xlink:href="SDHM-17-44023-s006.tif"/>
</supplementary-material>
<supplementary-material id="SD7">
<media xlink:href="SDHM-17-44023-s001.xlsx"/>
</supplementary-material>
</sec>
</body>
<back>
<ack>
<p>The authors also thank the anonymous reviewers and referees for their valuable comments and suggestions.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was supported by the Science and Technology Research Project of Henan Province (No. 222102210087) and the Science and Technology Research Project of Henan Province (No. 222102220102).</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Jie Li, Yongtao Hu; data collection: Rongwen Wang; analysis and interpretation of results: Jie Li, Rongwen Wang; draft manuscript preparation: Rongwen Wang, Jinjun Li. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The training data used in this paper is private to the enterprise and cannot be publicly disclosed completely.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare that they have no conflicts of interest to report regarding the present study.</p>
</sec>
<sec>
<title>Supplementary Materials</title>
<p>The supplementary material is available online at <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.32604/SDHM.2023.044023">https://doi.org/10.32604/sdhm.2023.044023</ext-link>.</p>
</sec>
<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>Zheng</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wu</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wei</surname>, <given-names>Z.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Intrusion detection of foreign objects in overhead power system for preventive maintenance in high-speed railway catenary inspection</article-title>. <source>IEEE Transactions on Instrumentation and Measurement</source><italic>,</italic> <volume>71</volume><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>12</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fan</surname>, <given-names>S.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Electrical control online monitoring system based on internet of things</article-title>. <source>Wireless Communications and Mobile Computing</source><italic>,</italic> <volume>2021</volume><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>12</lpage>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mao</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Nie</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Enhancing strength and electrical conductivity of Cu&#x2013;Cr composite wire by two-stage rotary swaging and aging treatments</article-title>. <source>Composites Part B: Engineering</source><italic>,</italic> <volume>231</volume><italic>,</italic> <fpage>109567</fpage>.</mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2017</year>). <article-title>High-speed railway catenary components detection using the cascaded convolutional neural networks</article-title>. <conf-name>2017 IEEE International Conference on Imaging Systems and Techniques (IST)</conf-name>, pp. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. <conf-loc>Beijing, China</conf-loc>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>R.</given-names></string-name>, <string-name><surname>Lin</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Jin</surname>, <given-names>T.</given-names></string-name></person-group> (<year>2022</year>). <article-title>High-speed railway pantograph-catenary anomaly detection method based on depth vision neural network</article-title>. <source>IEEE Transactions on Instrumentation and Measurement</source><italic>,</italic> <volume>71</volume><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>10</lpage>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Qin</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Qian</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>F.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Automatic detection of arbitrarily oriented fastener defect in high-speed railway</article-title>. <source>Automation in Construction</source><italic>,</italic> <volume>131</volume><italic>,</italic> <fpage>103913</fpage>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kang</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Gao</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2018</year>). <article-title>Deep architecture for high-speed railway insulator surface defect detection: Denoising auto encoder with multitask learning</article-title>. <source>IEEE Transactions on Instrumentation and Measurement</source><italic>,</italic> <volume>68</volume>
<issue>(8)</issue><italic>,</italic> <fpage>2679</fpage>&#x2013;<lpage>2690</lpage>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Xu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>Q.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Data processing for rail level dynamic inspection based on an adaptive Kalman filter</article-title>. <source>Insight-Non-Destructive Testing and Condition Monitoring</source><italic>,</italic> <volume>65</volume>
<issue>(7)</issue><italic>,</italic> <fpage>373</fpage>&#x2013;<lpage>377</lpage>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cunillera</surname>, <given-names>A.</given-names></string-name>, <string-name><surname>Be&#x0161;inovi&#x0107;</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>van Oort</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Goverde</surname>, <given-names>R. M.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Real-time train motion parameter estimation using an unscented Kalman filter</article-title>. <source>Transportation Research Part C: Emerging Technologies</source><italic>,</italic> <volume>143</volume><italic>,</italic> <fpage>103794</fpage>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fei</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Fan</surname>, <given-names>L.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Optimal estimation of injection rate for high-pressure common rail system using the extended Kalman filter</article-title>. <source>Measurement</source><italic>,</italic> <volume>220</volume><italic>,</italic> <fpage>113385</fpage>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liu</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Jiang</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Cai</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Heirich</surname>, <given-names>O.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2023</year>). <article-title>Robust train localisation method based on advanced map matching measurement-augmented tightly-coupled GNSS/INS with error-state UKF</article-title>. <source>The Journal of Navigation</source><italic>,</italic> <volume>76</volume>
<issue>(2&#x2013;3)</issue><italic>,</italic> <fpage>316</fpage>&#x2013;<lpage>339</lpage>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Long</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Bai</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Ren</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Yu</surname>, <given-names>D.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Fault detection and isolation of aeroengine combustion chamber based on unscented Kalman filter method fusing artificial neural network</article-title>. <source>Energy</source><italic>,</italic> <volume>272</volume><italic>,</italic> <fpage>127068</fpage>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Revach</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Shlezinger</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Ni</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Escoriza</surname>, <given-names>A. L.</given-names></string-name>, <string-name><surname>Van Sloun</surname>, <given-names>R. J.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2022</year>). <article-title>KalmanNet: Neural network aided Kalman filtering for partially known dynamics</article-title>. <source>IEEE Transactions on Signal Processing</source><italic>,</italic> <volume>70</volume><italic>,</italic> <fpage>1532</fpage>&#x2013;<lpage>1547</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kim</surname>, <given-names>D.</given-names></string-name>, <string-name><surname>Kim</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Choi</surname>, <given-names>S.</given-names></string-name></person-group>, <person-group person-group-type="author"><string-name><surname>Huh</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>An integrated deep ensemble-unscented Kalman filter for sideslip angle estimation with sensor filtering network</article-title>. <source>IEEE Access</source><italic>,</italic> <volume>9</volume><italic>,</italic> <fpage>149681</fpage>&#x2013;<lpage>149689</lpage>.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhao</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Jiang</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Lu</surname>, <given-names>G.</given-names></string-name> <etal>et al.</etal></person-group> (<year>2023</year>). <article-title>Image splicing compression algorithm based on the extended Kalman filter for unmanned aerial vehicles communication</article-title>. <source>Drones</source><italic>,</italic> <volume>7</volume>
<issue>(8)</issue><italic>,</italic> <fpage>488</fpage>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Deng</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>He</surname>, <given-names>C.</given-names></string-name>, <string-name><surname>Liu</surname>, <given-names>Y.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Deep neural network-based strategy for optimal sensor placement in data assimilation of turbulent flow</article-title>. <source>Physics of Fluids</source><italic>,</italic> <volume>33</volume>
<issue>(2)</issue><italic>,</italic> <fpage>025119</fpage>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abdelrahim</surname>, <given-names>E. M.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Binary particle swarm optimization-based TS fuzzy predictive controller for nonlinear automotive application</article-title>. <source>Neural Computing and Applications</source><italic>,</italic> <volume>33</volume>
<issue>(7)</issue><italic>,</italic> <fpage>2803</fpage>&#x2013;<lpage>2818</lpage>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yang</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Dian</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Guo</surname>, <given-names>B.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Predictive control of thermal barrier coating temperature based on TS fuzzy model</article-title>. <conf-name>2021 6th International Conference on Automation, Control and Robotics Engineering (CACRE)</conf-name>, pp. <fpage>145</fpage>&#x2013;<lpage>149</lpage>. <conf-loc>Dalian, China</conf-loc>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Shangguan</surname>, <given-names>W.</given-names></string-name>, <string-name><surname>Cai</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Pecht</surname>, <given-names>M. G.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Hybrid remaining useful life prediction method. A case study on railway D-cables</article-title>. <source>Reliability Engineering &#x0026; System Safety</source><italic>,</italic> <volume>213</volume><italic>,</italic> <fpage>107746</fpage>.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Narges</surname>, <given-names>K. H.</given-names></string-name>, <string-name><surname>Ahmad</surname>, <given-names>M.</given-names></string-name>, <string-name><surname>Fereydoun</surname>, <given-names>G. M.</given-names></string-name></person-group> (<year>2022</year>). <article-title>A hybrid fault diagnosis scheme for railway point machines by motor current signal analysis</article-title>. <source>Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit</source><italic>,</italic> <volume>236</volume>
<issue>(9)</issue><italic>,</italic> <fpage>1026</fpage>&#x2013;<lpage>1034</lpage>.</mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jan</surname>, <given-names>S. U.</given-names></string-name>, <string-name><surname>Lee</surname>, <given-names>Y. D.</given-names></string-name>, <string-name><surname>Koo</surname>, <given-names>I. S.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A distributed sensor-fault detection and diagnosis framework using machine learning</article-title>. <source>Information Sciences</source><italic>,</italic> <volume>547</volume><italic>,</italic> <fpage>777</fpage>&#x2013;<lpage>796</lpage>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yao</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Huang</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Zhou</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Effect of ambient temperature on current collection quality in pantograph&#x2013;Catenary interaction</article-title>. <source>International Journal of Structural Stability and Dynamics</source><italic>,</italic> <volume>23</volume><italic>(</italic><issue>13</issue><italic>),</italic> <fpage>2350145</fpage>.</mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Lin</surname>, <given-names>G.</given-names></string-name>, <string-name><surname>Yang</surname>, <given-names>X.</given-names></string-name></person-group> (<year>2022</year>). <article-title>Parameter identification for current&#x2013;temperature relationship of contact wire under natural convection</article-title>. <source>International Journal of Electrical Power &#x0026; Energy Systems</source><italic>,</italic> <volume>135</volume><italic>,</italic> <fpage>107554</fpage>.</mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Song</surname>, <given-names>B.</given-names></string-name>, <string-name><surname>Zeng</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Du</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Guizani</surname>, <given-names>M.</given-names></string-name></person-group> (<year>2021</year>). <article-title>Fault diagnosis based on deep learning for current-carrying ring of catenary system in sustainable railway transportation</article-title>. <source>Applied Soft Computing</source><italic>,</italic> <volume>100</volume><italic>,</italic> <fpage>106907</fpage>.</mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lv</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhou</surname>, <given-names>Q.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>W.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A predictive maintenance system for multi-granularity faults based on AdaBelief-BP neural network and fuzzy decision making</article-title>. <source>Advanced Engineering Informatics</source><italic>,</italic> <volume>49</volume><italic>,</italic> <fpage>101318</fpage>.</mixed-citation></ref>
<ref id="ref-26"><label>26.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kennedy</surname>, <given-names>R. K.</given-names></string-name>, <string-name><surname>Salekshahrezaee</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Villanustre</surname>, <given-names>F.</given-names></string-name>, <string-name><surname>Khoshgoftaar</surname>, <given-names>T. M.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Iterative cleaning and learning of big highly-imbalanced fraud data using unsupervised learning</article-title>. <source>Journal of Big Data</source><italic>,</italic> <volume>10</volume>
<issue>(1)</issue><italic>,</italic> <fpage>106</fpage>.</mixed-citation></ref>
<ref id="ref-27"><label>27.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Son</surname>, <given-names>H.</given-names></string-name>, <string-name><surname>Ahn</surname>, <given-names>J.</given-names></string-name>, <string-name><surname>Chung</surname>, <given-names>A. D.</given-names></string-name>, <string-name><surname>Drumwright</surname>, <given-names>M. E.</given-names></string-name></person-group> (<year>2023</year>). <article-title>From the black box to the glass box: Using unsupervised and supervised learning processes to predict user engagement for the airline companies</article-title>. <source>International Journal of Information Management Data Insights</source><italic>,</italic> <volume>3</volume>
<issue>(2)</issue><italic>,</italic> <fpage>100181</fpage>.</mixed-citation></ref>
<ref id="ref-28"><label>28.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Dong</surname>, <given-names>S.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>P.</given-names></string-name>, <string-name><surname>Abbas</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2021</year>). <article-title>A survey on deep learning and its applications</article-title>. <source>Computer Science Review</source><italic>,</italic> <volume>40</volume><italic>,</italic> <fpage>100379</fpage>.</mixed-citation></ref>
<ref id="ref-29"><label>29.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Li</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Research on outdoor mobile music speaker battery management algorithm based on dynamic redundancy</article-title>. <source>Technologies</source><italic>,</italic> <volume>11</volume>
<issue>(2)</issue><italic>,</italic> <fpage>60</fpage>.</mixed-citation></ref>
<ref id="ref-30"><label>30.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Ma</surname>, <given-names>N.</given-names></string-name>, <string-name><surname>Zheng</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Developments and applications of artificial intelligence in music education</article-title>. <source>Technologies</source><italic>,</italic> <volume>11</volume>
<issue>(2)</issue><italic>,</italic> <fpage>42</fpage>.</mixed-citation></ref>
<ref id="ref-31"><label>31.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yi</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Chen</surname>, <given-names>Z.</given-names></string-name>, <string-name><surname>Yin</surname>, <given-names>K.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Sensing as the key to the safety and sustainability of new energy storage devices</article-title>. <source>Protection and Control of Modern Power Systems</source><italic>,</italic> <volume>8</volume>
<issue>(1)</issue><italic>,</italic> <fpage>1</fpage>&#x2013;<lpage>22</lpage>.</mixed-citation></ref>
<ref id="ref-32"><label>32.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sun</surname>, <given-names>X.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Zhang</surname>, <given-names>Y.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>L.</given-names></string-name>, <string-name><surname>Wang</surname>, <given-names>K.</given-names></string-name></person-group> (<year>2023</year>). <article-title>Summary of health-state estimation of lithium-ion batteries based on electrochemical impedance spectroscopy</article-title>. <source>Energies</source><italic>,</italic> <volume>16</volume>
<issue>(15)</issue><italic>,</italic> <fpage>5682</fpage>.</mixed-citation></ref>
</ref-list>
</back>
</article>


















