<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Archiving and Interchange DTD v2.3 20070202//EN" "archivearticle.dtd">
<article article-type="methods-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1365237</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2024.1365237</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Methods</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Wind power short-term prediction based on digital twin technology</article-title>
<alt-title alt-title-type="left-running-head">Liu</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fenrg.2024.1365237">10.3389/fenrg.2024.1365237</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Liu</surname>
<given-names>Shu</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/2615985/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/project-administration/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
</contrib-group>
<aff>
<institution>Shenyang Institute of Engineering</institution>, <addr-line>Shenyang</addr-line>, <addr-line>Liaoning</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/971050/overview">David Howe Wood</ext-link>, University of Calgary, Canada</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/615262/overview">Kenneth E. Okedu</ext-link>, Melbourne Institute of Technology, Australia</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/507713/overview">Minh Quan Duong</ext-link>, The University of Danang, Vietnam</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Shu Liu, <email>ls_jhl@163.com</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>27</day>
<month>09</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="collection">
<year>2024</year>
</pub-date>
<volume>12</volume>
<elocation-id>1365237</elocation-id>
<history>
<date date-type="received">
<day>04</day>
<month>01</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>21</day>
<month>03</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2024 Liu.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Liu</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Wind power generation has become an indispensable part of the power supply side of the power grid. Due to the intermittent and uncertain characteristics of wind energy, short-term wind power prediction plays an important role in the stable operation of power system. By constructing the digital twin model, real-time and high-precision prediction of wind energy is realized. First, the genetic algorithm-support vector machine (GA-SVM) algorithm is used to build the model. Multidimensional sensors and meteorological stations of the virtual wind power generation system collected the meteorological data of the environment and updated the meteorological history database at the same time. Second, based on the collected meteorological data, the preliminary prediction results are obtained, and by searching in the historical database, the predicted value and the actual output value of wind turbines or wind farms under similar conditions are obtained. Finally, the prediction results of the GA-SVM are modified to obtain the predicted value of the digital twin model. The prediction method can greatly improve the accuracy of the short-term forecast of wind energy.</p>
</abstract>
<kwd-group>
<kwd>digital twin</kwd>
<kwd>wind power prediction</kwd>
<kwd>genetic algorithm</kwd>
<kwd>support vector machine model</kwd>
<kwd>genetic algorithm-support vector machine</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Wind Energy</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1">
<title>Introduction</title>
<p>Wind power generation is the main form of wind energy utilization. However, because wind energy is affected by the natural environment, it shows the characteristics of intermittency, randomness, and fluctuation of wind power, which have a great impact on the power grid. Prediction of wind power in wind farms can not only reduce the uncertainty of wind power generation and provide a basis for power grid operation and dispatching but also formulate maintenance plans for wind farms so as to reduce unnecessary risks and reduce the cost of wind power generation, while improving the utilization rate of wind energy. There are three types of forecasting methods (<xref ref-type="bibr" rid="B12">Peng, X et al., 2019</xref>; <xref ref-type="bibr" rid="B18">Yan, J.2014</xref>; <xref ref-type="bibr" rid="B3">Ding, T et al., 2017</xref>; <xref ref-type="bibr" rid="B15">Tian, Z et al., 2015</xref>; <xref ref-type="bibr" rid="B14">Tascikaraoglu, A et al., 2014</xref>).</p>
<p>
<xref ref-type="bibr" rid="B5">He, Y., et al. (2017)</xref> combined the wavelet neural network, support vector machine, and time-series algorithm to predict the wind power in ultra-short term; the experimental results show that the combined prediction model can greatly improve the prediction accuracy of output power. <xref ref-type="bibr" rid="B20">Yin, H., et al. (2021)</xref> used the LSTM neural network with short-term and long-term memory ability of time-series data, which is effective when combined with the random search method to optimize the hyperparameters of the prediction model. <xref ref-type="bibr" rid="B10">Luo, F., et al. (2021)</xref> carried out the pretreatment of nonlinear time-series data based on the LSTM network using singular spectrum analysis (SAA). <xref ref-type="bibr" rid="B19">Yao, T. (2019)</xref> used the sparse autoencoder (SAE) network with a simple structure, less training difficulty, and stronger feature extraction ability to extract and predict the features of wind power. Liang et al. proposed a prediction method for intelligent identification and fluctuation rule mining of the fluctuation process of the total output of multiple wind farms, so as to obtain the trend of wind power 4h in the future.</p>
<p>At present, the difficulty of wind power forecasting lies in the forecasting accuracy and forecasting timeliness. The traditional forecasting method takes the average meteorological data as the input, so the forecast result is also the average power output. However, with the improvement in the dispatching accuracy, the average power output cannot meet the requirements. The real-time change in meteorological data will also cause the collected meteorological data to be updated in time, which will reduce the prediction accuracy.</p>
<p>The real operation data of Inner Mongolia and local wind tower data are used as research samples. First, the digital twin model is established by use of the improved neural network genetic algorithm-support vector machine (GA-SVM) model algorithm, and the initial power prediction is carried out. According to the approximate meteorological statistical parameters, the actual power value of the whole wind farm under the approximate historical conditions is obtained. Finally, the historical data in the wind farm database are used to revise the preliminary forecast results and get the final forecast results, namely, the digital twin-predicted value.</p>
</sec>
<sec id="s2">
<title>Digital twin technology and its application</title>
<p>In 2010, NASA proposed the concept of digital twins for the first time in the space technology roadmap. Integrated multiscale, probabilistic whole process simulation, with real-time synchronization, always mapping characteristics, can realize the interaction between the physical world and the digital scene, by integration of technical means. With the continuous progress of Big Data and scientific and technological means, digital twin technology can accurately integrate physical entities with information models. According to the high-speed transmission of sensor data, the real-time state can be changed so that the physical entity can be effectively simulated, monitored, predicted, and controlled (<xref ref-type="bibr" rid="B1">Chen, S et al., 2020</xref>; <xref ref-type="bibr" rid="B9">Liu, Y et al., 2021</xref>; <xref ref-type="bibr" rid="B8">Liu, S et al., 2022</xref>).</p>
<p>Digital twinning mainly includes three main parts: the physical object of real space, the twinning model of virtual space, and the information of closed-loop interaction between them, as shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. Real-time closed-loop information exchange is the key and difficult point in digital twin application.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Digital twin architecture.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g001.tif"/>
</fig>
<p>The concept of digital twin has promoted the rapid development of smart wind farms and has been increasingly applied in the wind energy industry. With the support of Big Data, design, construction, and operations personnel will be able to use the digital twin to compare the idealized, engineered conditions of the equipment with the actual conditions of the actual project. In this way, we can constantly adjust and optimize the way we design, build, and operate. Digital twin technology will control the whole process of wind farm management cooperation.</p>
</sec>
<sec id="s3">
<title>Digital twin model of the wind power prediction system</title>
<sec id="s3-1">
<title>Digital twin structure</title>
<p>The digital twin structure for wind power prediction is shown in <xref ref-type="fig" rid="F2">Figure 2</xref>, which mainly includes four parts: entity layer, data layer, virtual layer, and decision-making layer.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Digital twin structure system of the wind power prediction system.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g002.tif"/>
</fig>
<sec id="s3-1-1">
<title>Entity layer</title>
<p>The physical layer is the basis of the digital twin prediction system. It includes the wind turbine and wind farm transformer and distribution equipment and is the source of information and energy of the prediction system and also the real carrier of digital twin data. By collecting real-time data from sensors, the mapping relationship between physical devices and digital twins is constructed, and data for effective running and working environment are provided for the data layer (<xref ref-type="bibr" rid="B17">Wang, Y et al., 2021</xref>).</p>
</sec>
<sec id="s3-1-2">
<title>Data layer</title>
<p>The data layer should not only realize full coverage but also have certain self-management and analysis abilities to preprocess the data to ensure the rationality of the data so as to form a real-time and accurate perception system for ensuring the normal operation of the digital twin system (<xref ref-type="bibr" rid="B11">Morello, R et al., 2017</xref>). The data layer is a two-way transmission channel, which has the characteristics of high efficiency, security, flexibility, and reliability.</p>
</sec>
<sec id="s3-1-3">
<title>Virtual layer</title>
<p>The virtual layer is the core of digital twin prediction and the key to predict the power output. The virtual layer takes the collected data as the input of the algorithm model and trains it to improve the prediction accuracy of digital twins. In addition, through the search of the historical database, the actual output value and predicted value of the instantaneous wind turbine or wind farm under similar conditions are obtained, and then the results are corrected to obtain the final results.</p>
</sec>
<sec id="s3-1-4">
<title>Decision-making layer</title>
<p>The decision-making layer can make the grid connection safer and more stable. According to the obtained wind power prediction data, it generates the wind power grid connection scheme and guides the dispatching of the power grid (<xref ref-type="bibr" rid="B4">Fang, F et al., 2020</xref>). At the same time, it can also issue corresponding maintenance instructions in combination with the actual operation of the wind turbine so that the wind power system can work normally (<xref ref-type="bibr" rid="B13">Sun, R et al., 2021</xref>).</p>
</sec>
</sec>
<sec id="s3-2">
<title>Working principle</title>
<p>The SVM algorithm is used to predict wind power and to train and model the historical data of active power and its corresponding variable data and the test data are used to test the prediction model. First, the sensor is used to collect the real-time meteorological data of the wind turbine environment. After normalization, it is tested as the input of the power prediction model, and the preliminary results are obtained. The SVM algorithm has good generalization ability and can well-solve the types of problems in non-linear pattern recognition. On this basis, the characteristics of the GA algorithm are used to optimize the parameter finding problem of the SVM.</p>
<p>On this basis, the digital twin is used as the skeleton of the power prediction model to connect wind farm, twin data, and the prediction model as a whole; the prediction model and twin data are interconnected in real time to enhance the timeliness and reliability of wind power prediction of the wind farm. Meanwhile, the sensor compensation mechanism is introduced to compensate the prediction deviation of the wind farm caused by real-time change of meteorological data so as to further improve the wind power accuracy. The flow of the digital twin wind power prediction system is shown in <xref ref-type="fig" rid="F3">Figure 3</xref>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Flow chart of the digital twin wind power prediction system.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g003.tif"/>
</fig>
<p>With the continuous updating of twin data, the compensation of the meteorological database for prediction power will be more accurate, and the prediction accuracy will be continuously improved within a certain range.</p>
</sec>
</sec>
<sec id="s4">
<title>Wind power prediction based on the SVM algorithm</title>
<sec id="s4-1">
<title>Data preprocessing</title>
<p>Whether the data are selected correctly directly affects the experimental results. Due to factors such as system failure, wind power curtailment policy, and environmental impact of collection, the data of wind farms will be missing and abnormal. Wind farm output will be affected by environmental factors such as wind speed, temperature, and wind direction, but if all influencing factors are taken into account, it will interfere with the model. Therefore, it is necessary to select several key variables to predict wind power.</p>
<p>The wind power is calculated as follows:<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mi>A</mml:mi>
<mml:mo>&#x2217;</mml:mo>
<mml:msup>
<mml:mi>V</mml:mi>
<mml:mn>3</mml:mn>
</mml:msup>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mi>p</mml:mi>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>D</mml:mi>
<mml:mo>&#x2217;</mml:mo>
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>where <italic>p</italic> is wind power, <italic>A</italic> is the sweeping area, <italic>V</italic> is the wind speed, <italic>Cp</italic> is the conversion rate of wind energy, <italic>D</italic> is the air density, and <inline-formula id="inf1">
<mml:math id="m2">
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the power factor.</p>
<p>According to Eq. <xref ref-type="disp-formula" rid="e1">1</xref>, the sweeping area is related to the fan blade radius and wind direction angle, and the wind energy conversion rate varies with the technology of the fan manufacturer; therefore, in the wind speed prediction for a single fan, the most direct influencing factors are wind speed and wind direction.</p>
<p>To ensure data continuity, the missing data need to be filled by linear interpolation. Linear interpolation is often used in the fields of statistics and computer science.</p>
<p>The linear interpolation formula is shown in Eq. <xref ref-type="disp-formula" rid="e2">2</xref>:<disp-formula id="e2">
<mml:math id="m3">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mfrac>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mo>,</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>where <inline-formula id="inf2">
<mml:math id="m4">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf3">
<mml:math id="m5">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf4">
<mml:math id="m6">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represent the values at times <italic>i</italic>, <italic>i</italic> &#x2b; <italic>m</italic>, and <italic>i</italic> &#x2b; <italic>n</italic> of the same time series, respectively.</p>
<p>The collected wind speed, power, and other data will have noise due to the impact of the environment, which affects the reliability of the data, in order to make it complex with the real field environment. Therefore, the data noise reduction process is carried out. The wind speed and power data have good continuity and smoothness, so the wavelet soft threshold denoising method is used for denoising. If the absolute value of the wavelet coefficient is less than the given threshold, it is set to 0; when it is greater than the threshold, the threshold is subtracted from the wavelet coefficient, and the formula is shown in Eq. <xref ref-type="disp-formula" rid="e3">3</xref>:<disp-formula id="e3">
<mml:math id="m7">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>&#x3bb;</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mfenced open="[" close="" separators="|">
<mml:mrow>
<mml:mtext>sgn</mml:mtext>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2265;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mn>0</mml:mn>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3c;</mml:mo>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
<p>The determination of a reasonable threshold can separate the signal and noise, so it can denoise effectively.</p>
</sec>
<sec id="s4-2">
<title>Data normalization</title>
<p>The next step is data normalization. It is to enlarge or narrow the relevant data to a relative interval according to a certain proportion so that the indicators are in the same order of magnitude. Data normalization is done to process the data, and the formula is shown in Eq. <xref ref-type="disp-formula" rid="e4">4</xref>:<disp-formula id="e4">
<mml:math id="m8">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>max</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>max</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>where <italic>x</italic>
<sub>
<italic>min</italic>
</sub> is the minimum value of the original data, <italic>x</italic>
<sub>
<italic>max</italic>
</sub> is the maximum value of the original data, <italic>x</italic> is the original data, and <italic>y</italic> is the normalized target value.</p>
</sec>
<sec id="s4-3">
<title>Establishment of the SVM model optimized by the genetic algorithm</title>
<p>SVR transforms the non-linear problem into a high-dimensional linear solvable problem through the mapping of kernel function. The task of the homing machine is to find the parameter <inline-formula id="inf5">
<mml:math id="m9">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> so that the error between the objective function <inline-formula id="inf6">
<mml:math id="m10">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>&#x22c5;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and the actual value is within an acceptable range (<xref ref-type="bibr" rid="B2">Chen, Y et al., 2021</xref>).</p>
<p>Suppose there is a training sample <inline-formula id="inf7">
<mml:math id="m11">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>I</mml:mi>
<mml:mo>;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mi>n</mml:mi>
</mml:msup>
<mml:mo>;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. A nonlinear mapping <inline-formula id="inf8">
<mml:math id="m12">
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mo>&#x22c5;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is used to map the sample space to the feature space <inline-formula id="inf9">
<mml:math id="m13">
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> and construct linear regression function in high-dimensional feature space: <inline-formula id="inf10">
<mml:math id="m14">
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula id="inf11">
<mml:math id="m15">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the weight vector, <inline-formula id="inf12">
<mml:math id="m16">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mi>k</mml:mi>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>R</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. At this time, the problem of nonlinear regression in the original sample space is transformed into the problem of linear regression in the high-dimensional feature space. It can be expressed as an optimization function:<disp-formula id="e5">
<mml:math id="m17">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>J</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3c9;</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>&#x3be;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>T</mml:mi>
</mml:msup>
<mml:mi>&#x3c9;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>l</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b6;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3b6;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>.</mml:mo>
<mml:mtext>&#xa0;</mml:mtext>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>&#x3b6;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mi>&#x3b6;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>where <inline-formula id="inf13">
<mml:math id="m18">
<mml:mrow>
<mml:mi>&#x3b5;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is a constant, <italic>C</italic> is a penalty factor, and <inline-formula id="inf14">
<mml:math id="m19">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b6;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf15">
<mml:math id="m20">
<mml:mrow>
<mml:msubsup>
<mml:mi>&#x3b6;</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are relaxation factors.</p>
<p>For Eq. <xref ref-type="disp-formula" rid="e5">5</xref>, Lagrange multipliers <inline-formula id="inf16">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf17">
<mml:math id="m22">
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> are introduced to transform it into a dual problem, and the optimization function is given, see Eq. <xref ref-type="disp-formula" rid="e6">6</xref>:<disp-formula id="e6">
<mml:math id="m23">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>min</mml:mi>
<mml:mo>&#x2061;</mml:mo>
<mml:mi>I</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>a</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>l</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>K</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<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>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b5;</mml:mi>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>l</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>l</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="left">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>J</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>&#x2264;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mi>j</mml:mi>
<mml:mo>&#x2a;</mml:mo>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2264;</mml:mo>
<mml:mi>C</mml:mi>
<mml:mo>/</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>where <inline-formula id="inf18">
<mml:math id="m24">
<mml:mrow>
<mml:mi>K</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is a kernel function.</p>
<p>Finally, the regression function is Eq. <xref ref-type="disp-formula" rid="e7">7</xref>:<disp-formula id="e7">
<mml:math id="m25">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>l</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mi>K</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>b</mml:mi>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
</p>
<p>By training the sample data and adjusting the <italic>C</italic> value and gamma value most suitable for the model, the prediction model can be obtained. With the passage of time, the sample database will be increasingly larger, the twin data will be increasingly perfect, and the prediction accuracy will be continuously improved. Digital twinning is based on a large amount of data and has high requirements for data. It should not only have timeliness but also have reliability. Therefore, the focus of digital twinning should be on the process of data and modeling and simulation. When using MATLAB software for modeling and simulation, it is necessary to test the model many times and compare the uncertain quantities in the model again and again until the expected results are obtained.</p>
</sec>
<sec id="s4-4">
<title>Predicted value compensation correction</title>
<p>Because of the meteorological data changes in real time, the prediction error is increased; the prediction results of the SVM model optimized using the genetic algorithm should be compensated and corrected. The paper sets up the wind power error compensation link. The new data are constructed as the objective function, and the actual output power and predicted power of similar meteorological days searched in the historical database are used to correct the initial prediction results. The compensation process is shown in <xref ref-type="fig" rid="F4">Figure 4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Flow chart of the wind power compensation algorithm.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g004.tif"/>
</fig>
</sec>
<sec id="s4-5">
<title>Numerical example and result analysis</title>
<p>The meteorological data and measured data of a wind farm in Chagan, Inner Mongolia Autonomous Region, are selected for simulation analysis. The accuracy of the digital twin prediction model is verified, and it is proved that this prediction method has reference significance.</p>
<p>The sensors collected data on wind speed, wind direction, and temperature every 5&#xa0;min, 24&#xa0;h a day from April 2020 to May 2020 and uploaded the collected data to the database every hour. All the data in the database, except for the test day, are used as the prediction model, and a day in the later stage of the study is selected as the test day for verification. First, the data of the detection day are input into the prediction model of the GA-SVM neural network to obtain the preliminary prediction results. Then, the corresponding meteorological data are collected into the previous database for analysis and comparison; the actual power under similar conditions collected by similar meteorology is used to correct the preliminary prediction results and obtain the digital twin-predicted value.</p>
<p>This simulation includes two processes, one is to predict the power of a single fan in a wind farm in Chagan, Inner Mongolia; Next, the power of a wind farm in Chagan, Inner Mongolia is predicted. This study intercepts actual power from April 1 to April 2 in the training database. In the first process, the output power of a single fan of a wind farm in Chagan, Inner Mongolia, is predicted, and the results are shown in <xref ref-type="fig" rid="F5">Figure 5</xref>.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Forecast results of the single-fan output power of a wind farm.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g005.tif"/>
</fig>
<p>According to <xref ref-type="fig" rid="F5">Figure 5</xref>, the digital twin-predicted power curve and GA-SVM-predicted power curve are roughly consistent with the expected output curve, but there are still deviations. The prediction effect of digital twins in some time periods is not as good as that of the SVM model optimized using the genetic algorithm, which may be due to the drastic change in weather in the corresponding time period. It may be that the established historical database is not updated in time, resulting in the difference of the compensation effect, or it may be that similar meteorological data are not searched. In most of the time, the change in weather is relatively stable and has a good compensation effect. For a single wind turbine, the predicted value of the digital twin is closer to the expected output and has higher prediction accuracy.</p>
<p>Some common error evaluation indexes mainly include <italic>E</italic>
<sub>
<italic>MAE</italic>
</sub>, <italic>E</italic>
<sub>
<italic>RMSE</italic>
</sub>, average percentage error, accuracy, and qualification rate (<xref ref-type="bibr" rid="B16">Wang, S et al., 2017</xref>). The short-term power errors required by the national energy administration to be reported to the dispatching department are root mean square errors. ERMSE and EMAE were chosen as the evaluation indexes of the prediction model (<xref ref-type="bibr" rid="B6">Huang, L.2011</xref>). The specific formulas are as follows:<disp-formula id="e8">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:mfrac>
</mml:msqrt>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>%</mml:mo>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
<disp-formula id="e9">
<mml:math id="m27">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="" close="|" separators="|">
<mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mfenced open="" close="|" separators="|">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>p</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>where <italic>p</italic>
<sub>
<italic>a</italic>
</sub> is the actual value, <italic>p</italic>
<sub>
<italic>b</italic>
</sub> is the predicted value, and <italic>n</italic> is the number of predicted samples.</p>
<p>The <italic>E</italic>
<sub>
<italic>RMSE</italic>
</sub> and <italic>E</italic>
<sub>
<italic>MAE</italic>
</sub> of the two prediction models are calculated; it is shown in the following table.</p>
<p>The error comparison of prediction results in <xref ref-type="table" rid="T1">Table 1</xref> shows that for a single typhoon generator set, the <italic>E</italic>
<sub>
<italic>RMSE</italic>
</sub> and <italic>E</italic>
<sub>
<italic>MAE</italic>
</sub> of the predicted value of the digital twin are higher than the predicted value of the GA-SVM algorithm. It is concluded that in the prediction of single-fan output power, the prediction accuracy of the digital twin is higher as a whole.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Error comparison of single-fan prediction results.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Prediction model</th>
<th colspan="2" align="center">Error index</th>
</tr>
<tr>
<th align="center">
<italic>E</italic>
<sub>
<italic>RMSE</italic>
</sub>
</th>
<th align="center">
<italic>E</italic>
<sub>
<italic>MAE</italic>
</sub>
</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">GA-SVM algorithm model</td>
<td align="center">250.2005</td>
<td align="center">191.3649</td>
</tr>
<tr>
<td align="center">Digital twin prediction model</td>
<td align="center">228.0294</td>
<td align="center">182.3214</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In the second process, the power prediction results of a wind farm in Chagan, Inner Mongolia, are shown in <xref ref-type="fig" rid="F6">Figures 6</xref>&#x2013;<xref ref-type="fig" rid="F8">8</xref>.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Prediction results of output power when wind speed changes greatly.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g006.tif"/>
</fig>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Prediction results of output power when wind speed changes are moderate.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g007.tif"/>
</fig>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Prediction results of output power when wind speed changes are small.</p>
</caption>
<graphic xlink:href="fenrg-12-1365237-g008.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="F6">Figures 6</xref>&#x2013;<xref ref-type="fig" rid="F8">8</xref> that the digital twin-predicted power curve and GA-SVM-predicted power curve are roughly consistent with the expected output curve, and the numerical twin-predicted power curve is closer to the expected output curve.</p>
<p>The errors can be compared according to Eqs <xref ref-type="disp-formula" rid="e8">8</xref>, <xref ref-type="disp-formula" rid="e9">9</xref>, and it is shown in the following table.</p>
<p>The prediction results in <xref ref-type="table" rid="T2">Table 2</xref> show that for the power prediction of the whole wind farm, the predicted value of the digital twin under different wind speeds is closer to the expected output, and the accuracy is higher than that of the SVM model optimized using the genetic algorithm.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Error comparison of wind farm prediction results.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Wind speed change</th>
<th rowspan="2" align="center">Prediction model</th>
<th colspan="2" align="center">Error index</th>
</tr>
<tr>
<th align="center">
<italic>E</italic>
<sub>
<italic>RMSE</italic>
</sub>
</th>
<th align="center">
<italic>E</italic>
<sub>
<italic>MAE</italic>
</sub>
</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="2" align="center">Large</td>
<td align="center">GA-SVM algorithm model</td>
<td align="center">1.9955</td>
<td align="center">1.5097</td>
</tr>
<tr>
<td align="center">Digital twin prediction model</td>
<td align="center">1.8801</td>
<td align="center">1.3114</td>
</tr>
<tr>
<td rowspan="2" align="center">Medium</td>
<td align="center">GA-SVM algorithm model</td>
<td align="center">2.1805</td>
<td align="center">1.8940</td>
</tr>
<tr>
<td align="center">Digital twin prediction model</td>
<td align="center">2.3619</td>
<td align="center">2.0905</td>
</tr>
<tr>
<td rowspan="2" align="center">Small</td>
<td align="center">GA-SVM algorithm model</td>
<td align="center">0.2626</td>
<td align="center">0.2329</td>
</tr>
<tr>
<td align="center">Digital twin prediction model</td>
<td align="center">0.2328</td>
<td align="center">0.1860</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s5">
<title>Concluding remarks</title>
<p>The number of samples required for wind power prediction is small, and the fluctuation of data is large, which requires the model to be able to handle nonlinear data. The support vector machine has great advantages in solving multidimensional nonlinear problems; because the wind power prediction algorithm of the wind farm is subject to many external interference factors and the prediction results are often inaccurate, this study proposes to use the GA algorithm to optimize the core parameters and penalty factors of the support meter; the prediction efficiency is improved to a great extent. At the same time, the digital twin can reliably predict the wind power in real-time and effectively. By comparing the prediction results with the results of the traditional wind power prediction algorithm, the overall accuracy is found to be high, and then the correctness and reliability of this method are verified.</p>
<p>Applying digital twin technology to wind power prediction of a wind farm can not only realize the information exchange, storage, and processing of the prediction system but also provide the basis for power grid operation and dispatching so as to reduce unnecessary risks. It not only provides a reference for its application in the field of wind power generation but also promotes rapid development of digital twin and system in a more standardized way and provides assistance for the construction of intelligent wind power.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/Supplementary Material; further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s7">
<title>Author contributions</title>
<p>SL: conceptualization, data curation, formal analysis, funding acquisition, investigation, methodology, project administration, resources, software, supervision, validation, visualization, writing&#x2013;original draft, and writing&#x2013;review and editing.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare that financial support was received for the research, authorship, and/or publication of this article. This study was funded by Liaoning Provincial Department of Education Project (NO: LJ242411632054).</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>The all authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Jia</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Digital twin of the energy Internet and its application</article-title>. <source>J. Glob. Energy Interconnect.</source> <volume>3</volume> (<issue>01</issue>), <fpage>1</fpage>&#x2013;<lpage>13</lpage>. <pub-id pub-id-type="doi">10.19705/j.cnki.issn2096-5125.2020.01.001</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Hou</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Application of SVM algorithm in wind turbine power prediction</article-title>. <source>Electron. World</source>, <fpage>100</fpage>&#x2013;<lpage>102</lpage>. <pub-id pub-id-type="doi">10.19353/j.cnki.dzsj.2021.04.049</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ding</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Ultra-short-term wind speed forecasting based on improved ARIMA-GARCH model</article-title>. <source>Power Syst. Technol</source>, <fpage>1808</fpage>&#x2013;<lpage>1814</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2016.2357</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Fang</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Liang</surname>
</name>
</person-group> (<year>2020</year>). <article-title>Digital twin technology for smart power generation and its application modes</article-title>. <source>Power Gener. Technol</source>, <fpage>462</fpage>&#x2013;<lpage>470</lpage>.</citation>
</ref>
<ref id="B5">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>He</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Research on the combination method of forecasting the ultra-short-term power of wind farm</article-title>,&#x201d;. <comment>Dissertation</comment> (<publisher-loc>Chengdu, China</publisher-loc>: <publisher-name>University of Electronic Science and technology</publisher-name>).</citation>
</ref>
<ref id="B6">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>Huang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2011</year>). &#x201c;<article-title>Research on wind farm output forecasting using dynamic neural networks and application</article-title>,&#x201d;. <comment>Dissertation</comment> (<publisher-loc>Heilongjiang, China</publisher-loc>: <publisher-name>Harbin Institute of Technology</publisher-name>).</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Ultra-short-term forecasting method of wind power based on fluctuation law mining</article-title>. <source>Power Syst. Technol</source>, <fpage>4096</fpage>&#x2013;<lpage>4104</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2019.2472</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>You</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Feng</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Fu</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Research on optimal control strategy of wind&#x2013;solar hybrid system based on power prediction</article-title>. <source>ISA Trans.</source> <volume>123</volume>, <fpage>179</fpage>&#x2013;<lpage>187</lpage>. <pub-id pub-id-type="doi">10.1016/j.isatra.2021.05.010</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Optimization of the yaw control error of wind turbine</article-title>. <source>Front. Energy Res.</source> <volume>9</volume>. <fpage>626681</fpage>, <pub-id pub-id-type="doi">10.3389/fenrg.2021.626681</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Luo</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Load analysis and prediction of integrated energy distribution system based on deep learnin</article-title>. <source>High. Volt. Technol</source>, <fpage>23</fpage>&#x2013;<lpage>32</lpage>. <pub-id pub-id-type="doi">10.13336/j.1003-6520.hve.20201477</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Morello</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>De Capua</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Fulco</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Mukhopadhyay</surname>
<given-names>S. C.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A smart power meter to monitor energy flow in smart grids: the role of advanced sensing and IoT in the electric grid of the future</article-title>. <source>IEEE Sensors J.</source> <volume>17</volume> (<issue>23</issue>), <fpage>7828</fpage>&#x2013;<lpage>7837</lpage>. <pub-id pub-id-type="doi">10.1109/jsen.2017.2760014</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Peng</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Che</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). &#x201c;<article-title>Wind power prediction for wind farm clusters based on the multi-feature similarity matching method</article-title>,&#x201d; in <conf-name>2019 IEEE Industry Applications Society Annual Meeting</conf-name>, <conf-loc>Baltimore, MD, USA</conf-loc>, <conf-date>September 2019</conf-date>.</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sun</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Ding</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>H. X.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Ultra-short-term prediction of photovoltaic power generation based on digital twins</article-title>. <source>Power Syst. Technol</source>, <fpage>1258</fpage>&#x2013;<lpage>1264</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2020.0711</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tascikaraoglu</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Uzunoglu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>A review of combined approaches for prediction of short-term wind speed and power</article-title>. <source>Renew. Sustain. Energy Rev.</source> <volume>34</volume>, <fpage>243</fpage>&#x2013;<lpage>254</lpage>. <pub-id pub-id-type="doi">10.1016/j.rser.2014.03.033</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tian</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>X.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Short-term wind speed combined prediction for wind farms based on wavelet transform</article-title>. <source>Trans. China Electrotech. Soc.</source> (<issue>9</issue>), <fpage>112</fpage>&#x2013;<lpage>120</lpage>. <pub-id pub-id-type="doi">10.19595/j.cnki.1000-6753.tces.2015.09.015</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Research on short-term power combination prediction method and evaluation of wind farm</article-title>,&#x201d;. <comment>Dissertation</comment> (<publisher-loc>Beijing, China</publisher-loc>: <publisher-name>North China Electric Power University</publisher-name>).</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Wind power fluctuation smooth strategy based on digital twin hybrid energy storage</article-title>. <source>Power Syst. Technol</source>, <fpage>2503</fpage>&#x2013;<lpage>2514</lpage>. <pub-id pub-id-type="doi">10.13335/j.1000-3673.pst.2021.0188</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>Yan</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Uncertainty of wind power forecasting and power system economic dispatch</article-title>,&#x201d;. <comment>Dissertation</comment> (<publisher-loc>Beijing, China</publisher-loc>: <publisher-name>North China Electric Power University</publisher-name>).</citation>
</ref>
<ref id="B19">
<citation citation-type="thesis">
<person-group person-group-type="author">
<name>
<surname>Yao</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Research on short-term wind power orediction based on auto-encoder and recurrent neural network</article-title>,&#x201d;. <comment>Dissertation</comment> (<publisher-loc>Fujian, China</publisher-loc>: <publisher-name>Overseas Chinese University</publisher-name>).</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yin</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Huang</surname>
<given-names>S. Q.</given-names>
</name>
<name>
<surname>Meng</surname>
<given-names>A. B.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Short-term wind power probability density prediction based on long short-term memory network quantile regression</article-title>. <source>J. Sol. Energy</source>, <fpage>150</fpage>&#x2013;<lpage>156</lpage>. <pub-id pub-id-type="doi">10.19912/j.0254-0096.tynxb.2018-0922</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>