Burning-through point multi-step prediction method based on target correlation space-time coding-task decoding

Abstract

The invention discloses a sintering end point multi-step prediction method based on target correlation space-time coding-task decoding. The method comprises the following steps: constructing a space-time encoder formed by stacking a plurality of space attention enhanced time sequence convolution modules; completely adaptive noise set empirical mode decomposition is carried out on a target value historical sequence, a screened internal mode function is input into a gated neural network and then passes through a full connection layer, and a result is input into a task specific decoder constructed by adopting a time attention mechanism; historical industrial process production data is preprocessed to train a prediction model composed of a space-time encoder and a task-specific decoder; and preprocessing real-time industrial process production data, and inputting the data into the trained prediction model to obtain a prediction result. According to the method, features can be effectively extracted from multiple levels, implicit information in historical data of target variables can be deeply mined, and the prediction capability of the model on the sintering end-point state is remarkably enhanced.

Description

Technical Field

[0001] The invention relates to the field of industrial process monitoring, and in particular to a multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding-task decoding. Background Art

[0002] In the sintering process of modern steel industry, accurate prediction of sintering endpoint is crucial to improve production efficiency and reduce energy consumption. The main challenge of sintering endpoint prediction lies in processing high-dimensional, nonlinear and dynamically changing data generated in the process. Traditional prediction methods, such as experience-based judgment and simple statistical models, often cannot effectively handle these complexities.

[0003] In recent years, deep learning methods have made significant progress in industrial process modeling. These methods, such as autoencoder (AE), deep belief network (DBN), convolutional neural network (CNN), recurrent neural network (RNN), transformer, etc., have demonstrated their powerful data processing and pattern recognition capabilities. In the industrial field, more and more deep learning-based models have been proposed for process detection or prediction. However, existing methods are still facing challenges in effectively extracting features from multiple levels. For example, in terms of how to more effectively mine the historical information of the target variable to enhance the ability of the prediction model, traditional deep learning methods usually ignore the rich information contained in the historical target data, which leads to the potential of the prediction model in terms of accuracy not being fully utilized. Summary of the invention

[0004] In view of the shortcomings of the prior art, the present invention proposes a multi-step prediction method for sintering endpoint based on target-related spatiotemporal encoding-task decoding.

[0005] The specific technical solutions are as follows:

[0006] A multi-step prediction method for sintering endpoint based on target-related spatiotemporal encoding-task decoding comprises the following steps:

[0007] S1: extracting historical industrial process production data within a period of time from the database of the sintering plant, performing data preprocessing on the data, and obtaining preprocessed historical industrial process production data;

[0008] S2: Construct a spatiotemporal encoder composed of multiple spatial attention enhanced temporal convolution modules stacked together. Each spatial attention enhanced temporal convolution module includes a causal dilation convolution module and a spatial attention module. The input x t The output of the latter is connected through a one-dimensional convolution residual; the causal expansion convolution stacking module has several layers, and the input data of each layer passes through the causal expansion convolution layer to obtain its temporal characteristics and expand the receptive field, and is activated by the nonlinear activation function layer after weight normalization, and then outputted through the discard layer, and finally the output feature map O of time step t is obtained. t ;O t Input the spatial attention module, after the global attention layer extracts the global information of each channel, input it into the first fully connected layer, activated by the PReLU function, and the result is input into the second fully connected layer, activated by the sigmoid function, and outputs the output feature map z after spatial attention adjustment t ;

[0009] S3: Perform fully adaptive noise set empirical mode decomposition on the historical sequence of target values ​​to obtain multiple intrinsic mode functions and a residual component; input the intrinsic mode functions with variance contribution ratio greater than the threshold into the gated neural network to extract time series features and generate a hidden state for each time point; input the hidden state into the fully connected layer and convert it into a dimension and format suitable for task-specific decoder processing;

[0010] S4: Build a task-specific decoder and use the temporal attention mechanism to adaptively extract relevant information from the entire spatiotemporal encoder output in each prediction step, capturing hidden states that are more closely related to the prediction target; use memory units with independent weights in the final output layer, and each prediction step has an independent set of parameters; and finally output multi-step prediction results;

[0011] S5: Use the preprocessed historical industrial process production data obtained in S1 to train the prediction model composed of the spatiotemporal encoder and the task-specific decoder to obtain a trained prediction model;

[0012] S6: Obtain real-time industrial process production data, pre-process it using the method of S1, and input it into the trained prediction model to obtain the prediction results.

[0013] Furthermore, the S1 is specifically implemented through the following sub-steps:

[0014] (1.1) Acquiring production data within a period of time from a time series database of a sintering plant as raw data, wherein the production data includes material variables and process variables;

[0015] (1.2) Use the isolation forest method to detect outliers in the original data. For abnormal data, execute step (1.3); for the remaining data, jump to step (1.4);

[0016] (1.3) Use local linear regression method to process abnormal data to maintain the continuity of time series data;

[0017] (1.4) Integrate the normal data and the data obtained in step (1.3), and use wavelet decomposition denoising technology to filter out the noise;

[0018] (1.5) Apply the sliding window method to the time series data obtained in step (1.4) to generate a set of time series data with a specific time step and prediction range, that is, the preprocessed historical production data.

[0019] Furthermore, in S2, the causal expansion convolution layer obtains the temporal feature F(t) in the input data through causal convolution, which is expressed as:

[0020]

