Placing an obstacle in front of a bottleneck has been proposed as a sound alternative to improve the flow of discrete materials in a wide variety of scenarios. Nevertheless, the physical reasons behind this behavior are not fully understood and the suitability of this practice has been recently challenged for pedestrian evacuations. In this work, we experimentally demonstrate that for the case of inert grains discharging from a silo, an obstacle above the exit leads to a reduction of clog formation via two different mechanisms: i) an alteration of the kinematic properties in the outlet proximities that prevents the stabilization of arches; and ii) an introduction of a clear anisotropy in the contact fabric tensor that becomes relevant when working at a quasi-static regime. Then, both mechanisms are encompassed using a single formulation that could be inspiring for other, more complex, systems.
We have introduced evolutionary game dynamics to a one-dimensional cellular- automaton to investigate evolution and maintenance of cooperative avoiding behavior of self-driven particles in bidirectional flow. In our model, there are two kinds of particles, which are right-going particles and left-going particles. They often face opponent particles, so that they swerve to the right or left stochastically in order to avoid conflicts. The particles reinforce their preferences of the swerving direction after their successful avoidance. The preference is also weakened by memory-loss effect. Result of our simulation indicates that cooperative avoiding behavior is achieved, i.e., swerving directions of the particles are unified, when the density of particles is close to 1/2 and the memory-loss rate is small. Furthermore, when the right-going particles occupy the majority of the system, we observe that their flow increases when the number of left-going particles, which prevent the smooth movement of right-going particles, becomes large. It is also investigated that the critical memory-loss rate of the cooperative avoiding behavior strongly depends on the size of the system. Small system can prolong the cooperative avoiding behavior in wider range of memory-loss rate than large system.
1 October 2017 in Physica A: Statistical Mechanics and its Applications
This study proposes a model of a totally asymmetric simple exclusion process on a single-channel lane with functions of site assignments along the pit lane. The system model attempts to insert a new particle to the leftmost site at a certain probability by randomly selecting one of the empty sites in the pit lane, and reserving it for the particle. Thereafter, the particle is directed to stop at the site only once during its travel. Recently, the system was determined to show a self-deflection effect, in which the site usage distribution biases spontaneously toward the leftmost site, and the throughput becomes maximum when the site usage distribution is slightly biased to the rightmost site. Our exact analysis describes this deflection effect and show a good agreement with simulations.
This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the rear of the queue existing at the leftmost site of the system. A particle at the head of the queue selects one of the empty sites in the parking lane and reserves it for stopping at once during its travel. The arriving time and staying time in the parking sites follow half-normal distributions. The random selections of empty sites are controlled by the bias of the exponential function. Our simulation results show the unique shape of site usage distributions. In addition, the number of reserved sites is found to increase with an S-shape curve as the bias to the rightmost site increases. To describe this phenomena, we propose an approximation model, which is derived from the birth-death process and extreme order statistics. A queueing model that takes the effect of distance from the leftmost site of the traveling lane into consideration is further proposed. Our approximation model properly describes the distributions of site usage, and the proposed queueing model shows good agreement with the simulation results.