摘要
为确定易自燃煤矿一氧化碳传感器的合理数量和位置,采用Dijkstra算法,求得任意两个节点间的最短路径,建立了邻接节点路径矩阵和邻接节点时间矩阵.规定一个有效监测时间,把邻接节点时间矩阵化为有效监测矩阵,从而得到各节点的有效监测分支集合.利用极小边支配集原理提出了最少全覆盖布点法,给出了一氧化碳传感器的优化布置方案.研究结果表明:有效监测时间不同,布点的数量、位置以及分支覆盖度也不同.
In order to determine the reasonable number and location of carbon monoxide sensors for easy self-ignition coal mine, this paper established the adjacent node path matrix and the adjacent node time matrix by using Dijkstra algorithm. Specifying an effective monitoring time, the adjacent node time matrix is translated into the effective monitoring matrix, thus the effective monitoring branch collection of each nodes were obtained. The least full-coverage distribution method is proposed using the minimum edge dominating set principle. The study presents an optimal location scheme for the carbon monoxide sensor. The results show that the effective monitoring times are different, the number and the location of distribution and the branch coverage are also different.
出处
《辽宁工程技术大学学报（自然科学版）》
CAS
北大核心
2013年第5期623-627,共5页
Journal of Liaoning Technical University (Natural Science)
基金
国家自然科学基金资助项目(51204088)
