×

On the modeling of pedestrian motion. (English) Zbl 1185.90038

Summary: A model for the simulation of pedestrian flows and crowd dynamics has been developed. The model is based on a series of forces, such as: will forces (the desire to reach a place at a certain time), pedestrian collision avoidance forces, obstacle/wall avoidance forces; pedestrian contact forces, and obstacle/wall contact forces. Except for the will force, it is assumed that for any given pedestrian these forces are the result of only local (nearest neighbour) situations. The near-neighbour search problem is solved by an efficient incremental Delaunay triangulation that is updated at every timestep. In order to allow for general geometries a so-called background triangulation is used to carry all geographic information. At any given time the location of any given pedestrian is updated on this mesh. The results obtained to date show that the model performs well for standard benchmarks, and allows for typical crowd dynamics, such as lane forming, overtaking, avoidance of obstacles and panic behaviour.

MSC:

90B20 Traffic problems in operations research
91D10 Models of societies, social and urban evolution
37N99 Applications of dynamical systems
65D17 Computer-aided design (modeling of curves and surfaces)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Deere, S. J.; Galea, E. R.; Lawrence, P. J., A systematic methodology to assess the impact of human factors in ship design, Appl. Math. Modell., 33, 2, 867-883 (2009)
[2] Zheng, X.; Zhong, T.; Liu, M., Modeling crowd evacuation of a building based on seven methodological approaches, Build. Environ., 44, 437-445 (2009)
[3] (Schreckenberg, M.; Sharma, S. D., Pedestrian and Evacuation Dynamics (2002), Springer) · Zbl 0976.00018
[5] Hughes, R. L., A continuum theory for the flow of pedestrians, Trans. Res. Part B, 36, 507-535 (2002)
[6] Hughes, R. L., The flow of human crowds, Annu. Rev. Fluid Mech., 35, 169-182 (2003) · Zbl 1125.92324
[7] Blue, V. J.; Adler-Emergent, J. L., Fundamental pedestrian flows from cellular automata microsimulation, Trans. Res. Rec., 1644, 29-36 (1998)
[8] Blue, V. J.; Adler-Flow, J. L., Capacities from cellular automata modeling of proportional splits of pedestrians by direction, (Schreckenberg, M.; Sharma, S. D., Pedestrian and Evacuation Dynamics (2002), Springer), 115-122
[9] Dijkstra, J.; Jesurun, J.; Timmermans, H., A multi-agent cellular automata model of pedestrian movement, (Schreckenberg, M.; Sharma, S. D., Pedestrian and Evacuation Dynamics (2002), Springer), 173-180
[10] Kessel, A.; Klüpfel, H.; Wahle, J.; Schreckenberg, M., Microscopic simulation of pedestrian crowd motion, (Schreckenberg, M.; Sharma, S. D., Pedestrian and Evacuation Dynamics (2002), Springer), 193-202
[11] Schadschneider, A., Cellular automaton approach to pedestrian dynamics – theory, (Schreckenberg, M.; Sharma, S. D., Pedestrian and Evacuation Dynamics (2002), Springer), 75-86 · Zbl 0976.00018
[12] Isobe, M.; Adachi, T.; Nagatani, T., Experiment and simulation of pedestrian counter flow, Physica A, 336, 638-650 (2004)
[13] Helbing, D.; Molnar, P., Social force model for pedestrian dynamics, Phys. Rev. E, 51, 42824286 (1995)
[14] Helbing, D.; Farkas, I. J.; Molnár, P.; Vicsek, T., Simulation of pedestrian crowds in normal and evacuation situations, (Schreckenberg, M.; Sharma, S. D., Pedestrian and Evacuation Dynamics (2002), Springer), 21-58 · Zbl 0976.00018
[15] Lakoba, T. I.; Kaup, D. J.; Finkelstein, N. M., Modifications of the Helbing-Molnár-Farkas-Vicsek social force model for pedestrian evolution, Simulation, 81, 339 (2005)
[16] Fruin, J. J., Pedestrian Planning and Design (1971), Metropolitan Association of Urban Designers and Environmental Planners: Metropolitan Association of Urban Designers and Environmental Planners New York
[17] Young, S. B., Evaluation of pedestrian walking speeds in airport terminals, Trans. Res. Rec., 1674 (1999), Paper 99-0824
[18] Löhner, R., Applied CFD Techniques (2008), John Wiley & Sons
[19] Löhner, R.; Ambrosiano, J., A vectorized particle tracer for unstructured grids, J. Comput. Phys., 91, 1, 22-31 (1990) · Zbl 0718.65076
[20] Knuth, D. E., The Art of Computer Programming, vols. 1-3 (1973), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0302.68010
[21] Sedgewick, R., Algorithms (1983), Addison-Wesley · Zbl 0529.68002
[22] Munjiza, A.; Andrews, K. R.F., NBS contact detection algorithm for bodies of similar size, Int. J. Numer. Meth. Eng., 43, 131-149 (1998) · Zbl 0937.74079
[23] Munjiza, A.; Rougier, E.; John, N. W.M., MR linear contact detection algorithm, Int. J. Numer. Meth. Eng., 66, 46-71 (2006) · Zbl 1110.70302
[24] Löhner, R., The empty bin: a data structure for spatial search of time-varying data, Commun. Numer. Meth. Eng., 23, 12, 1111-1119 (2007) · Zbl 1127.74052
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.