基于元胞自动机的对向行人交通流仿真研究

基于元胞自动机对对向行人交通流进行仿真研究. 模型利用四个动态参数反映行人移动区域和其视野范围内的实际情况,从而决定行人的行为选择,行人可以根据自身周围的情况选择前进、后退、等待、左右移动、交换位置等行为. 仿真研究不同方向比例与不同系统规模的对向行人流的速度-密度、流量-密度关系. 研究结果表明,系统存在相位转换和临界密度,方向比例和系统规模对行人流的速度-密度、流量-密度关系曲线的形状和系统临界密度值有一定的影响. 关键词： 元胞自动机 对向行人流 动态参数 临界密度     

基于元胞自动机的行人视线受影响的疏散流仿真研究

基于元胞自动机对视线受影响的行人疏散流进行仿真研究.模型根据行人视野半径将疏散空间划分为可见安全出口区域、可见墙壁区域和盲目区域;利用两个动态参数描述行人在不同移动区域内的疏散特征,从而决定行人的行为选择,包括行人定向移动、沿墙移动和正常疏散移动等行为.仿真研究了行人在墙壁上存在疏散指示标志的疏散空间内,视线受影响时采用随机定向寻墙沿墙移动疏散策略的情况下,行人视野半径对行人疏散时间的影响.研究表明,行人疏散时间不仅受行人视野半径的影响,而且还与安全出口的宽度和安全出口利用率有关.     

三维空间行人疏散的元胞自动机模型

为了有效刻画行人在三维空间中的疏散状况,结合阶梯因素提出了一种新的三维元胞自动机模型,该模型首先基于位置吸引力和碰撞可能性给出了行人移动概率的计算公式,并通过定义元胞演化过程阐述其疏散策略,同时,利用建立的仿真平台进行实验,深入分析了疏散时间、出口流率、出口宽度、初始行人密度以及系统平均速度之间的关系,以此获得更加符合实际情况的行人流特征,结果表明,疏散时间、出口流率与初始行人密度呈现正相关,而与出口宽度呈现负相关,并且系统平均速度和出口宽度对于最优疏散时间存在一个理想阈值。     

初始位置布局不平衡的疏散行人流仿真研究

行人初始位置布局不平衡的多安全出口疏散过程, 是行人疏散流仿真研究的热点. 利用行人流动态参数仿真模型, 在实际距离和假想距离"极大极小"路径选择机理的基础上, 改进假想距离的计算方法及其拥堵计算区域, 实现疏散过程的动态平衡; 提出行人位置布局的不平衡系数, 以描述疏散空间内行人初始位置布局的不平衡性. 从行人初始位置随机和固定布局的角度, 仿真研究正常疏散环境下行人布局的不平衡性对疏散时间的影响, 并将仿真结果与原始模型做对比分析. 研究表明, 模型能有效地实现行人流疏散过程的动态平衡, 行人疏散时间受行人位置或安全出口布局的影响较小, 而与安全出口总宽度、 行人的初始数量以及拥堵感知系数有关.     

菱形网格的行人疏散元胞自动机模型

利用改进的层次域元胞自动机模型,研究了正菱形网格空间中的行人疏散问题.这类网格可以避免行人贴近房间墙壁或障碍物,转移概率考虑了各种逃生受阻因素.数值仿真显示,出口处的行人分布与实验快照展示的行人分布基本相同,疏散时间和出口宽度呈线性关系,行人流率接近实验结果.     

基于元胞自动机和复杂网络理论的双向行人流建模

通过设计行人行走倾向性调查实验,分析了行人的行走倾向性特征. 引入前进系数、右倾系数、超越系数以及影响修正系数等对元胞自动机(CA) 基本模型中的转移概率进行修正,建立了考虑行人行走倾向性特征的CA行人仿真模型. 针对该模型中的行人群体,依据k-近邻作用原理,构建行人复杂网络. 通过计算机仿真,揭示了行人流密度、速度和流量的关系以及仿真过程中出现的自组织现象.进一步分析仿真输出的行人流基本参数和行人复杂网络主要特征参数,发现对同一行人流,其平均速度和网络平均路径长度均随着行人流状态的改变而变化.最后, 通过平均路径长度和平均速度的数据拟合,得出两者之间存在着线性负相关关系的结论, 即具有较小网络平均路径长度的行人流具有较高的平均速度.     

Simulation of pedestrian flow based on cellular automata: A case of pedestrian crossing street at section in China

