User Equilibrium Route Assignment for Microscopic Pedestrian Simulation
arXiv:1401.0799 · doi:10.1142/S0219525914500106
Abstract
For the simulation of pedestrians a method is introduced to find routing alternatives from any origin position to a given destination area in a given geometry composed of walking areas and obstacles. The method includes a parameter which sets a threshold for the approximate minimum size of obstacles to generate routing alternatives. The resulting data structure for navigation is constructed such that it does not introduce artifacts to the movement of simulated pedestrians and that locally pedestrians prefer to walk on the shortest path. The generated set of routes can be used with iterating static or dynamic assignment methods.
References in corpus (18)
- Social Force Model for Pedestrian Dynamics
- Simulating Dynamical Features of Escape Panic
- Simulation of pedestrian dynamics using a 2-dimensional cellular automaton
- Simulation of evacuation processes using a bionics-inspired cellular automaton model for pedestrian dynamics
- Generalized Centrifugal Force Model for Pedestrian Dynamics
- Basics of Modelling the Pedestrian Flow
- Extended floor field CA model for evacuation dynamics
- Mean Field Theory for Pedestrian Outflow through an Exit
- Comparison of Various Methods for the Calculation of the Distance Potential Field
- Pedestrian Traffic: on the Quickest Path
- Quickest Paths in Simulations of Pedestrians
- The F.A.S.T.-Model
- Modelling dynamic route choice of pedestrians to assess the criticality of building evacuation
- The Effect of Integrating Travel Time
- An Example of Complex Pedestrian Route Choice
- Solving the Direction Field for Discrete Agent Motion
- Applications of the Dynamic Distance Potential Field Method
- Counterflow in Evacuations