[0021] In the formula, w represents the weight vector, x represents the input data, and w i represents the i-th component of w, x t-d*i represents the input data of the td*ith time step; k represents the convolution kernel size, t represents the current time step; d represents the expansion coefficient.

[0022] The calculation expression of the weight normalization layer is as follows:

[0023]

[0024] Where W′ represents the standardized weight, g represents the learnable scaling parameter, and W d represents the original dilated convolution weight, ||W d || represents the L2 norm of the original dilated convolution weights;

[0025] When the causal expansion convolution stack module has two layers, its input-output relationship expression is as follows:

[0026]

[0027] In the formula, represents the output feature map of the causal expansion stacking module at time step t, represents the input feature vector of the causal expansion stacking module at time step t, C is the number of channels, and T is the time step; * represents the causal expansion convolution operation; represents the normalized causal dilated convolution weight matrix of the first causal dilated convolution layer, represents the normalized causal dilated convolution weight matrix of the second causal dilated convolution layer; PReLU(·) represents the parameterized linear unit activation function; m1 and m2 are two randomly generated mask vectors used to implement the dropout operation; ⊙ represents the Hadamard product, which is used to apply the mask vector to the output of the causal dilated convolution layer.

[0028] Furthermore, in S2, the input of the spatial attention module is the output of the causal expansion convolution stack module O1, O t After the global information of each channel is extracted by the global attention layer, it is input into the first fully connected layer and activated by the PReLU function. The result is input into the second fully connected layer and activated by the sigmoid function. The output feature map after spatial attention adjustment is output. The expression is as follows:

[0029]

[0030] z t =O t ⊙σ(W2PReLU(W1I));

[0031] In the formula, represents the global information of each channel c, c = 1, 2, 3, ..., C, C is the number of channels; O t，c represents the output of the causal expansion convolution stack module at channel c; T is the time step, I represents a vector with C dimensions, and the value corresponding to each dimension is I c ; W1 represents the weight matrix of the first fully connected layer, W2 represents the weight matrix of the second fully connected layer; σ represents the sigmoid activation function.

[0032] Furthermore, in S2, the expression for the connection between the input of the causal expansion convolution module and the output of the spatial attention module through the one-dimensional convolution residual is as follows:

[0033]

[0034]

[0035] In the formula, represents the output feature map after 1×1 convolution, W 1*1 represents the weight matrix of 1×1 convolution, represents the input feature vector of the causal expansion stacking module at time step t, C is the number of channels, and T is the time step; represents the bias vector of 1×1 convolution, Represents the final output feature map of the temporal convolution module with spatial attention enhancement, that is, the output of the temporal convolution module with spatial attention enhancement for all C channels at time step t.

[0036] Furthermore, in S3, the expression for performing fully adaptive noise set empirical mode decomposition on the target value history sequence is as follows:

[0037]

[0038] In the formula, y represents the historical sequence of target values, represents the pth intrinsic mode function, M is the total number of intrinsic mode functions obtained by the fully adaptive noise ensemble empirical mode decomposition, and R(t) represents the residual component;

[0039] The expression of the variance contribution ratio is as follows:

[0040]

[0041] In the formula, represents the variance of the pth intrinsic mode function, and Var(y) represents the total variance of the target sequence y.

[0042] Furthermore, in S3, the final hidden state ψ output by the gated neural network Q The input is a fully connected layer, which is linearly transformed and a nonlinear activation function is added to generate a new feature representation; the output of the fully connected layer is used as the initial state of the task-specific decoder, which includes an initial hidden state and initial cell state The intrinsic mode function of the input gated neural network is embedded in each gated neural network unit. and In this approach, the intrinsic modality is transformed into a dimension and format suitable for processing by a task-specific decoder.

[0043] Further, the S4 is specifically as follows:

[0044] The context feature matrix S output by the spatiotemporal encoder is t , divided into T context vectors s from the time dimension t+T+1 ,s t-T+2 ,…,s t , these context vectors are input one-to-one into each time step of the task-specific decoder, where corresponds to the input to the task-specific decoder s t-T+k In time step;

[0045] The temporal attention value of the hidden state of each task-specific decoder at time step t is expressed as follows:

[0046]

[0047]

[0048] In the formula, represents the temporal attention value of the k-th context vector at time step t, is the overall weight matrix, tanh represents the hyperbolic tangent activation function; c t-1 The weight matrix, c t-1 represents the hidden state of the task-specific decoder at time step t-1; For t-T+k The weight matrix, s t-T+k represents the output of the spatiotemporal encoder at time step t-T+k; is the bias term; express The weight value after softmax normalization at the same time step t, N represents the maximum prediction step length;

[0049] The input θ for each prediction step t It is calculated by weighing the state variables of the corresponding step and the output of all time steps of the spatiotemporal encoder part, and is combined with the predicted label y of the previous time step before being input into the memory unit. t-1 Splicing, the expression is as follows:

[0050]

[0051] θ t =concatenate(u t ,y t-1 );

[0052] The independent weight memory units in the task-specific decoder generate the final multi-step prediction results as follows:

[0053]

[0054]

[0055]

[0056]

[0057]

[0058]

[0059]