One of the purposes of pedestrian studies is to evaluate the effects of a proposed program on the pedestrian facilities before its implementation. In order to evaluate the level of service (LOS) of a pedestrian facility, a microscopic model is built to simulate the process of pedestrian crossing street. Most of the existing models focus on the occupant evacuation flow in buildings; however, they are not appropriate for pedestrians in the traffic. According to the characteristics of pedestrian crossing street at signalized crosswalks, we build a model based on cellular automata. Both of the system size and cell size are coordinate with the reality. Depending on the contrast of three parameters of pedestrian flow between simulation data and the reality data, we found that this model is analogous to the real process of pedestrian crossing street at signalized sections. Finally, simulation and its results can provide guidance for evaluating the effects of pedestrian facilities before their implementation.     

Study on bi-direction pedestrian flow using cellular automata simulation

A simulation of bi-direction pedestrian flow based on cellular automata (CA) will be presented from two aspects: direction split and pedestrians’ walking habit in this paper. The simulation uses Dynamic Parameters Model (DPM) to simplify tactically the decision-making process of pedestrians in their movements. A new parameter right-hand parameter is introduced to describe the pedestrians’ walking preference. The relationships of velocity–density and flow–density will be studied and analyzed. It is found that there are phase transitions at the critical density point, and the pedestrian flow shows distinctive characteristics at different phases with different relationships of velocity–density and flow–density. It is also found that direction split and pedestrians’ walking habit affect the value of critical density point and the figures of velocity–density and volume–density curves. In conclusion, the simulation can reflect and describe some pedestrian flow self-organization phenomena and transition trend of empirical pedestrian flow curves.     

Annealed and quenched inhomogeneous cellular automata (INCA)

A probabilistic one-dimensional cellular automaton model by Domany and Kinzel is mapped into an inhomogeneous cellular automaton with the Boolean functions XOR and AND as transition rules. Wolfram's classification is recovered by varying the frequency of these two simple rules and by quenching or annealing the inhomogeneity. In particular, class 4 is related to critical behavior in directed percolation. Also, the critical slowing down of second-order phase transitions is related to a stochastic version of the classical halting problem of computation theory.     

基于元胞自动机的行人疏散流仿真研究

基于元胞自动机对行人疏散流进行仿真研究.模型利用两个动态参数反映行人移动区域内的疏散情况,从而决定行人的行为选择.模型中行人可以根据自身周围的情况选择移动、等待行为.本文仿真研究了行人在正常疏散环境下,系统规模、疏散人数、安全出口宽度、多个安全出口布局对行人疏散时间的影响.研究结果表明,行人疏散时间随行人数量呈线性增加;随安全出口宽度呈负指数性减少;同时,多个安全出口布局的不平衡也会对行人的疏散过程和疏散时间产生一定的影响. 关键词： 元胞自动机 行人疏散流 动态参数 疏散时间     

Calculation of the permeability of porous media using hydrodynamic cellular automata

The permeability of two-dimensional porous media is calculated numerically as a function of porosity using the hydrodynamic cellular automata (lattice gas) approach. Results are presented for systems with up to 22 million sites (8192×2688). For randomly distributed solid obstacles whose macroscopic dimensions are much longer than the mean free path of particles in the fluid, the permeability varies with porosity as (–0.6)/(1–) for>0.7. When the solid obstacles are much smaller than the mean free path of particles in the fluid, i.e., when they form a dust of point objects, then such a relationship no longer holds and the permeability is more than an order of magnitude smaller than for the former case. The program used for the simulations is discussed and a listing is presented in the Appendix which achieved a sustained speed of 185 million sites updated per second on a single processor of the Cray-YMP. (On a Sun Sparc Workstation, the same program ran about 100 times slower.)     

Simulating three-dimensional hydrodynamics on a cellular automata machine

We demonstrate how three-dimensional fluid flow simulations can be carried out on the Cellular Automata Machine 8 (CAM-8), a special-purpose computer for cellular automata computations. The principal algorithmic innovation is the use of a lattice gas model with a 16-bit collision operator that is specially adapted to the machine architecture. It is shown how the collision rules can be optimized to obtain a low viscosity of the fluid. Predictions of the viscosity based on a Boltzmann approximation agree well with measurements of the viscosity made on CAM-8. Several test simulations of flows in simple geometries—channels, pipes, and a cubic array of spheres-are carried out. Measurements of average flux in these geometries compare well with theoretical predictions.     

