The Research Of The Optimal Avoiding And Rescuing Path During Mine Disaster Period

Because the energy organization structure of china has the characteristic of rich coal, lack oil and miss gap, coal,as a kind of primary energy,plays an important role in the national economy in a long period of future.Because of the occurrence condition of coal,most of the coal mining is underground mining. Compared with the ground environment,the environment under the shaft is more complex,more villainous and more chaotic when there is cataclysm.The government,mining management layer, miner andthe social public opinion must collaborate to avoid the occurrence of all kindsof accidents which can cause casualties and property loss.However, because of some natural and man-made disaster,sometimes the mine accident takes place inevitably. Under the circumstances,the most important thingof the mine emergency rescue is to rescue the injured people and help miner escape.Nevertheless the main symbol of whether the emergency rescue is success or not is whether fulfil the task that the injured people havebeenrescued within the fixed time.That is to say,people must along the shortestpath to escape and rescue,which can save much precious time. Allof the above is the purport of the task. Based on the research achievement of the optimal path at home and abroad,this article study preliminarily the concept of the optimal path, computing method and the related program design.First of all,this article elaborate the the concept of the optimal path, and clear and definite the the optimal path is not the shortest geometricaldistance path,but is the shortest equivalent length regarding various of influencing factors. Then this article mainly explain the ultimate principle andcalculation steps of dijkstra algorithm and analyse the merit and demerit of dijkstra algorithm.At the same time,contraposing the shortcoming of the blindness of search direction and inefficiency,some kinds of modified dijkstra algorithm,such as the sector optimizing, the straight line optimizing and the panel point optimizing,are presented. Meanwhile,this test introduce briefly some other computational algorithms of the optimal path,including ant colony algorithm, Floyd algorithm and so on. With regard to the K optimal path,there is no impeccable algorithm.But the frequently-used algorithm is the Removing-edge algorithm, namely this algorithm first use the classicalDijkstra algorithm to work out the optimal path of any two points,then successively delete any one side of this optimal path, recount the distance of this two points,last compare the distance and gain the K optimal path.This algorithm only need reuse the Dijkstra algorithm,but train of thought is not very distinct and they are the quasi-optimal path.This article also introduce the Proximal point algorithm、Sparse matrix algorithm and Bidirectional search algorithm,at the same time this text uses some simple example to explain these algorithms and analysis the pros and cons. Comparatively speaking, the train of thought of Bidirectional search algorithm is more distinct and simpler,because it only need twice Dijkstra algorithm.Its main thought is following:the first Dijkstra algorithm begin from the disastersites and extend to the point of safety,but the second Dijkstra algorithm begin from the point of safety and extend to the disaster sites. In this process,if one node is permanent marker in both the Dijkstra algorithm,then this node become the point of junction,and the optimal path between the disaster sites and the point of safety is equal to the the optimal path between the disaster sites and the point of junction add the optimal path between the point of junction and the point of safety.Next continue this process,thesecond optimal path and the third optimal path and so on will be gained.Meanwhile,this text introduce simply some knowledge about VB.Combining the specific parameters of roadway and ventilation network map of HuaSheng mine with the Dijkstra algorithm and the Bidirectional search algorithm,this article design three operation interface to compute the optimal path,include the optimal path、the K optimal path and the Multiple security exit optimal path,and test and verify its accuracy and operability through some nodes.Last but not the least,this text state simply the insufficient and give some ideas for the future.