Shaanxi Guard Line Selection Based On Geographical Information System

Choosing a security route is a very import role of the Guard task.Although the security route in Guard task adopts 'routing itinerary' and 'spare itinerary' in common,there are many temporary routes in actual work.Situations are complicated on both sides of the route,especially the complex terrain,object as well as the bridge.culvert which to help the hostile prepared raid,cover up and cast exploder and so on.Observed from the cases in which V.I.P are murdered,kidnapped,and hold up,route is the common place for these incidences happening.The choice of the security route relates to a lot of factors(restriction condition),and it's hard to handle manually under the emergency,as a result,studying the best security route arithmetic under multi-restriction and supplying the method that is able to realize have important practical meaning in emphasizing the Guard work.By carefully investigating and analyzing the restriction,this article firstly offered a network model under multi-restriction,and then offered a best security route arithmetic considering dynamic and static restriction.We obtains constrains from the practice of guard task and traffic conditions and statistics the weight of constrains from actual work based on the theory of Danger Evaluate,thus mastering basic factors on choice of safe route.By denoting the most safe route with the lest weight path,we obtain the algorithm with the weight length other than the length in Dijkstra,design an improved algorithm of Dijkstra,give the implement of key sections,which applies hierarchy analysis to the assignment of attribute weight,data structure of road network,structure of algorithm,and finally analyses implement method of prior queue and implement effectiveness.'Golden Shield' provides a controllable navigation system of guard vehicles based on GPS.The choice of the best safe route of this system considers several constraints and uses the algorithm afforded by this article.We used this system in two times guard missuin of 2009 and 2010,and it is proved that this algorithm,considering several kinds of constraints and the most safe route navigation when jamming,can simulate the actual safety constrains rather well and gives a good route far from dangerous sections and block sections,satisfying guards.