基于动态D-K算法的矿井突水应急疏散最优路径研究  

Research on optimal emergency evacuation path for mine water inrush based on dynamic D-K algorithm

作　　者：谢彪 朱登奎 李柏辰 雷倩茹 郁静静 胡嘉奇 张兴华 XIE Biao;ZHU Dengkui;LI Baichen;LEI Qianru;YU Jingjing;HU Jiaqi;ZHANG Xinghua(College of Safety and Emergency Management Engineering,Taiyuan University of Technology,Taiyuan 030024,China)

机构地区：[1]太原理工大学安全与应急管理工程学院,山西太原030024

出　　处：《煤矿安全》2024年第6期192-199,共8页Safety in Coal Mines

基　　金：山西省重点研发计划资助项目(202102100401008)。

摘　　要：矿井水害发生后,选择恰当的应急疏散路径,对于降低矿井人员伤亡和事故等级至关重要。传统的Dijkstra算法不能有效应用于矿井突水的动态环境,只能静态规划出单一的最优逃生路径。为此,提出了1种基于时间当量长度的最优路径分析方法。该方法实现了对传统的Dijkstra算法的动态优化,优化后求解的最优路径随时间、水位高度进行动态变化,并将动态Dijkstra算法与K则最优路径算法相结合,实现对多条最优逃生路径的动态规划。应用表明:优化后的动态D-K算法能够有效适用矿井水害随机性、动态性、复杂性的特点,为受灾人员选择应急逃生路径提供重要的决策支撑。After the occurrence of mine water inrush,choosing the appropriate emergency evacuation path is very important to reduce the casualty and the mine accident level.The traditional Dijkstra algorithm can not be effectively applied to the dynamic environment of mine water inrush.It can only statically plan a single optimal escape path.In view of the limitations of this algorithm,the time equivalent length is introduced to optimize the traditional Dijkstra algorithm to realize the dynamic change of the optimal escape path with time and water level height.Moreover,the optimized Dijkstra algorithm is combined with the K optimal path algorithm to realize the dynamic planning of multiple optimal escape paths.Field application shows that the optimized dynamic D-K algorithm can be effectively applied to mine water inrush with characteristics of randomness,dynamics and complex,which can provide important decision support for affected personnel to choose emergency escape path.

关 键 词：矿井突水 应急疏散 最优路径 DIJKSTRA算法 动态选择 

分 类 号：TD745[矿业工程—矿井通风与安全]