Simulation of pedestrian evacuation based on an improved dynamic parameter model

An improved dynamic parameter model is presented based on cellular automata. The dynamic parameters, including direction parameter, empty parameter, and cognition parameter, are formulated to simplify tactically the process of making decisions for pedestrians. The improved model reflects the judgement of pedestrians on surrounding conditions and the action of choosing or decision. According to the two-dimensional cellular automaton Moore neighborhood we establish the pedestrian moving rule, and carry out corresponding simulations of pedestrian evacuation. The improved model considers the impact of pedestrian density near exits on the evacuation process. Simulated and experimental results demonstrate that the improvement makes sense due to the fact that except for the spatial distance to exits, people also choose an exit according to the pedestrian density around exits. The impact factors α, β, and γ are introduced to describe transition payoff, and their optimal values are determined through simulation. Moreover, the effects of pedestrian distribution, pedestrian density, and the width of exits on the evacuation time are discussed. The optimal exit layout, i.e., the optimal position and width, is offered. The comparison between the simulated results obtained with the improved model and that from a previous model and experiments indicates that the improved model can reproduce experimental results well. Thus, it has great significance for further study, and important instructional meaning for pedestrian evacuation so as to reduce the number of casualties.     

双出口房间内疏散行人流的仿真和实验研究

为研究行人疏散过程中的路径选择行为, 提出了一个基于元胞自动机的行人微观模型, 并组织了三组双出口教室内的学生疏散实验. 模型中, 行人路径选择行为受其到出口距离、前方路径通行能力和行人间排斥力影响. 通过观察实验结果, 得到一些相关现象. 利用实验结果对模型参数进行校正. 利用校正模型对该教室内疏散学生流进行仿真, 结果表明 模型能有效地刻画教室内学生流的疏散特征, 疏散时间随学生人数线性增加. 该研究有助于类似场景中行人疏散策略和方案的制定. 关键词： 元胞自动机 行人疏散 仿真 实验     

Periodic behavior of cellular automata

I propose an explanation of the observation of a globally synchronized behavior of deterministic cellular automata and coupled map lattices, together with local fluctuations.     

一种基于元胞自动机的自适应网络病毒传播模型

自适应网络是节点动力学和网络动力学相互作用和反馈的演化网络. 基于元胞自动机建立自适应网络中易感-感染-易感(susceptible-infected-susceptible)的病毒传播模型,研究节点为了规避病毒传播所采取的多种网络重连规则对病毒传播及网络统计特征的影响. 结果表明:自适应网络中的重连规则可以有效减缓病毒传播速度,降低病毒传播规模;随机重连规则使得网络统计特征趋于随机网络;基于元胞自动机建立的传播模型清晰地表达了病毒在传播过程中的双稳态现象. 关键词： 自适应网络 传播动力学 网络动力学 元胞自动机     

通过博弈的室内行人疏散动力学研究

在室内行人疏散过程中,行人博弈对疏散效率有着重要的影响.本文把抵制博弈策略更新的强度定义为抵制强度. 为了研究抵制强度对疏散效率的影响, 通过在行人博弈策略更新的概率中引入抵制强度,基于元胞自动机模型数值计算在不同的行人密度, 出口宽度下疏散总时间随抵制强度变化的关系.结果表明: 室内行人疏散过程中, 抵制强度小会使得争抢行为极其容易蔓延. 当行人密度小且出口宽大时, 输入以急速疏散为主的规范信息,鼓励行人模仿优胜者更新博弈策略, 当行人密度大且出口狭小时, 输入以避让为主的规范信息抑制行人争抢,都能提高疏散效率. 最后找出不同条件下与最短疏散总时间相对应的优化抵制强度, 为提高室内行人疏散效率提供一个新的视角.     

Fuzzy cellular automata models in immunology

The self-nonself character of antigens is considered to be fuzzy. The Chowdhuryet al. cellular automata model is generalized accordingly. New steady states are found. The first corresponds to a below-normal help and suppression and is proposed to be related to autoimmune diseases. The second corresponds to a below-normal B-cell level.     

Flow through a porous membrane simulated by cellular automata and by finite elements

Computational results concerning incompressible viscous flow through two channels connected by a porous membrane are presented. The example is extraordinary for its four different types of boundary conditions that are necessary to make the problem complete. The solution is accomplished by two methods: by cellular automata and by finite elements. The numerical means to satisfy the boundary conditions are given for both methods. Overall agreement is achieved, but significant differences show up in details.