An HPO (Hunter–Prey Optimizer)-optimized Bidirectional LSTM (HPO-BiLSTM) model is introduced to address the challenges in predicting gas concentration within coal mining working faces. This study aims to adaptively adjust the key hyperparameters (such as learning rate and number of hidden layer units) of the BiLSTM network through intelligent optimization algorithms. While the BiLSTM architecture inherently mitigates gradient vanishing and exploding problems through its gating mechanisms, the proposed HPO method focuses on addressing the inefficiency of manual parameter tuning and the risk of trapping in local optima that traditional methods encounter when dealing with nonlinear and non-stationary gas concentration time series. The experiment utilized the actual methane monitoring data from the 15117 working face of Jishazhuang Coal Mine in Jinzhong City, Shanxi Province (with a sampling interval of 2 min). The proposed HPO-BiLSTM model was compared with baseline models such as LSTM, BiLSTM, GA-BiLSTM, and PSO-BiLSTM in terms of performance. This study systematically compares the performance of LSTM, BiLSTM, and BiLSTM models optimized with GA, PSO, and HPO. Results demonstrate that all optimized models outperform the baselines, with HPO-BiLSTM achieving the best overall performance. It attained the lowest RMSE and highest R2 across the training, validation, and test sets, showcasing superior fitting and generalization capabilities. Furthermore, HPO-BiLSTM converged to the lowest loss value (0.00062) in only 15 iterations, demonstrating significantly greater efficiency and stability than both GA-BiLSTM (loss 0.00072, 25 iterations) and PSO-BiLSTM (loss 0.00071, 30 iterations). The experiments confirm that the HPO algorithm effectively configures BiLSTM hyperparameters, mitigates overfitting, and provides a more accurate and robust solution for gas concentration prediction in coal mines.
Building similarity graph...
Analyzing shared references across papers
Loading...
Xiaoliang Zheng
Liang Wang
Lei Zhang
Building similarity graph...
Analyzing shared references across papers
Loading...
Zheng et al. (Sun,) studied this question.
www.synapsesocial.com/papers/69a67ec3f353c071a6f0a2cd — DOI: https://doi.org/10.3390/eng7030112