Dynamic Assignment in Microsimulations of Pedestrians

A generic method for dynamic assignment used with microsimulation of pedestrian dynamics is introduced. As pedestrians - unlike vehicles - do not move on a network, but on areas they in principle can choose among an infinite number of routes. To apply assignment algorithms one has to select for each OD pair a finite (realistically a small) number of relevant representatives from these routes. This geometric task is the main focus of this contribution. The main task is to find for an OD pair the relevant routes to be used with common assignment methods. The method is demonstrated for one single OD pair and exemplified with an example.

[1]  Hubert Klüpfel,et al.  Fundamentals of Pedestrian and Evacuation Dynamics , 2009, Multi-Agent Systems for Traffic and Transportation Engineering.

[2]  Standort Duisburg,et al.  A Cellular Automaton Model for Crowd Movement and Egress Simulation , 2003 .

[3]  Ekaterina Kirik,et al.  The shortest time and/or the shortest path strategies in a CA FF pedestrian dynamics model , 2009, 0906.4265.

[5]  Tobias Kretz,et al.  An Example of Complex Pedestrian Route Choice , 2011 .

[6]  J. Wardrop.  ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH. , 1952 .

[7]  Peter Vortisch,et al.  Comparison of Various Methods for the Calculation of the Distance Potential Field , 2008, ArXiv.

[8]  Karsten Lehmann,et al.  User equilibrium Route Assignment for Microscopic Pedestrian Simulation , 2014, Adv. Complex Syst..

[9]  Serge P. Hoogendoorn,et al.  DYNAMIC USER-OPTIMAL ASSIGNMENT IN CONTINUOUS TIME AND SPACE , 2004 .

[10]  Stefan Holl,et al.  Modeling the Dynamic Route Choice of Pedestrians to Assess the Criticality of Building Evacuation , 2011, Adv. Complex Syst..

[11]  Peter Vortisch,et al.  Pedestrian Flow at Bottlenecks - Validation and Calibration of Vissim's Social Force Model of Pedestrian Traffic and its Empirical Foundations , 2008, ArXiv.

[12]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Michael Schreckenberg,et al.  F.A.S.T. - Floor field- and Agent-based Simulation Tool , 2006, ArXiv.

[14]  Andreas Schadschneider,et al.  Simulation of evacuation processes using a bionics-inspired cellular automaton model for pedestrian dynamics , 2002 .

[15]  Andreas Schadschneider,et al.  Extended Floor Field CA Model for Evacuation Dynamics , 2004, IEICE Trans. Inf. Syst..

[16]  Karsten Lehmann,et al.  Pedestrian Route Choice by Iterated Equilibrium Search , 2014, ArXiv.

[17]  Peter Vortisch,et al.  Quickest Paths in Simulations of Pedestrians , 2011, Adv. Complex Syst..

[18]  Guido Gentile,et al.  Linear User Cost Equilibrium: The New Algorithm for Traffic Assignment in VISUM , 2009 .

[19]  Michael Schultz,et al.  Solving the Direction Field for Discrete Agent Motion , 2010, ACRI.

[20]  Serge P. Hoogendoorn,et al.  Pedestrian route-choice and activity scheduling theory and models , 2004 .

[21]  Tobias Kretz,et al.  Pedestrian traffic: on the quickest path , 2009, ArXiv.

[22]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[23]  Daniel Thalmann,et al.  Crowds of Moving Objects: Navigation Planning and Simulation , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[24]  Hillel Bar-Gera,et al.  Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..

[25]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[26]  A. Schadschneider,et al.  Simulation of pedestrian dynamics using a two dimensional cellular automaton , 2001 .

[27]  Dinesh Manocha,et al.  PLEdestrians: a least-effort approach to crowd simulation , 2010, SCA '10.