Abstract

Efficient evacuation route planning during underground coal mine fires is essential to minimize casualties. This study addresses current shortcomings by proposing a real-time method that integrates a multifactor coupling analysis and the optimized multilayer perceptron regressor-shortest path faster algorithm (MSPFA). This research aims to enhance evacuation route planning by overcoming factors such as inadequate consideration, low accuracy, and information lag in existing methods. This study improves the shortest path faster algorithm (SPFA) for dynamic route planning, mitigates the impact of fixed walking speed parameters using the particle swarm algorithm, and selects the optimal model (MLPRegressor) through the Bootstrap algorithm for estimating personnel walking speeds. Validated through smoke-spread experiments, the MSPFA algorithm dynamically adjusts evacuation routes, preventing toxic passages. Visualization via drawing interchange format (DXF) successfully enhances route comprehension. The MSPFA algorithm outperforms the Dijkstra algorithm with a runtime of 78.5 msand a personnel evacuation time of 3344.74 s. This research establishes a theoretical foundation for intelligent evacuation decision making in underground fire disasters. By introducing the MSPFA algorithm, it provides crucial technical support, significantly reducing the risk of casualties during emergencies.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call