Resumen
Natural disasters and terrorist attacks pose a significant threat to human society, and have stressed an urgent need for the development of comprehensive and efficient evacuation strategies. In this paper, a novel evacuation-planning mechanism is introduced to support the distributed and autonomous evacuation process within the operation of a public safety system, where the evacuees exploit the capabilities of the proposed ESCAPE service, towards making the most beneficial actions for themselves. The ESCAPE service was developed based on the principles of reinforcement learning and game theory, and is executed at two decision-making layers. Initially, evacuees are modeled as stochastic learning automata that select an evacuation route that they want to go based on its physical characteristics and past decisions during the current evacuation. Consequently, a cluster of evacuees is created per evacuation route, and the evacuees decide if they will finally evacuate through the specific evacuation route at the current time slot or not. The evacuees? competitive behavior is modeled as a non-co-operative minority game per each specific evacuation route. A distributed and low-complexity evacuation-planning algorithm (i.e., ESCAPE) is introduced to implement both the aforementioned evacuee decision-making layers. Finally, the proposed framework is evaluated through modeling and simulation under several scenarios, and its superiority and benefits are revealed and demonstrated.