Quickest Paths in Simulations of Pedestrians

  title={Quickest Paths in Simulations of Pedestrians},
  author={Tobias Kretz and Andree Gro{\ss}e and Stefan Hengst and Lukas Kautzsch and Andrej Pohlmann and Peter Vortisch},
  journal={Adv. Complex Syst.},
This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions and intrusion into personal space do not produce motion on quickest paths. Therefore a special model… 
User equilibrium Route Assignment for Microscopic Pedestrian Simulation
The method includes a parameter which sets a threshold for the approximate minimum size of obstacles to generate routing alternatives and the resulting data structure for navigation is constructed such that it does not introduce artifacts to the movement of simulated pedestrians.
Pedestrian route choice model based on friction forces
The model is able to reproduce emergent behavior among agents, allowing the assumption that the friction equations may provide a suitable approach to route choice behavior and can also be used as an indirect measure of pedestrian delay.
Pedestrian simulation: a route choice model to assess urban environments
Analysis from simulations indicates that the agents’ behavior provides a promising approach for real case applications, especially with small differences in route lengths and higher congestion.
Selected Applications of a Dynamic Assignment Method for Microscopic Simulation of Pedestrians
In micro-simulation models of pedestrian dynamics where pedestrians move freely in two spatial dimensions (i.e. they are not restricted to links as vehicles are) it has so far not been possible to
Destination and route choice models for bidirectional pedestrian flow based on the social force model
The modified SFM is extended by using a discretisation grid to permit pedestrians to change their desired speed directions dynamically and can be used to reproduce the behavior of bidirectional pedestrians more really.
A Queuing Model Based on Social Attitudes
A computer model is presented that is able to capture different queuing patterns that the authors observe in every day life, and assumes that there are two basic attitudes, aggressive competition and cooperative getting in line.
Pedestrian Route Choice by Iterated Equilibrium Search
A method to overcome this problem is briefly summarized and applied with an example geometry which as a result is enhanced with routes with intermediate destination areas of certain shape and is used in some exemplary assignment calculations.
Microscopic and macroscopic models for pedestrian crowds
This thesis is concerned with microscopic and macroscopic models for pedes- trian crowds. In the first chapter, we consider pedestrians exit choices and model human behaviour in an evacuation
Calibration of a Pedestrian Route Choice Model with a Basis in Friction Forces
This paper presents a pedestrian route choice model and its calibration with real data. The model explicitly represents interaction between pedestrians as an impedance force influences their route


Pedestrian Traffic: on the Quickest Path
This work shows how to minimize unrealistic artifacts, as naive flood fill metrics deviate considerably from the Euclidean metric and in this respect yield large errors, do this with limited computational effort and keep agents’ movement at very low densities unaltered by using a flood fill dynamic potential field method.
The shortest time and/or the shortest path strategies in a CA FF pedestrian dynamics model
The focus of the paper is on mathematical formalization and implementation of these features into a model of pedestrian movement based on a stochastic cellular automata approach and a basis of the model obtained is the Floor Field model.
Evacuation Assistance for a Sports Arena Using a Macroscopic Network Model
The macroscopic network model for pedestrians described in this paper is part of the German research project Hermes. The purpose of Hermes is the development of an evacuation assistant. Key outputs
Modeling the Dynamic Route Choice of Pedestrians to Assess the Criticality of Building Evacuation
An event-driven way finding algorithm for pedestrians in a graph-based structure where pedestrians take their decisions based on the observed environment and are routed dynamically in the network using an appropriate cost benefit analysis function.
A mathematical model of pedestrian movement on the basis of the stochastic cellular automata approach is proposed. A floor field (FF) model is taken as a basis model. The FF models imply that virtual
Adaptive pedestrian dynamics based on geodesics
A new approach for adaptive path finding in microscopic simulations of pedestrian dynamics using a simple cellular automaton approach that guarantees that virtual pedestrians navigate along the steepest descent of the navigation field and thus follow geodesics.
Graph-based approaches for simulating pedestrian dynamics in building models
This paper presents different path-finding algorithms for simulating pedestrian dynamics in building models, and applies different algorithms, which are based on the developed visibility graph, to route the pedestrians from their sources to their destinations.
Centrifugal force model for pedestrian dynamics.
A centrifugal force model for pedestrian dynamics is developed and is able to reproduce the self-organization phenomena of lane formation for sparse flows and the jamming probability due to the arching at exits for crowd flows is provided.
A Modification of the Social Force Model by Foresight
The motion of pedestrian crowds can be modeled as a multi-body system of self driven particles with repulsive interaction, and a few simple situations are used to determine the simplest allowed functional form of the force function.