摘要
井下人员定位系统井下读卡分站由于复杂情况存在漏读现象,导致人员从一个分站到下一个分站记录不连续的,其行走轨迹需要通过网络计算来矫正,否则就会出现人员不按照井下巷道行走,出现"穿越煤层"的情况。根据煤矿井下巷道的特点,利用Dijkstra最短路径算法原理,对于井下人员定位读卡分站和巷道组建的网络进行分组,对算法进行优化,实现人员井下移动路径的快速计算。实践证明该方法在计算行走路线的矫正方面和计算时间上都具有明显的优势,具有良好的实用性。
Due to the complicated situation, the card identification leakage phenomenon sometimes occurs for underground reader suhstation of personnel positioning system, it causes the personnel record is not continuous from one station to next station. So it is need to con＇ect walking trajectory through the network calculation, otherwise, it reveals that one person do not follow the underground roadway, even walks through coal seam. According to the underground roadway characteristics of coal mine, the Dijkstra shortest path algorithm principle was used to group the network set up by personnel positioning reader substations and roadway, and the algorithm was optimized to achieve rapid calculation for underground personnel moving path. The practice showed that this method had obvious advantages in the calculation of walking path con＇ection and computing time, it had good practicability.
出处
《煤矿安全》
北大核心
2017年第6期116-118,共3页
Safety in Coal Mines
关键词
人员定位系统
人员定位
行走路径矫正
网络划分
空间路径算法
personnel positioning system
personnel location
walking path （：orrection
network partition
spatial path algorithm