[0060] In the formula, represents the forget gate of the mth memory unit at time step t, The weight matrix representing the input data of the forget gate, The weight matrix representing the hidden state of the previous memory unit of the forget gate, Represents the bias term of the forget gate; represents the input gate of the mth memory unit at time step t, The weight matrix representing the input data of the input gate, The weight matrix representing the hidden state of the previous memory cell of the input gate, represents the bias term of the input gate; represents the candidate cell state of the mth memory unit at time step t, The weight matrix representing the input data of the candidate cell states, The weight matrix representing the previous hidden state of the candidate cell state, A bias term representing the candidate cell state; represents the cell state of the mth memory unit at time step t, represents the cell state of the mth memory unit at time step t-1; o m t represents the output gate of the mth memory unit at time step t, The weight matrix representing the input data of the output gate, The weight matrix representing the hidden state of the previous memory unit of the output gate, represents the bias term of the output gate; h t represents the hidden state of the last memory unit at time step t, c t represents the cell state of the last memory unit of the decoder at time step t; represents the prediction result of the last memory unit at time step t; FC represents the fully connected layer, and each memory unit outputs h t After the fully connected layer, the predicted value corresponding to the prediction step length is finally obtained

[0061] A multi-step prediction device for sintering endpoint based on target-related spatiotemporal coding-task decoding comprises a memory and one or more processors, wherein the memory stores executable codes, and when the one or more processors execute the executable codes, they are used to implement the multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding-task decoding.

[0062] A computer-readable storage medium stores a program, which, when executed by a processor, implements the multi-step prediction method for sintering end point based on target-related spatiotemporal coding-task decoding.

[0063] The beneficial effects of the present invention are:

[0064] The present invention obtains the temporal features of historical data through causal dilation convolution and captures the correlation of temporal features over a long period of time; more accurately captures and emphasizes feature information that contributes more to the prediction target through the spatial attention mechanism, and adds residual connections to solve the gradient vanishing problem of deep networks; stacks multiple temporal convolution layers with spatial attention enhancement through a spatiotemporal encoder to capture dependencies on different time scales from short-term to long-term; integrates the temporal module output of the fully adaptive noise set empirical mode decomposition as the starting state of the task-specific decoder, deeply mines the implicit information in the historical data of the target variable, and significantly enhances the model's prediction ability for the sintering endpoint state; adopts the temporal attention mechanism to adaptively extract relevant information of the encoder output in each prediction step, thereby capturing hidden states that are more closely related to the prediction target and outputting more accurate multi-step prediction results. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] Figure 1 It is a flow chart of a multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding-task decoding in an embodiment of the present invention.

[0066] Figure 2 4 is a flow chart of data preprocessing in an embodiment of the present invention.

[0067] Figure 3 It is a structural diagram of a temporal convolution module for spatial attention enhancement in an embodiment of the present invention.

[0068] Figure 4 It is a flow chart of extracting relevant information in a historical target sequence based on fully adaptive noise set empirical mode decomposition and gated neural network in an embodiment of the present invention.

[0069] Figure 5 It is a structural schematic diagram of a sintering endpoint multi-step prediction device based on target-related spatiotemporal coding-task decoding in an embodiment of the present invention. DETAILED DESCRIPTION

[0070] The present invention will be described in detail below according to the accompanying drawings and preferred embodiments, and the purpose and effect of the present invention will become more clear. The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0071] like Figure 1 As shown, a multi-step prediction method for sintering endpoint based on target-related spatiotemporal encoding-task decoding includes the following steps:

[0072] S1: Extract historical industrial process production data within a period of time from the database of the sintering plant, perform data preprocessing on these data, and obtain preprocessed historical production data. Figure 2The specific implementation process is as follows:

[0073] (1.1) Sensors collect production data during the sintering process and transmit them to the time series database through a programmable logic controller. The production data within a period of time is obtained from the time series database of the sintering plant as the original data. The production data includes material variables (such as iron ore mixing ratio, quicklime ratio, etc.) and process variables (such as ignition temperature, material layer thickness, etc.).

[0074] (1.2) Use the isolation forest method to detect outliers in the original data to identify and isolate abnormal data that may affect the performance of the model. For abnormal data, execute step (1.3); for the rest of the data, jump to step (1.4) for execution.

[0075] (1.3) The local linear regression method is used to process abnormal data to maintain the continuity of time series data.

[0076] (1.4) Integrate the normal data and the data obtained in step (1.3) and use wavelet decomposition denoising technology to filter out the noise in the data. This step helps to preserve the main structure of the data while minimizing the impact of random noise.

[0077] (1.5) Apply the sliding window method to the time series data obtained in step (1.4) to generate a set of time series data with a specific time step and prediction range, i.e., the preprocessed historical production data, which is used for the subsequent training, verification and testing of the prediction model.

[0078] S2: Construct a spatiotemporal encoder. The spatiotemporal encoder is obtained by stacking multiple temporal convolutional modules with spatial attention enhancement, so that the model can capture dependencies on different time scales from short-term to long-term, and improve the prediction performance of sequence tasks. In this embodiment, there are six temporal convolutional modules with spatial attention enhancement.

[0079] like Figure 3 As shown in the figure, the temporal convolution module with spatial attention enhancement includes: a causal expansion convolution stacking module and a spatial attention module, whose input and output are connected by a one-dimensional convolution residual. The temporal convolution module with spatial attention enhancement can more accurately capture and emphasize feature information that contributes more to the prediction target through the spatial attention mechanism, and solve the gradient vanishing problem of deep networks through residual connections. The architecture of the temporal convolution module with spatial attention enhancement is described in three parts below.

