Related papers: The use of dynamic distance potential fields for p…
This study investigates the dynamics of pedestrian crossing flows with varying crossing angles $\alpha$ to classify different scenarios and derive implications for crowd management. Probability density functions of four key…
We consider a random walker whose motion is tethered around a focal point. We use two models that exhibit the same spatial dependence in the steady state but widely different dynamics. In one case, the walker is subject to a deterministic…
Understanding human mobility is important for the development of intelligent mobile service robots as it can provide prior knowledge and predictions of human distribution for robot-assisted activities. In this paper, we propose a…
We introduce a model of interacting random walkers on a finite one dimensional chain with absorbing boundaries or targets at the ends. Walkers are of two types: informed particles that move ballistically towards a given target, and…
Random walks and related spatial stochastic models have been used in a range of application areas including animal and plant ecology, infectious disease epidemiology, developmental biology, wound healing, and oncology. Classical random walk…
Minimizing social contact is an important tool to reduce the spread of diseases, but harms people's well-being. This and other, more compelling reasons, urge people to walk outside periodically. The present simulation explores how…
Random walks of particles on a lattice are a classical paradigm for the microscopic mechanism underlying diffusive processes. In deterministic walks, the role of space and time can be reversed, and the microscopic dynamics can produce quite…
The relation between flow and density is an essential quantitative characteristic to describe the efficiency of traffic systems. We have performed experiments with single-file motion of bicycles and compare the results with previous studies…
Inferring plausible node mobility based only on information from wireless contact traces is a difficult problem. Working with mobility information allows richer protocol simulations, particularly in dense networks, but requires complex…
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be efficient in solving high dimensional problems. Even though…
We study a one-dimensional random walk with memory in which the step lengths to the left and to the right evolve at each step in order to reduce the wandering of the walker. The feedback is quite efficient and lead to a non-diffusive walk.…
In this paper we develop a framework for parameter estimation in macroscopic pedestrian models using individual trajectories -- microscopic data. We consider a unidirectional flow of pedestrians in a corridor and assume that the velocity…
We consider a kinetic theory approach to model the evacuation of a crowd from bounded domains. The interactions of a person with other pedestrians and the environment, which includes walls, exits, and obstacles, are modeled by using tools…
In this paper we propose a classification of crowd models in built environments based on the assumed pedestrian ability to foresee the movements of other walkers. At the same time, we introduce a new family of macroscopic models, which make…
The Single-Source Shortest Path (SSSP) problem is well-known for the challenges in developing fast, practical, and work-efficient parallel algorithms. This work introduces a novel shortest path search method. It allows paths with different…
The social-force model is systematically modified to achieve a satisfying agreement with the fundamental diagram. Furthermore, our modification allows an efficient computation of the simulation. Finally, different simulation-results will be…
Stochastic particle--based models are useful tools for describing the collective movement of large crowds of pedestrians in crowded confined environments. Using descriptions based on the simple exclusion process, two populations of…
We develop a non-empirical scheme to search for the minimum-energy escape paths from the minima of the potential surface to unknown saddle points nearby. A stochastic algorithm is constructed to move the walkers up the surface through the…
This paper suggests a model for the motion of tagged pedestrians: pedestrians moving towards a specified targeted destination, which they are forced to reach. It aims to be a decision-making tool for the positioning of fire fighters,…
Pedestrian crowding occurs more frequent. As a result of the increasing pedestrian demand in public space, the limits of pedestrian spaces are of increasing interest. Some research on the maximum demand that can flow through a cross-section…