Font Size: a A A

Research On The Optimal Path Planning In The Coal Mine Escaping

Posted on:2015-02-06Degree:MasterType:Thesis
Country:ChinaCandidate:Y B SunFull Text:PDF
GTID:2181330422487405Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Reasonable path to escape from the disaster not only can reduce the number ofunnecessary economic losses, but also can effectively protect the safety of the people.Escape route is part of the optimal path selection problem belongs to the pathplanning. In recent years, it plays an important role in many fields, and increasinglyobvious importance it becomes a hot research topic. In the field of mine safety, thecorrect optimal path enables underground workers escape to a safe area whendisasters occur. The author makes a thorough study of the selection of the optimalpath of the time-dependent network (path information changing with time). Based onthe consideration, the paper proposed an optimized path selection algorithm whichsuitable for dynamic road network.Existing path planning problems are mostly dependent on the static network as thebackground, and the corresponding path selection algorithm can only handle a smallamount of network nodes. For the majority of today’s road network with complex,long-range lacks appropriate solutions. Currently, many traditional path algorithms areused to solve the dynamic network routing, which including dijkstra algorithm, A*algorithm and bionic algorithm. With the deep research on the time-dependentnetworks, the paper improve the dynamic network routing and propose a newalgorithm that combines the advantages of other algorithms, so that it can make thecalculated path closer to the actual path.In order to calculate the path in dynamic network, the paper takes a two-stepstrategy. Firstly, the time-dependent networks, with the judgment of the redundantedges, redundant nodes and edges of redundant states, the paper proposed themitigation algorithm to reduce the network without the influence of the calculateresult and improve the efficiency of path-planning algorithm. Secondly, based on thefirst step, using a new algorithm calculate one or several optimal routes from thecurrent location to the nearest safety area.Finally, paper takes a particular mine for an example, based on the aboveimprovements, simulation experiments achieving good performance.
Keywords/Search Tags:path optimization, network reduction, optimal path selection, dynamicrouting algorithm
PDF Full Text Request
Related items