To minimize property loss and death count in terror attacks and other emergent scenarios, attention given to timely and effective evacuation cannot be enough. Due to limited evacuation resource, i.e., number of available exits, there exists interdependence among pedestrians such as cooperation, competition and herd effect. Thus human factors - more specifically, pedestrians' behavior in emergency evacuation - play a significant role in evacuation research. Effective evacuation can only be reached when route planning are considered in conjunction with psychological dynamics, which is often ignored. As another drawback, previous research assumes the environment including available exits as stationary. However, we note that during emergency, some exits which are not often utilized in normal times are opened, which potentially helps if pedestrians are aware of them. In this paper, we analyze the effect of pedestrians' behavior, i.e., herd effect and knowledge of changing environment with Cellular Automata (CA) simulation. Results of the simulation show the harmful effect of herd effect as well as highlight the importance of timely informing pedestrians of environmental change. Accordingly, we propose policy and procedural recommendations for emergency management of large, crowded structures. Our future work includes considering more human factors and applying our model to log data provided by videos in public venues, which can further show effectiveness of our model in real scenarios.
@cite_9 gives a model for evaluation in subway fire, which emphasizes the number and width of escape exits. The authors believe that a subway station should have at least two exits in different directions, and the wider the exits, the better. @cite_5 presents a model based on the parallel computational tool of cellular automata capable of simulating the process of disembarking in a small airplane seat layout, in search of ways to make it faster and safer under normal evacuation conditions, as well as emergency scenarios. @cite_4 provides a comprehensive survey of evacuation planning models.
@cite_5 @cite_9 @cite_4
2341078590 2345063721 2020276315 2486010654 2508310398 2951006828 2583260348 2150843819 1766799846 2049104168 2187411536 2074026287 2462610560 85172617 2033118756 193527147 2139386764 2090786169 1874038193 2616455767
In this paper we present a model based on the parallel computational tool of cellular automata CA capable of simulating the process of disembarking in a small airplane seat layout, corresponding to Airbus A320 Boeing 737 layout, in search of ways to make it faster and safer under normal evacuation conditions, as well as emergency scenarios. The proposed model is highly customizable, with the number of exits, the walking speed of passengers, depending on their sex, age and height, and the effects of retrieving and carrying luggage. Additionally, the presence of obstacles in the aisles as well as the emergence of panic being parameters whose values can be varied in order to enlighten the disembarking and emergency evacuation processes are considered in detail. The simulation results were compared to existing aircraft disembarking and evacuation times and indicate the efficacy of the proposed model in investigating and revealing passenger attributes during these processes in all the examined cases. Moreover, we parallelized our code in order to run on a graphics processing unit GPU using the CUDA programming language, speeding up the simulation process. Finally, in order to present a fully dynamical anticipative real-time system helpful for decision-making we implemented the proposed CA model in a field programmable gate array FPGA device, and recreated the results given by the software simulations in a fraction of the time. We then compared and exported the performance results among a sequential software implementation, the implementation running on a GPU, and a hardware implementation, proving the consequent acceleration that results from the parallel CA implementation in specific hardware. Emergency evacuation from airports is an important consideration given the continuing occurrence of both natural and human caused disasters. Unfortunately, the traditional evacuation-drill approach to prepare for emergency situations presents several practical challenges at the scale and magnitude required for airports. In this paper, we present an agent-based model (ABM) called exitus which is capable of determining the extent to which collective behavior and overall evacuation time of passenger groups is affected by changes in the built environment for large, complex structures. The model is unique because it explicitly considers the physical and psychological characteristics of individuals with disabilities. In our first experiment, several bomb simulation scenarios were conducted at an international airport using exitus. Several important findings were revealed including: 1) the importance of stairway and exit configurations; 2) the inherent weaknesses of the pier airport design in affecting timely evacuations; 3) who the most vulnerable groups of people are; 4) the particular risk engendered from crowded or complex building interiors for individuals with disabilities; and 5) the potential problems caused by locating explosive detection system machines near passenger processing areas. The results of a second exploratory experiment also revealed the importance of realistically modeling psychological attributes of individuals with disabilities and their potential impact on collective evacuation performance. Overall the findings demonstrated the model’s ability to generate a common operational picture capable of guiding preparedness efforts for both public and private organizations encompassing a wide variety of professional endeavor. Metro construction in China enjoyed and will continue to enjoy unprecedented development in the tenth 5 Year Plan period and the upcoming eleventh 5 Year Plan period. In China, cities are densely populated, and as a modernized urban rail transit means, metros have been undertaking increasingly important tasks of large passenger flow transportation, under which circumstance the injury and casualty will be enormous if an accident occurs. China's work safe laws and regulations have stipulated that safety evaluation must be carried out during planning, design, construction and operation of metros. As a part of the metro safety evaluation, occupant safe evacuation is a critical aspect to be assessed. This paper will first introduce the occupants evacuation design in the construction of metros in China based on Code for design of metro (CFDOM) (GB 50157-2003), including evacuation passage design, evacuation time and evacuation safe area as well as fire-engineering-based occupants evacuation design philosophy and calculation method. Finally, a computer simulation of the process of evacuation of occupants from deep buried metro station (DBMS) by using occupants evacuation dynamic model will be conducted on the example of DBMS of Guangzhou Metro Line 6, so as to study whether the occupants can be safely evacuated from DBMS in case of fire. Abstract This paper explores the likely behaviours of train passengers in an emergency evacuation and examines four crucial theoretical issues on the passengers’ evacuation, including reactive vs. proactive behaviours, cooperative vs. competitive behaviours, symmetry breaking, and route exit choice. A survey of 1134 train passengers shows that respondents are not homogeneous in their likely behaviours. Overall, they are more likely to be reactive (e.g., wait for instruction from station staff) than proactive (e.g., move to exit) in an emergency situation. We also find that people are more likely to be co-operative (e.g., helping other people) than competitive (e.g., push other passengers). Although passengers are likely to show herding or symmetry breaking behaviour (e.g., following other passengers) than symmetric behaviour (e.g., choose least crowded exit), the degree of symmetry breaking behaviour is not as high as assumed in previous mathematical models. They are also unlikely to use escalators, lifts and train tunnels in their exit route choice during an emergency escape. In terms of demographic differences in behaviours, results from the ordered logit models demonstrate that there are significant differences in the evacuation behaviours between males and females but not among the different age groups. Besides providing valuable information for developing mathematical models intended to simulate passengers’ evacuation in a train station, our findings can assist managers of emergency response in developing appropriate strategies and training, and in designing solutions and education campaigns for effective evacuation. Pedestrian evacuation is one open question in a myriad of scientific disciplines and has attracted considerable attention during the past decades. Aim to issue, various research approaches, such as mathematical modeling and simulation, experimental studied and socio-psychology surveys, have been extensively employed. Different from previous frameworks, here a behavior-based cellular automaton model is proposed, which involves the environmental characteristics and neighbors' behaviors. Given the certain range of degree of emergency, it is shown that enhancing the degree of emergency will shorten evacuation time yet decrease cooperation enthusiasm. The larger the degree of familiarity is, the shorter the evacuation time will be. In variance, larger the dependence of pedestrians will prolong the evacuation time. Besides, the novel model also produces some interesting self-organization phenomena, such as the collective behavior at the beginning of the evacuation and arch-like blocking at the end of the evacuation. When our model is finally applied to the evacuation scenario where a room has two symmetrically located exits, the symmetry breaking effect takes place. Our model may shed new light to the study of pedestrian dynamics in realistic world. Exit paths in buildings are designed to minimise evacuation time when the building is at full capacity. We present an evacuation support system which does this regardless of the number of evacuees. The core concept is to even-out congestion in the building by diverting evacuees to less-congested paths in order to make maximal usage of all accessible routes throughout the entire evacuation process. The system issues a set of flow-optimal 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. To make this system practical and minimise reliance on sensors during the evacuation, we use an evacuee mobility model and make several assumptions on the characteristics of the evacuee flow. We validate this concept using simulations, and show how the underpinning assumptions may limit the system's performance, especially in low-headcount evacuations. This paper proposes a group-based framework with dedicated path planning for emergency guiding based on Internet of Things (IoT) technologies. The proposed framework can model the spatiotemporal mobility of indoor people to determine and relieve the congestion of corridors and exits. A dedicated path can be determined to provide the shortest evacuation time for each group of nearby people. The corridor and exit capacities, corridor lengths, clustering motion of a group, concurrent moving of different groups, and up-to-date distribution of group people are considered together to accurately estimate the evacuation time for each group. Based on the estimated evacuation time, evacuation load can be evenly distributed among corridors and exits to alleviate the congestion of all corridors and exits for minimizing total evacuation time. The performance of the proposed framework is evaluated by conducting mathematical analysis and computer simulations, which outperforms existing schemes and can achieve the shortest evacuation time for group-based emergency guiding. In addition, an Android-based prototype with indoor IoT localization technologies is implemented to verify the feasibility of our framework. 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. Assume that two robots are located at the centre of a unit disk. Their goal is to evacuate from the disk through an exit at an unknown location on the boundary of the disk. At any time the robots can move anywhere they choose on the disk, independently of each other, with maximum speed @math . The robots can cooperate by exchanging information whenever they meet. We study algorithms for the two robots to minimize the evacuation time: the time when both robots reach the exit. In [CGGKMP14] the authors gave an algorithm defining trajectories for the two robots yielding evacuation time at most @math and also proved that any algorithm has evacuation time at least @math . We improve both the upper and lower bounds on the evacuation time of a unit disk. Namely, we present a new non-trivial algorithm whose evacuation time is at most @math and show that any algorithm has evacuation time at least @math . To achieve the upper bound, we designed an algorithm which non-intuitively proposes a forced meeting between the two robots, even if the exit has not been found by either of them. Computer based analysis of evacuation can be performed using one of three different approaches, namely optimization, simulation and risk assessment. Furthermore, within each approach different means of representing the enclosure, the population and the behaviour of the population are possible. The myriad of approaches that are available has led to the development of some 22 different evacuation models. This review attempts to describe each of the modelling approaches adopted and critically review the inherent capabilities of each approach. The review is based on available published literature. Assume that two robots are located at the centre of a unit disk. Their goal is to evacuate from the disk through an exit at an unknown location on the boundary of the disk. At any time the robots can move anywhere they choose on the disk, independently of each other, with maximum speed @math . The robots can cooperate by exchanging information whenever they meet. We study algorithms for the two robots to minimize the evacuation time: the time when both robots reach the exit. In [9] the authors gave an algorithm defining trajectories for the two robots yielding evacuation time at most @math and also proved that any algorithm has evacuation time at least @math . We improve both the upper and lower bounds on the evacuation time of a unit disk. Namely, we present a new non-trivial algorithm whose evacuation time is at most @math and show that any algorithm has evacuation time at least @math . To achieve the upper bound, we designed an algorithm which non-intuitively proposes a forced meeting between the two robots, even if the exit has not been found by either of them. The main purpose of this work is to present a formulation of the building evacuation problem that incorporates evacuation routes and applies the functions developed by Nelson and McLennan [H.E. Nelson, H.A. McLennan (Eds.), Emergency Movement, The SFPE Handbook of Fire Protection Engineering, 1996, pp. 3.286-3.295 (Section 3 Chapter 14)] to model the movement of people. These considerations lead to significant changes in the form of the evacuation and inverse evacuation functions, so it is necessary to develop a new procedure for solving the building evacuation problem. Information systems that provide decision support in an efficient and timely manner can prove beneficial for emergency response operations. In this paper we propose the use of a system that provides movement decision support to evacuees by directing them through the shortest or less hazardous routes to the exit and evaluate it with a specialised software platform that we have developed for simulation of disasters in buildings. The system operates in a distributed manner, and computes the best evacuation routes in real-time while a hazard is spreading inside the building. It 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 use a multi-agent simulation platform for Building Evacuation that we developed, in order to evaluate our proposed system in various emergency scenarios. Our simulation results show that the overall outcome of the evacuation procedure is improved when the decision support system is in operation. The objective of this study is the development of a computer simulation model for pedestrian movement in architectural and urban space. The characteristic of the model is the ability to visualize the movement of each pedestrian in a plan as an animation. So architects and designers can easily find and understand the problems in their design projects. In this model, the movement of each pedestrian is simulated by the motion of a magnetized object in a magnetic field. Positive magnetic pole is given to each pedestrian and obstacles like walls and columns. Negative magnetic pole is located at the goal of pedestrians. Each pedestrian moves to his goal by the attractive force caused by the negative magnetic pole at his goal, avoiding collisions with other pedestrians and obstacles by repulsive forces caused by the positive magnetic poles. The effectiveness of the simulation model is shown by the following two kinds of simulation examples. (1) Evacuation from an office building In this model pedestrians walk along the route from each starting point to the exit in case of evacuation. The example shows the places where stagnations and heavy congestions occur, and designers can see if the evacuation routes are appropriate. (2) Movement of pedestrians in queue spaces Three types of queuing behavior is classified in this model: movement in front of counters, movement passing through ratches, and movement of getting on and off in elevator halls. Simulation examples in a railway station and in a main floor of a resort hotel are shown where several kinds of queue spaces are included and complicated movements of hundreds of pedestrians occur. 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. Given a large city represented by nodes and arcs, with a subset of these nodes having people required to be evacuated in a disaster situation, and a subset of destination nodes where the people may be taken for safety, the evacuation route planner finds routes in this network to evacuate the people in minimum possible time. Evacuation route planning in pre-known disasters such as hurricanes is of utmost importance for civic authorities. Computing such evacuation routes in a large graph with road infrastructure constraints such as road capacities and travelling times can be challenging. The Capacity Constrained Route Planner (CCRP) is a well studied heuristic algorithm proposed by Lu, George and Shekhar for solving this problem. It uses shortest path computations as a basis for finding and scheduling possible evacuation paths in the graph. However, the algorithm fails to scale to very large graphs. Other algorithms based on CCRP like CCRP++ and Incremental Data Structure based CCRP have been proposed to scale them to larger graphs. In this paper, we analyze these algorithms from performance perspective and suggest a faster algorithm by extending the CCRP algorithm that avoids recomputing partial paths. We have carried out experiments on various graph structures which show a vast improvement in runtime without impacting the optimality of CCRP results. For instance, for the city of Oldenburg with 382285 people, 6105 nodes and 7034 edges, our algorithm produced an evacuation plan in 2.6 seconds as compared to 123.8 seconds by CCRP and 9.3 seconds by CCRP++. This paper builds upon the scalable admission control schemes for CDMA networks developed in F. (2003, December 2004). These schemes are based on an exact representation of the geometry of both the downlink and the uplink channels and ensure that the associated power allocation problems have solutions under constraints on the maximal power of each station user. These schemes are decentralized in that they can be implemented in such a way that each base station only has to consider the load brought by its own users to decide on admission. By load we mean here some function of the configuration of the users and of their bit rates that is described in the paper. When implemented in each base station, such schemes ensure the global feasibility of the power allocation even in a very large (infinite number of cells) network. The estimation of the capacity of large CDMA networks controlled by such schemes was made in these references. In certain cases, for example for a Poisson pattern of mobiles in an hexagonal network of base stations, this approach gives explicit formulas for the infeasibility probability, defined as the fraction of cells where the population of users cannot be entirely admitted by the base station. In the present paper we show that the notion of infeasibility probability is closely related to the notion of blocking probability, defined as the fraction of users that are rejected by the admission control policy in the long run, a notion of central practical importance within this setting. The relation between these two notions is not bound to our particular admission control schemes, but is of more general nature, and in a simplified scenario it can be identified with the well-known Erlang loss formula. We prove this relation using a general spatial birth-and-death process, where customer locations are represented by a spatial point process that evolves over time as users arrive or depart. This allows our model to include the exact representation of the geometry of inter-cell and intra-cell interferences, which play an essential role in the load indicators used in these cellular network admission control schemes. In subway systems, the energy put into accelerating trains can be reconverted into electric energy by using the motors as generators during the braking phase. In general, except for a small part that is used for onboard purposes, most of the recovery energy is transmitted backward along the conversion chain and fed back into the overhead contact line. To improve the utilization of recovery energy, this paper proposes a cooperative scheduling approach to optimize the timetable so that the recovery energy that is generated by the braking train can directly be used by the accelerating train. The recovery that is generated by the braking train is less than the required energy for the accelerating train; therefore, only the synchronization between successive trains is considered. First, we propose the cooperative scheduling rules and define the overlapping time between the accelerating and braking trains for a peak-hours scenario and an off-peak-hours scenario, respectively. Second, we formulate an integer programming model to maximize the overlapping time with the headway time and dwell time control. Furthermore, we design a genetic algorithm with binary encoding to solve the optimal timetable. Last, we present six numerical examples based on the operation data from the Beijing Yizhuang subway line in China. The results illustrate that the proposed model can significantly improve the overlapping time by 22.06 at peak hours and 15.19 at off-peak hours. Emergency response operations can benefit from the use of information systems that reduce decision making time and facilitate co-ordination between the participating units. We propose the use of two such systems and evaluate them with a specialised software platform that we have developed for simulation of disasters in buildings. The first system provides movement decision support to evacuees by directing them through the shortest or less hazardous routes to the exit. It is composed of a network of decision nodes and sensor nodes, positioned at specific locations inside the building. The recommendations of the decision nodes are computed in a distributed manner and communicated to the evacuees or rescue personnel in their vicinity. The second system uses wireless-equipped robots that move inside a disaster area and establish a network for two-way communication between trapped civilians and rescuers. They are autonomous and their goal is to maximise the number of civilians connected to the network. We evaluate both proposed information systems in various emergency scenarios, using the specialised simulation software that we developed. Hajj is one of the largest mass gatherings where Muslims from all over the world gather in Makah each year for pilgrimage. A mass assembly of such scale bears a huge risk of disaster either natural or man-made. In the past few years, thousands of casualties have occurred while performing different Hajj rituals, especially during the Circumambulation of Kaba (Tawaf) due to stampede or chaos. During such calamitous situations, an appropriate evacuation strategy can help resolve the problem and mitigate further risk of causalities. It is however a daunting research problem to identify an optimal course of action based on several constraints. Modeling and analyzing such a problem of real-time and spatially explicit complexity requires a microscale crowd simulation and analysis framework. Which not only allows the modeler to express the spatial dimensions and features of the environment in real scale, but also provides modalities to capture complex crowd behaviors. In this paper, we propose an Agent-based Crowd Simulation & Analysis framework that incorporates the use of Anylogic Pedestrian library and integrates interoperate Anylogic Simulation environment with the external modules for optimization and analysis. Hence provides a runtime environment for analyzing complex situations, e.g., emergency evacuation strategies. The key features of the proposed framework include: (i) Ability to model large crowd in a spatially explicit environment at real-scale; (ii) Simulation of complex crowd behavior such as emergency evacuation; (iii) Interoperability of optimization and analysis modules with simulation runtime for evaluating evacuation strategies. We present a case study of Hajj scenario as a proof of concept and a test bed for identifying and evaluating optimal strategies for crowd evacuation