Capacity based evacuation with dynamic exit signs

Static evacuation plans for buildings are generally designed to perform optimally when the building is at full capacity. We present a dynamic evacuation guidance system which does this regardless of the number of evacuees, by tailoring a flow-optimal evacuation plan to the current situation. The system assigns routes using a capacity-constrained routing algorithm which anticipates evolutions in path metrics using the concept of “future capacity reservation”. In order to direct evacuees in an intuitive manner whilst implementing the routing algorithm's scheme, we use dynamic exit signs, i.e. whose pointing direction can be controlled. Yet our routing algorithm performs source-routing on a “per-evacuee” basis and would normally mandate one display per evacuee. We therefore propose a novel algorithm which schedules the dynamic signs according to the algorithm's output. We validate this concept using simulations, and show how the underpinning assumptions may limit the system's performance, especially in low-headcount evacuations.

[1]  Erol Gelenbe,et al.  Large scale simulation for human evacuation and rescue , 2012, Comput. Math. Appl..

[2]  Erol Gelenbe,et al.  Probabilistic models of computer systems—Part I (exact results) , 1976, Acta Informatica.

[3]  Shashi Shekhar,et al.  Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results , 2005, SSTD.

[4]  Horst W. Hamacher,et al.  On the use of lexicographic min cost flows in evacuation modeling. , 1987 .

[5]  Erol Gelenbe,et al.  Autonomous search for mines , 1998, Eur. J. Oper. Res..

[6]  Richard L. Francis,et al.  Network models for building evacuation , 1982 .

[7]  Erol Gelenbe,et al.  Steps toward self-aware networks , 2009, CACM.

[8]  Great Britain. Scottish Office,et al.  Guide to safety at sports grounds , 1997 .

[9]  Wen-Tsuen Chen,et al.  A Load-Balanced Guiding Navigation Protocol in Wireless Sensor Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[10]  Erol Gelenbe,et al.  Future Research on Cyber-Physical Emergency Management Systems , 2013, Future Internet.

[11]  Dirk Helbing,et al.  Dynamics of crowd disasters: an empirical study. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Erol Gelenbe,et al.  Reactive and proactive congestion management for emergency building evacuation , 2013, 38th Annual IEEE Conference on Local Computer Networks.

[13]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[14]  Richard L. Francis,et al.  EVACNET+: A computer program to determine optimal building evacuation plans , 1985 .

[15]  Erol Gelenbe,et al.  Probabilistic models of computer systems , 1976, SIGMETRICS '76.

[16]  Erol Gelenbe,et al.  Distributed Building Evacuation Simulator for Smart Emergency Management , 2010, Comput. J..

[17]  Erol Gelenbe,et al.  Demonstrating cognitive packet network resilience to worm attacks , 2010, CCS '10.

[18]  Roya Olyazadeh,et al.  Evaluating Dynamic Signage for Emergency Evacuation using an Immersive Video Environment , 2013 .

[19]  Erol Gelenbe,et al.  Learning in the Recurrent Random Neural Network , 1992, Neural Computation.

[20]  Geoffrey N. Berlin,et al.  The use of directed routes for assessing escape potential , 1978 .

[21]  Y. H. Chin,et al.  The quickest path problem , 1990, Comput. Oper. Res..

[22]  Erol Gelenbe,et al.  Routing Emergency Evacuees with Cognitive Packet Networks , 2013, ISCIS.

[23]  Erol Gelenbe,et al.  Information Sciences and Systems 2013 , 2013, Lecture Notes in Electrical Engineering.

[24]  Richard L. Francis,et al.  A "Uniformity Principle" for Evacuation Route Allocation. , 1981, Journal of research of the National Bureau of Standards.

[25]  Erol Gelenbe,et al.  Area-based results for mine detection , 2000, IEEE Trans. Geosci. Remote. Sens..

[26]  Federico Garriga Garzón,et al.  Optimal building evacuation time considering evacuation routes , 2009, Eur. J. Oper. Res..

[27]  Yan Huang,et al.  Evacuation Planning: A Capacity Constrained Routing Approach , 2003, ISI.

[28]  Erol Gelenbe,et al.  Sensible decisions based on QoS , 2003, Comput. Manag. Sci..

[29]  E. Gelenbe Search in unknown random environments. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Thomas Pfeiffenberger,et al.  Dynamic Evacuation Guidance as Safety Critical Application in Building Automation , 2011, CRITIS.

[31]  Erol Gelenbe,et al.  Autonomous search by robots and animals: A survey , 1997, Robotics Auton. Syst..

[32]  Éva Tardos,et al.  “The quickest transshipment problem” , 1995, SODA '95.

[33]  Erol Gelenbe,et al.  A self-aware approach to denial of service defence , 2007, Comput. Networks.