[0080] (1) The causal expansion convolution stack module has several layers (two layers in this embodiment), each of which includes: a causal expansion convolution layer, a weight normalization layer, a nonlinear activation function layer (specifically the PReLU function in this embodiment) and a dropout layer.

[0081] The causal dilated convolution layer obtains the temporal features of the preprocessed historical production data through causal convolution, expands the receptive field through dilated convolution, and captures the correlation of temporal features over a longer time range. By combining dilated convolution with causal convolution, the causal dilated convolution formed can cover longer input sequences without increasing parameters.

[0082] Specifically, the temporal feature F(t) in the preprocessed data is obtained through causal convolution, and its expression is as follows:

[0083]

[0084] In the formula, w represents the weight vector, x represents the input time series data (preprocessed data), and w i represents the i-th component of w, x t-d*i represents the input data of the td*ith time step; k represents the size of the convolution kernel, t represents the current time step; d represents the dilation coefficient, which determines the distance between adjacent elements in the convolution kernel. In the dilated convolution, this distance expands exponentially with the increase in the number of layers.

[0085] The calculation expression of the weight normalization layer is as follows:

[0086]

[0087] Where W′ represents the standardized weight, g represents the learnable scaling parameter, and W d represents the original dilated convolution weight, ‖W d ‖ represents the L2 norm of the original dilated convolution weights.

[0088] The input-output relationship expression of the two-layer stacked causal expansion convolution stack module is as follows:

[0089]

[0090] In the formula, represents the output feature map of the causal expansion stacking module at time step t, represents the input feature vector of the causal expansion stacking module at time step t, C is the number of channels, and T is the time step; * represents the causal expansion convolution operation; represents the normalized causal expansion convolution weight matrix of the first causal expansion convolution layer, represents the normalized causal dilated convolution weight matrix of the second causal dilated convolution layer; PReLU(·) represents the parameterized linear unit activation function; m1 and m2 are two randomly generated mask vectors used to implement the dropout operation; ⊙ represents the Hadamard product, which is used to apply the mask vector to the output of the causal dilated convolution layer.

[0091] (2) The spatial attention module includes: global attention layer, fully connected layer, PReLU activation function and sigmoid activation function. The output of the causal expansion convolution stack module is t , after the global attention layer extracts the global information of each channel, it is input into the first fully connected layer and activated by the PReLU function. The result is input into the second fully connected layer and activated by the sigmoid function. The output feature map after spatial attention adjustment is output. Its expression is as follows:

[0092]

[0093] z t =O t ⊙σ(W2PReLU(W1I))

[0094] In the formula, Represents the global information of each channel c, c = 1, 2, 3, ..., C; O t,c represents the output of the causal expansion convolution stack module at channel c; represents the output feature map after spatial attention adjustment, I represents a vector with C dimensions, and the value corresponding to each dimension is I c ; W1 represents the weight matrix of the first fully connected layer, W2 represents the weight matrix of the second fully connected layer; σ represents the sigmoid activation function.

[0095] (3) The expression of the convolution residual connection between the input and output of the temporal convolution module with spatial attention enhancement is as follows:

[0096]

[0097]

[0098] In the formula, represents the output feature map after 1×1 convolution, W 1*1 represents the weight matrix of 1×1 convolution, represents the bias vector of 1×1 convolution, Represents the final output feature map of the temporal convolution module with spatial attention enhancement, that is, the output of the temporal convolution module with spatial attention enhancement for all C channels at time step t.

[0099] When six spatial attention-enhanced temporal convolutional modules are stacked to form a spatiotemporal encoder, a single spatial attention-enhanced temporal convolutional module uses a 1D kernel to perform convolution operations in the time dimension, and the number of channels increases from 12 to 40, 80, and 160 to capture finer-grained features, and then decreases to 160, 80, and 40 to form the encoder output. This multi-scale design enables the spatiotemporal encoder to capture dependencies at different time scales from short-term to long-term, improving the prediction performance of sequence tasks.

[0100] Define a set representing different number of channels in Represents the number of channels of each spatial attention-enhanced temporal convolution module in the spatiotemporal encoder. The output of the entire spatiotemporal encoder can be expressed as:

[0101]

[0102] In the formula, represents the stacking operation, which is used to stack the output of each spatial attention-enhanced temporal convolution module along the channel dimension to form the final output of the spatiotemporal encoder; represents the output of the temporal convolutional module with spatial attention enhancement of c channels at time step t; represents the output of the spatiotemporal encoder at time step t, C ′ is the final number of channels output by the spatiotemporal encoder.

[0103] Through this structure, the spatiotemporal encoder effectively integrates long-term dependencies and spatial attention mechanisms, providing the prediction model with rich and effective spatiotemporal feature representations, thereby significantly improving the performance of multi-step prediction tasks.

[0104] S3: Figure 4 As shown, the target value history sequence y is subjected to fully adaptive noise set empirical mode decomposition to obtain M intrinsic mode functions and one residual component, which is expressed as follows:

[0105]

[0106] In the formula, represents the pth intrinsic mode function, and R(t) represents the residual component.

[0107] The more critical intrinsic mode functions are screened out according to the threshold, and the gated neural network is used to extract the time series features from them. The specific implementation process is as follows:

[0108] For each intrinsic mode function, calculate its variance contribution ratio:

[0109]

[0110] In the formula, represents the variance of the pth intrinsic mode function, and Var(y) represents the total variance of the target sequence y.

