The wave algorithm used to determine the optimal indoor route for smoke divers in case of fire and fumigation

Introduction. One of the main objectives, pursued by the information analysis support extended to smoke divers, is the preparation of indoor routes. Technical capabilities, represented by advanced remote monitoring systems, provide a fire extinguishing manager with the necessary information about the point of fire origin and mathematical tools allow to predict fire spreading characteristics. The goal of this work is to develop an algorithm for the preparation of an optimal indoor route for smoke divers to support management decisions in the event of fire. To achieve this goal, it is necessary to develop the theoretical framework and implement it in a software programme.Theoretical foundations. The theory of cellular automata is employed in this paper to simulate the routes of smoke divers inside a building. A cellular automaton with a Moore neighborhood is applied. We use differential equations, similar to the Kolmogorov equations, to monitor the fire parameters.Results and discussions. A modified wave algorithm was developed to determine the optimal indoor route. The software tool was applied to simulate the route of gas divers. Coefficients of importance were applied in the process of mathematical modeling; they took account of the prioritized work to be performed by smoke divers.Conclusions. The results of the study suggest that the algorithm allows to identify the optimal itinerary, thereby enabling the decision maker, responsible for sending teams of smoke divers to the work performance location, to make a reasonable choice of the point of entry for the personnel and machinery, as well as their itinerary inside the building.

A Cellular Automaton Model for Pedestrians’ Movements Influenced by Gaseous Hazardous Material Spreading

A cellular automaton (CA) model is proposed to simulate the egress of pedestrians while gaseous hazardous material is spreading. The advection-diffusion with source term is used to describe the propagation of gaseous hazardous material. It is incorporated into the CA model. The navigation field in our model is determined by the solution of the Eikonal equation. The state transition of a pedestrian relies on the arrival time of cells in the Moore neighborhood. Numerical experiments are investigated in a room with multiple exits, and their results are shown.

Predator–prey pattern formation driven by population diffusion based on Moore neighborhood structure

Diffusion-driven instability is a basic nonlinear mechanism for pattern formation. Therefore, the way of population diffusion may play a determinative role in the spatiotemporal dynamics of biological systems. In this research, we launch an investigation on the pattern formation of a discrete predator–prey system where the population diffusion is based on the Moore neighborhood structure instead of the von Neumann neighborhood structure widely applied previously. Under pattern formation conditions which are determined by Turing instability analysis, numerical simulations are performed to reveal the spatiotemporal complexity of the system. A pure Turing instability can induce the self-organization of many basic types of patterns as described in the literature, as well as new spiral-spot and labyrinth patterns which show the temporally oscillating and chaotic property. Neimark–Sacker–Turing and flip–Turing instability can lead to the formation of circle, spiral and much more complex patterns, which are self-organized via spatial symmetry breaking on the states that are homogeneous in space and non-periodic in time. Especially, the emergence of spiral pattern suggests that spatial order can generate from temporal disorder, implying that even when the predator–prey dynamics in one site is chaotic, the spatially global dynamics may still be predictable. The results obtained in this research suggest that when the way of population diffusion changes, the pattern formation in the predator–prey systems demonstrates great differences. This may provide realistic significance to explain more general predator–prey coexistence.

Analysis of the Quality of Pseudorandom Number Generators Based on Cellular Automata

The eighth chapter describes the studies of the presented generators using the ENT and NIST tests. For a complete description of the experiment, different initial settings were used. Tests were conducted for different sizes and for a different number of cells, which initially had a logical “1” states. Also, bit sequences of different lengths are formed. The results presented in this chapter indicate optimal sizes and optimal initial settings of cells of the cellular automaton. Generators are described on the basis of cellular automata with a Moore neighborhood. The obtained results are compared for all the pseudo-random number generators described earlier. Also, the generators were examined using graphical tests. The results of the graphical tests for the generators described in this manuscript are presented in this chapter. Test results are presented in tabular form and in graphical form.

WAVES IN ISOTROPIC TOTALISTIC CELLULAR AUTOMATA: APPLICATION TO REAL-TIME ROBOT NAVIGATION

Totalistic cellular automata (CA) are an efficient tool for simulating numerous wave phenomena in discrete media. However, their inherent anisotropy often leads to a significant deviation of the model results from experimental data. Here, we propose a computationally efficient isotropic CA with the standard Moore neighborhood. Our model exploits a single postulate: the information transfer in an isotropic medium occurs at constant rate. To fulfill this requirement, we introduce in each cell a local counter keeping track of the distance run by the wave from its source. This allows maintaining the wave velocity constant in all possible directions even in the presence of nonconductive local areas (obstacles) with complex spatial geometry. Then, we illustrate the model on the problem of real-time building of cognitive maps used for navigation of a mobile robot. The isotropic property of the CA helps obtaining “smooth” trajectories and hence natural robot movement. The accuracy and flexibility of the approach are proved experimentally by driving the robot to a target avoiding collisions with obstacles.

The social evolution of genocide across time and geographic space: Perspectives from evolutionary game theory

A standard evolutionary game theory model is used to reveal the interpersonal and geographic characteristics of a population that make it vulnerable to accepting the genocidal aims of political leaders. Under conditions identified in the space-less version of the model, genocide architects can engineer the social metamorphosis of a peaceful people-group into one that supports, or does not resist, the architects’ atrocity goals. The model reveals policy interventions that prevent the social evolution of genocide among the population. The model is then extended into geographic space by analyzing interactions among peaceful and aggressive phenotypes in a Moore neighborhood. Key concepts of the analyses are applied to the onset and spread of genocide during the Holocaust (1938-1945) and to the prevention of genocide in Côte d'Ivoire (2011). [JEL codes: C73, D74]

Evolution of Cooperation with Moore Neighborhood and Self-Playing Rule

Evolutionary spatial game is a promising way to unravel the mystery of cooperation, and it has been well recognized that spatial structure could enable cooperation to persist. Schweitzer et al.’s lattice model provides an innovative method to solve the problem. In this paper, we conduct simulations using the same von Neumann neighborhood as in Schweitzer et al.’s study (2002) and observe the effect of initial population and lattice size on the evolution of cooperation. Then, we extend the model with a more complicated Moore neighborhood and self-playing rule for each central player. Simulation results not only provide new evidence for the persistence of cooperation in the evolution with spatial structures, but also investigate critical conditions for the spatial coexistence or the invasion of cooperators and defectors with the more complicated neighborhood.