论文部分内容阅读
为确定易自燃煤矿一氧化碳传感器的合理数量和位置,采用Dijkstra算法,求得任意两个节点间的最短路径,建立了邻接节点路径矩阵和邻接节点时间矩阵.规定一个有效监测时间,把邻接节点时间矩阵化为有效监测矩阵,从而得到各节点的有效监测分支集合.利用极小边支配集原理提出了最少全覆盖布点法,给出了一氧化碳传感器的优化布置方案.研究结果表明:有效监测时间不同,布点的数量、位置以及分支覆盖度也不同.
In order to determine the reasonable number and location of carbon monoxide sensors for coal spontaneous combustion, Dijkstra algorithm is used to find the shortest path between any two nodes and establish the path matrix of adjacency nodes and the adjacency node time matrix.An effective monitoring time is defined, and the adjacent node time Matrix is used as an effective monitoring matrix to obtain the effective monitoring branch set of each node.At least cover full coverage placement method is proposed by the principle of minimal edge set and the optimal arrangement of carbon monoxide sensors is given.The results show that the effective monitoring time is different , The number of locations, location and branch coverage is also different.