[0111] The calculation of the variance contribution ratio provides a method to quantify the contribution of each intrinsic mode function to the overall target sequence variation. The reason for choosing the variance contribution ratio as the screening criterion is that it can effectively identify the intrinsic mode function that has the greatest influence on the prediction task. Specifically, by setting a predetermined threshold ∈ to filter the intrinsic mode function, only when the variance contribution ratio of the intrinsic mode function exceeds this threshold will it be retained for subsequent predictive modeling, and the remaining intrinsic modes will be screened out. The importance of this screening process is that it helps the model focus on those components that are most critical to the prediction, thereby improving the accuracy and efficiency of the prediction. The expression for this screening is as follows:

[0112] ρ=|{p:ρ p >∈}|

[0113] The important intrinsic mode functions obtained by screening are input into the gated neural network to extract the key time features. The gated neural network is a special type of recurrent neural network, which is particularly suitable for processing time series data because it can effectively capture the long-term dependencies in the sequence data.

[0114] Specifically, the gated neural network generates a hidden state for each time point through a series of computational steps. These hidden states capture the important features and patterns of the input sequence at different time points. For the prediction task, the last Q-th hidden state of the gated neural network is denoted by ψ Q , which is the final hidden state obtained after processing the entire intrinsic mode function sequence. The following are the calculation steps of the gated neural network:

[0115] Z q =σ(W z ·[ψ q-1 , IMF q ]+b z )

[0116] r q =σ(W r ·[ψ q-1 , IMF q ]+b r )

[0117]

[0118]

[0119] In the formula, z qrepresents the update gate of the qth memory unit, which determines how much past information is retained in the hidden state; r q Represents the reset gate of the qth memory unit, q = 1, 2, 3, ..., Q. This parameter affects the amount of historical information retained; Represents the candidate hidden state of the qth memory unit, which contains the current input IMF q and information about past hidden states; ψ q represents the final hidden state of the qth memory unit, which combines historical information and current input; W z represents the weight matrix of the update gate, W r represents the weight matrix of the reset gate, W h represents the weight matrix for calculating the hidden state, b z represents the bias term of the update gate, b r represents the bias term of the reset gate, b h Represents the bias term for calculating the hidden state.

[0120] After processing the entire intrinsic mode function sequence, the final hidden state ψ output by the gated neural network is Q It contains comprehensive information of all important intrinsic mode functions, providing key contextual information for subsequent prediction steps. This hidden state contains not only information of the current time step, but also information of all previous time steps, thus capturing the dynamic changes of historical data.

[0121] The final hidden state ψ of the gated neural network Q The input is a fully connected layer that converts the information contained in it into a dimension and format suitable for processing by the task-specific decoder. The specific implementation process is as follows:

[0122] The fully connected layer pair ψ Q Perform linear changes and add nonlinear activation functions to generate new feature representations. The output of the fully connected layer is used as the initial state of the task-specific decoder, which includes the initial hidden state and initial cell state The conversion process can be expressed by the following formula:

[0123]

[0124] In the formula, FC represents the fully connected layer function, and ψ represents the sequence from the target value history to the initial hidden state. and initial cell state The function mapping includes the above-mentioned fully adaptive noise set empirical mode decomposition, modal function screening, gated neural network processing, and fully connected layer linear transformation operations. yt represents the tth value in the historical sequence of target values.

[0125] At the first time step t = t0 = 0, these key intrinsic modal functions are embedded into the initial hidden states of the memory cells of the task-specific decoder and cell status In the subsequent time step t ≥ t0, decoding is performed according to the method of S4.

[0126] S4: Build a task-specific decoder and use the temporal attention mechanism to adaptively extract relevant information from the entire spatiotemporal encoder output in each prediction step, thereby capturing hidden states that are more closely related to the prediction target and outputting more accurate multi-step prediction results. The specific implementation process is as follows:

[0127] A temporal attention mechanism is used to adaptively extract relevant information of the entire spatiotemporal encoder output in each prediction step, thereby capturing hidden states that are more closely related to the prediction target. Memory units with independent weights are used in the final output layer, and each prediction step has an independent set of parameters, so that the prediction model can more effectively learn and adapt to the specific features of each prediction step.

[0128] Using M t represents the context feature matrix from the spatiotemporal encoder (i.e., the output of the last temporal convolutional module), M t It can be divided into T context vectors s from the time dimension t-T+1 ,s t-T+2 , ..., s t , these context vectors are input one-to-one into each time step of the task-specific decoder, where corresponds to the input to the task-specific decoder s t-T+k In order to effectively capture the temporal patterns associated with each prediction step, we first compute the temporal attention value of the hidden state of each task-specific decoder at time step t:

[0129]

[0130]

[0131] Where N represents the maximum prediction step size, represents the temporal attention value of the k-th context vector at time step t, is the overall weight matrix; c t-1 The weight matrix, c t-1 represents the hidden state of the task-specific decoder at time step t-1; For t-T+k The weight matrix, s t-T+k represents the output of the spatiotemporal encoder at time step t-T+k; is the bias term, tanh represents the hyperbolic tangent activation function; express The weight value after softmax normalization at the same time step t.

[0132] The input θ for each prediction step t It is calculated by weighing the state variables of the corresponding step and the output of all time steps of the spatiotemporal encoder part, and is combined with the predicted label y of the previous time step before being input into the memory unit. t-1 Splicing, the expression is as follows:

