Evacuee routing algorithms in emergency typically adopt one single criterion to compute desired paths and ignore the specific requirements of users caused by different physical strength, mobility and level of resistance to hazard. In this paper, we present a quality of service (QoS) driven multi-path routing algorithm to provide diverse paths for different categories of evacuees. This algorithm borrows the concept of Cognitive Packet Network (CPN), which is a flexible protocol that can rapidly solve optimal solution for any user-defined goal function. Spatial information regarding the location and spread of hazards is taken into consideration to avoid that evacuees be directed towards hazardous zones. Furthermore, since previous emergency navigation algorithms are normally insensitive to sudden changes in the hazard environment such as abrupt congestion or injury of civilians, evacuees are dynamically assigned to several groups to adapt their course of action with regard to their on-going physical condition and environments. Simulation results indicate that the proposed algorithm which is sensitive to the needs of evacuees produces better results than the use of a single metric. Simulations also show that the use of dynamic grouping to adjust the evacuees' category and routing algorithms with regard for their on-going health conditions and mobility, can achieve higher survival rates.
Research then moved further to the development of complex Emergency Cyber-Physical-Human systems to direct evacuees to exits in a real time @cite_27 with sensor nodes (SNs) responsible for collecting hazard information while the decision subsystem composed of decision nodes (DNs) provides advice to evacuees through visual indicators or portable devices. @cite_29 implement a WSN consisting of sensors that continuously monitor the environment and distribute a danger-level map across the network. Optimization methods have been suggested @cite_12 using distributed decision making with random neural networks @cite_32 @cite_25 to overcome the huge complexity of decision making for a large number of agents in the presence of spatial information to help select exit routes and decide about the appropriate allocation of rescuers and technical assets.
@cite_29 @cite_32 @cite_27 @cite_25 @cite_12
2039252979 2122376145 2150843819 2033118756
We develop distributed algorithms for self-organizing sensor networks that respond to directing a target through a region. The sensor network models the danger levels sensed across its area and has the ability to adapt to changes. It represents the dangerous areas as obstacles. A protocol that combines the artificial potential field of the sensors with the goal location for the moving object guides the object incrementally across the network to the goal, while maintaining the safest distance to the danger areas. We give the analysis to the protocol and report on hardware experiments using a physical sensor network consisting of Mote sensors. Large-scale distributed systems, such as natural neuronal and artificial systems, have many local interconnections, but they often also have the ability to propagate information very fast over relatively large distances. Mechanisms that enable such behavior include very long physical signaling paths and possibly saccades of synchronous behavior that may propagate across a network. This letter studies the modeling of such behaviors in neuronal networks and develops a related learning algorithm. This is done in the context of the random neural network (RNN), a probabilistic model with a well-developed mathematical theory, which was inspired by the apparently stochastic spiking behavior of certain natural neuronal systems. Thus, we develop an extension of the RNN to the case when synchronous interactions can occur, leading to synchronous firing by large ensembles of cells. We also present an O(N3) gradient descent learning algorithm for an N-cell recurrent network having both conventional excitatory-inhibitory interactions and synchronous interactions. Finally, the model and its learning algorithm are applied to a resource allocation problem that is NP-hard and requires fast approximate decisions. The evacuation of a building is a challenging problem, since the evacuees most of the times do not know or do not follow the optimal evacuation route. Especially during an ongoing hazard present in the building, finding the best evacuation route becomes harder as the conditions along the paths change in the course of the evacuation procedure. In this paper we propose a distributed system that will compute the best evacuation routes in real-time, while a hazard is spreading inside the building. The system is composed of a network of decision nodes and sensor nodes, positioned in specific locations inside the building. The recommendations of the decision nodes are computed in a distributed manner, at each of the decision nodes, which then communicate them to evacuees or rescue personnel located in their vicinity. We evaluate our proposed system in various emergency scenarios, using a multi-agent simulation platform for Building Evacuation. Our results indicate that the presence of the system improves the outcome of the evacuation with respect to the evacuation time and the injury level of the evacuees. Emergency rescues require that first responders provide support to evacuate injured and other civilians who are obstructed by the hazards. In this case, the emergency personnel can take actions strategically in order to rescue people maximally, efficiently and quickly. The paper studies the effectiveness of a random neural network (RNN)-based task assignment algorithm involving optimally matching emergency personnel and injured civilians, so that the emergency personnel can aid trapped people to move towards evacuation exits in real-time. The evaluations are run on a decision support evacuation system using the Distributed Building Evacuation Simulator (DBES) multi-agent platform in various emergency scenarios. The simulation results indicate that the RNN-based task assignment algorithm provides a near-optimal solution to resource allocation problems, which avoids resource wastage and improves the efficiency of the emergency rescue process.