Research On Escape Path Planning In Disaster Environment Based On WSN

In recent years, disasters and accidents have happened on buildings frequently. Increasing damages and losses to lives and properties have been caused, so that it has becoming more and more important to study on the disaster relief aiming at building environment. Arranging a safe and sensible escaping route for trapped people is one of the key technical problems. By now, however, there are two problems in the research of planning the escaping route:one is the acquisition of the real-time environment information problem in the disaster field; the other is the dynamic route planning problem in the disaster environment. As an advanced intelligent network monitoring system, Wireless Sensor Network (WSN) has been introduced into the domain of building disaster rescue, making a suitable technical carrier to the study on escaping route planning. Therefore, the research on fast and safe escaping route planning combined with WSN has effectively supported improving the efficiency in disaster relief, meanwhile, offering new ideas for the application of WSN technology.Analyzed the typical route planning algorithms under certain static environment situation, technical difficulties in route planning problem have been concluded in this paper. And studies on the acquisition and process method of real-time information in WSN have been carried out in order to fast obtain the scene environment information. On this basis, an optimal escaping route planning algorithm in disaster relief has been proposed in this paper based on the Ant Colony Algorithm (ACA). In order to conquer the problem of low efficiency and local optimum, combined with the information acquired by WSN, a method can adjust the pheromone evaporation factor and regulate the pheromone release has been presented in the algorithm, so that the global searching ability has been improved, and the local optimum problem can be avoided.In view of the real-time change character of disaster situation in buildings, Subtract on Negative Add on Positive (SNAP) locating algorithm based on binary sensing data has been researched, can determine the fire location. Meanwhile, RSSI locating mechanism has been used for obtaining the position information of trapped people. Furthermore, fire spreading model has been established based on the global environment information and the trend of the changing disaster scene. In order to optimize the escaping path, binding the improved ACA proposed in this paper with Dijkstra Algorithm, a safer and more efficient escaping path planning algorithm DACA (D-Ant Colony Algorithm, DACA) has been presented. This algorithm can improve the precision of the optimal solution and the convergence speed, offering a swift and reasonable escaping path for the trapped people.In addition, on the MATLAB platform, simulation experiments on Dijsktra Algorithm, basic ACA and the improved algorithm has been carried out by establishing a dynamic environment using the data acquired by WSN. According to the comparison and analysis of the experiment results, it has been proved that the proposed algorithm and the DACA are able to make an effective and reasonable escaping route planning, suitable for the demand of disaster relief.