[0133]

[0134] θ t =concatenate(u t ,y t-1 )

[0135] The independent weight memory units in the task-specific decoder generate the final multi-step prediction results as follows:

[0136]

[0137]

[0138]

[0139]

[0140]

[0141]

[0142]

[0143] In the formula, represents the forget gate of the mth memory unit at time step t, The weight matrix representing the input data of the forget gate, The weight matrix representing the hidden state of the previous memory unit of the forget gate, Represents the bias term of the forget gate; represents the input gate of the mth memory unit at time step t, The weight matrix representing the input data of the input gate, The weight matrix representing the hidden state of the previous memory cell of the input gate, represents the bias term of the input gate; represents the candidate cell state of the mth memory unit at time step t, The weight matrix representing the input data of the candidate cell states, The weight matrix representing the previous hidden state of the candidate cell state, A bias term representing the candidate cell state; represents the cell state of the mth memory unit at time step t, represents the cell state of the mth memory unit at time step t-1; o m t represents the output gate of the mth memory unit at time step t, The weight matrix representing the input data of the output gate, The weight matrix representing the hidden state of the previous memory unit of the output gate, represents the bias term of the output gate; h t represents the hidden state of the last memory unit at time step t, c t represents the cell state of the last memory unit of the decoder at time step t; represents the prediction result of the last memory unit at time step t; FC represents the fully connected layer, and each memory unit outputs h t After the fully connected layer, the predicted value corresponding to the prediction step length is finally obtained

[0144] S5: Use the data from S1 to train the prediction model consisting of the spatiotemporal encoder and the task-specific decoder to obtain a trained prediction model.

[0145] S6: Obtain real-time industrial process production data, pre-process it using the method of S1, and input it into the trained prediction model to obtain the prediction results.

[0146] like Figure 5 As shown, an embodiment of the present invention provides a multi-step prediction device for a sintering endpoint based on spatiotemporal coding-task decoding on the basis of a multi-step prediction method for a sintering endpoint based on target-related spatiotemporal coding-task decoding. The device includes a memory and one or more processors. The memory stores executable codes. When the one or more processors execute the executable codes, they are used to implement the multi-step prediction method for a sintering endpoint based on target-related spatiotemporal coding-task decoding in the above embodiment.

[0147] The multi-step prediction device for sintering endpoint based on spatiotemporal coding-task decoding can be applied to any device with data processing capability, and the device with data processing capability can be a computer or other device. The multi-step prediction device for sintering endpoint based on spatiotemporal coding-task decoding can be implemented by software, or by hardware or a combination of software and hardware. Taking software implementation as an example, as a device in a logical sense, it is formed by the processor of any device with data processing capability, which reads the corresponding computer program instructions in the non-volatile memory into the internal memory and runs them. From the hardware level, if Figure 5 As shown in the figure, it is a hardware structure diagram of a sintering end point multi-step prediction device based on spatiotemporal coding-task decoding of the present invention, in which any device with data processing capability is located, except Figure 5 In addition to the processor, memory, network interface, and non-volatile memory shown, any device with data processing capabilities in which the apparatus of the present invention is located in the embodiments may also include other hardware, which will not be described in detail herein, based on the actual functions of the device with data processing capabilities.

[0148] The implementation process of the functions and effects of each unit in the above-mentioned device is specifically described in the implementation process of the corresponding steps in the above-mentioned method, and will not be repeated here.

[0149] For the device embodiment, since it basically corresponds to the method embodiment, the relevant parts can refer to the partial description of the method embodiment. The device embodiment described above is only exemplary, and the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the present invention. Ordinary technicians in this field can understand and implement it without paying creative work.

[0150] An embodiment of the present invention further provides a computer-readable storage medium having a program stored thereon. When the program is executed by a processor, the multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding-task decoding in the above embodiment is implemented.

[0151] The computer-readable storage medium may be an internal storage unit of any device with data processing capability in any of the aforementioned embodiments, such as a hard disk or a memory. The computer-readable storage medium may also be an external storage device of any device with data processing capability, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), an SD card, a flash card (Flash Card), etc. equipped on the device. Furthermore, the computer-readable storage medium may also include both an internal storage unit and an external storage device of any device with data processing capability. The computer-readable storage medium is used to store computer programs and other programs and data required by any device with data processing capability, and may also be used to temporarily store data that has been output or is to be output.

[0152] The following is a specific industrial case of a sintering process to verify the effectiveness of the present invention. The data of this case was obtained from a sintering plant between December 8 and December 29, 2021, with a collection interval of one minute. Six input features are selected from the material variables and process variables in the sintering plant database, for a total of 12 feature input variables (ie, the number of channels C = 12). After preprocessing the original data, 31,049 data were obtained, the time step was set to 60 time steps (ie, T = 60), and the prediction range was 7 steps (ie, the maximum prediction step N = 7). The data set is divided into a training set, a validation set, and a test set in chronological order, where the training set contains the first 24,839 data, the validation set contains the next 3,104 data, and the last 3,106 data are assigned to the test set. The training set and validation set are used to train the prediction model, and the test set is used as an online sample to detect the model training effect.

