煤矿安全2024，Vol.55Issue(6)：192-199,8.DOI:10.13347/j.cnki.mkaq.20231697
基于动态D-K算法的矿井突水应急疏散最优路径研究
Research on optimal emergency evacuation path for mine water inrush based on dynamic D-K algorithm
摘要
Abstract
After the occurrence of mine water inrush,choosing the appropriate emergency evacuation path is very important to re-duce the casualty and the mine accident level.The traditional Dijkstra algorithm can not be effectively applied to the dynamic envir-onment 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 es-cape path with time and water level height.Moreover,the optimized Dijkstra algorithm is combined with the K optimal path al-gorithm 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算法/动态选择Key words
mine water inrush/emergency evacuation/optimal path/Dijkstra algorithm/dynamic selection分类
矿业与冶金引用本文复制引用
谢彪,朱登奎,李柏辰,雷倩茹,郁静静,胡嘉奇,张兴华..基于动态D-K算法的矿井突水应急疏散最优路径研究[J].煤矿安全,2024,55(6):192-199,8.基金项目
山西省重点研发计划资助项目(202102100401008) （202102100401008）
