Research On Optimal Path Planning Methods In Fire-fighting And Rescue System

The city fire fighting is an important problem that relates to the society stabilityand public safety. With the city development in China, the fire situation goes into amore rigorous period. The traditional methods can't satisfy the demand of the modernfire fighting. It is needed to build a practical city fire fighting geography informationsystem, provide the project of the fire fighting; force dispatch quickly and provideassistance decision quickly. The limited manpower and material resources can be wellused to reduce the loss to the least. And in this system, the optimal dispatch of the firefighting force is a veryimportant part.This paper introduces the development of fire fighting information system andpath planning algorithm. Especially analyze the path planning algorithm classificationand methods inside.First of all, this paper constructs the mathematical model to describe the road net;based on the map theory of computer, disport the map into node class and road class,stored in neighboring matrix and neighboring list, discuss the complexity of the twostructures. Add a turning class in neighboring list to describe the limited turning forthe crossing. To multilayer map, stored the data in the different layer, and constructsthe relevancywith different layer.Then it optimize network traffic weight and combine of the actual situation offire fighting, use the AHP to decide the network weight, set up a optimal pathplanning model for the fire-fighting and rescue information system.After that it analyzes the algorithm of static path planning in detail. Firstly, theArithmetic of static path planning in common use are described, the complexity andapplicability are compared and discussed. Bidirectional search and layered search asimproved strategies are adopted. The improvement of the Arithmetic is analyzed; Fit together the different storage strict of the map and the different arithmetic of pathplanning, compare the result and the cost of search in the experiment, analyze thewarp between theory and experiment, and get the reason. Finally, the conclusion canbe gotten: if the map is a single layer map, the map should be stored in theneighboring list, the arithmetic should be Astar; if the map is multilayer map, whenthe distance between start node and the destination node is near, the arithmetic shouldbe Astar arithmetic, when the distance between start node and the destination node isfar, the arithmetic should be layered search based on A star arithmetic should beadopted.Finally, this paper combine the methods provided in preceding chapters anddevelop the path planning module based on MapX. We design process of therealization the optimal path planning with MapX, then get the path planning moduleof the fire-fighting and rescue system.