[0153] In order to illustrate the prediction effect of the method of the present invention, other existing prediction methods are also used for prediction. The models used for comparison include: AutoRegressive Integrated MovingAverage (ARIMA), Long Short Term Memory (LSTM), Long-and Short-term Time-series network (LSTNet), and Time Attention-Long Short Term Memory (TA-LSTM). Model evaluation indicators include root mean square error (RMSE), coefficient of determination (TSD), and ) and Mean Absolute Percentage Error (MAPE). The prediction effects of each model on online samples (test set data) are shown in Table 1:

[0154] Table 1 Comparison of multi-step prediction effects of various methods on real sintering datasets

[0155]

[0156] It can be seen from the results in Table 1 that the present invention shows the highest performance in all evaluation indicators, and the prediction accuracy of the 7th step and the average is significantly higher than that of other methods, thereby confirming the effectiveness and superiority of the present invention in predicting the multi-step sintering endpoint.

[0157] Those skilled in the art can understand that the above are only preferred examples of the invention and are not intended to limit the invention. Although the invention is described in detail with reference to the above examples, those skilled in the art can still modify the technical solutions recorded in the above examples or replace some of the technical features therein with equivalents. Any modification, equivalent replacement, etc. made within the spirit and principle of the invention shall be included in the protection scope of the invention.

Claims

1. A multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding-task decoding, characterized in that: The following steps are involved: S1: extracting historical industrial process production data within a period of time from the database of the sintering plant, performing data preprocessing on the data, and obtaining preprocessed historical industrial process production data; S2: Construct a spatiotemporal encoder composed of multiple spatial attention enhanced temporal convolution modules stacked together. Each spatial attention enhanced temporal convolution module includes a causal dilation convolution module and a spatial attention module. The input x t The output of the latter is connected through a one-dimensional convolution residual; the causal expansion convolution stacking module has several layers, and the input data of each layer passes through the causal expansion convolution layer to obtain its temporal characteristics and expand the receptive field, and is activated by the nonlinear activation function layer after weight normalization, and then outputted through the discard layer, and finally the output feature map O of time step t is obtained. t ;O t Input the spatial attention module, after the global attention layer extracts the global information of each channel, input it into the first fully connected layer, activated by the PReLU function, and the result is input into the second fully connected layer, activated by the sigmoid function, and outputs the output feature map z after spatial attention adjustment t ; S3: Perform fully adaptive noise set empirical mode decomposition on the historical sequence of target values ​​to obtain multiple intrinsic mode functions and a residual component; input the intrinsic mode functions with variance contribution ratio greater than the threshold into the gated neural network to extract time series features and generate a hidden state for each time point; input the hidden state into the fully connected layer and convert it into a dimension and format suitable for task-specific decoder processing; S4: Build a task-specific decoder and use the temporal attention mechanism to adaptively extract relevant information of the entire spatiotemporal encoder output in each prediction step to capture hidden states that are more closely related to the predicted target; In the final output layer, memory units with independent weights are used, and each prediction step has an independent set of parameters; the multi-step prediction results are finally output; S5: Use the preprocessed historical industrial process production data obtained in S1 to train the prediction model composed of the spatiotemporal encoder and the task-specific decoder to obtain a trained prediction model; S6: Obtain real-time industrial process production data, pre-process it using the method of S1, and input it into the trained prediction model to obtain the prediction results.

2. The multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding-task decoding according to claim 1 is characterized in that: The S1 is specifically implemented through the following sub-steps: (1.1) Acquiring production data within a period of time from a time series database of a sintering plant as raw data, wherein the production data includes material variables and process variables; (1.2) Use the isolation forest method to detect outliers in the original data. For abnormal data, execute step (1.3); for the remaining data, jump to step (1.4); (1.3) Use local linear regression method to process abnormal data to maintain the continuity of time series data; (1.4) Integrate the normal data and the data obtained in step (1.3), and use wavelet decomposition denoising technology to filter out the noise; (1.5) Apply the sliding window method to the time series data obtained in step (1.4) to generate a set of time series data with a specific time step and prediction range, that is, the preprocessed historical production data.

3. The multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding and task decoding according to claim 1 is characterized in that: In S2, the causal expansion convolution layer obtains the temporal feature F(t) in the input data through causal convolution, which is expressed as: In the formula, w represents the weight vector, x represents the input data, and w i represents the i-th component of w, x t-d*i represents the input data of the td*ith time step; k represents the convolution kernel size, t represents the current time step; d represents the expansion coefficient. The calculation expression of the weight normalization layer is as follows: Where W′ represents the standardized weight, g represents the learnable scaling parameter, and W d represents the original dilated convolution weight, ||W d || represents the L2 norm of the original dilated convolution weights; When the causal expansion convolution stack module has two layers, its input-output relationship expression is as follows: In the formula, represents the output feature map of the causal expansion stacking module at time step t, represents the input feature vector of the causal expansion stacking module at time step t, C is the number of channels, and T is the time step; * represents the causal expansion convolution operation; represents the normalized causal dilated convolution weight matrix of the first causal dilated convolution layer, represents the normalized causal dilated convolution weight matrix of the second causal dilated convolution layer; PReLU(·) represents the parameterized linear unit activation function; m1 and m2 are two randomly generated mask vectors used to implement the dropout operation; ⊙ represents the Hadamard product, which is used to apply the mask vector to the output of the causal dilated convolution layer.

4. The multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding and task decoding according to claim 1 is characterized in that: In S2, the input of the spatial attention module is the output of the causal expansion convolution stack module O t , O t After the global information of each channel is extracted by the global attention layer, it is input into the first fully connected layer and activated by the PReLU function. The result is input into the second fully connected layer and activated by the sigmoid function. The output feature map after spatial attention adjustment is output. The expression is as follows: z t =O t ⊙ σ(W2PReLU(W11)); In the formula, represents the global information of each channel c, c = 1, 2, 3, ..., C, C is the number of channels; O t，c represents the output of the causal expansion convolution stack module at channel c; T is the time step, I represents a vector with C dimensions, and the value corresponding to each dimension is I c ; W1 represents the weight matrix of the first fully connected layer, W2 represents the weight matrix of the second fully connected layer; σ represents the sigmoid activation function.

5. The multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding and task decoding according to claim 1 is characterized in that: In S2, the expression of the one-dimensional convolution residual connection between the input of the causal expansion convolution module and the output of the spatial attention module is as follows: In the formula, represents the output feature map after 1×1 convolution, W 1*1 represents the weight matrix of 1×1 convolution, represents the input feature vector of the causal expansion stacking module at time step t, C is the number of channels, and T is the time step; represents the bias vector of 1×1 convolution, Represents the final output feature map of the temporal convolution module with spatial attention enhancement, that is, the output of the temporal convolution module with spatial attention enhancement for all C channels at time step t.

6. The multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding and task decoding according to claim 1 is characterized in that: In S3, the expression for performing fully adaptive noise set empirical mode decomposition on the target value history sequence is as follows: In the formula, y represents the historical sequence of target values, represents the pth intrinsic mode function, M is the total number of intrinsic mode functions obtained by the fully adaptive noise ensemble empirical mode decomposition, and R(t) represents the residual component; The expression of the variance contribution ratio is as follows: In the formula, represents the variance of the pth intrinsic mode function, and Var(y) represents the total variance of the target sequence y.

7. The multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding and task decoding according to claim 1 is characterized in that: In S3, the final hidden state ψ output by the gated neural network Q The input is a fully connected layer, which is linearly transformed and a nonlinear activation function is added to generate a new feature representation; the output of the fully connected layer is used as the initial state of the task-specific decoder, which includes an initial hidden state and initial cell state The intrinsic mode function of the input gated neural network is embedded in each gated neural network unit. and In this approach, the intrinsic modality is transformed into a dimension and format suitable for processing by a task-specific decoder.

8. The multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding and task decoding according to claim 1 is characterized in that: The S4 is specifically as follows: The context feature matrix S output by the spatiotemporal encoder is t , divided into T context vectors s from the time dimension t-T+1 ,s t-T+2 , ..., s t , these context vectors are input one-to-one into each time step of the task-specific decoder, where corresponds to the input to the task-specific decoder s t-T+k In time step; The temporal attention value of the hidden state of each task-specific decoder at time step t is expressed as follows: In the formula, represents the temporal attention value of the k-th context vector at time step t, is the overall weight matrix, tanh represents the hyperbolic tangent activation function; c t-1 The weight matrix, c t-1 represents the hidden state of the task-specific decoder at time step t-1; For t-T+k The weight matrix, s t-T+k represents the output of the spatiotemporal encoder at time step t-T+k; is the bias term; express The weight value after softmax normalization at the same time step t, N represents the maximum prediction step length; The input θ for each prediction step t It is calculated by weighing the state variables of the corresponding step and the output of all time steps of the spatiotemporal encoder part, and is combined with the predicted label y of the previous time step before being input into the memory unit. t-1 Splicing, the expression is as follows: θ t =concatenate(u t ,y t-1 ); The independent weight memory units in the task-specific decoder generate the final multi-step prediction results as follows: In the formula, represents the forget gate of the mth memory unit at time step t, The weight matrix representing the input data of the forget gate, The weight matrix representing the hidden state of the previous memory unit of the forget gate, Represents the bias term of the forget gate; represents the input gate of the mth memory unit at time step t, The weight matrix representing the input data of the input gate, The weight matrix representing the hidden state of the previous memory cell of the input gate, represents the bias term of the input gate; represents the candidate cell state of the mth memory unit at time step t, The weight matrix representing the input data of the candidate cell states, The weight matrix representing the previous hidden state of the candidate cell state, A bias term representing the candidate cell state; represents the cell state of the mth memory unit at time step t, represents the cell state of the mth memory unit at time step t-1; o m t represents the output gate of the mth memory unit at time step t, The weight matrix representing the input data of the output gate, The weight matrix representing the hidden state of the previous memory unit of the output gate, represents the bias term of the output gate; h t represents the hidden state of the last memory unit at time step t, c t represents the cell state of the last memory unit of the decoder at time step t; represents the prediction result of the last memory unit at time step t; FC represents the fully connected layer, and each memory unit outputs h t After the fully connected layer, the predicted value corresponding to the prediction step length is finally obtained 9. A multi-step prediction device for sintering endpoint based on target-related spatiotemporal coding-task decoding, characterized in that: The method comprises a memory and one or more processors, wherein the memory stores executable codes, and when the one or more processors execute the executable codes, the method is used to implement the multi-step prediction method for sintering endpoint based on target-related spatiotemporal coding-task decoding as claimed in any one of claims 1 to 8.

10. A computer-readable storage medium, characterized in that: A program is stored thereon, and when the program is executed by a processor, the multi-step prediction method for sintering end point based on target-related spatiotemporal coding-task decoding as claimed in any one of claims 1 to 8 is implemented.

Images