A discrete contact model for crowd motion

Bertrand Maury; Juliette Venel

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique (2011)

  • Volume: 45, Issue: 1, page 145-168
  • ISSN: 0764-583X

Abstract

top
The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the underlying mathematical framework, and we explain how recent results by J.F. Edmond and L. Thibault on the sweeping process by uniformly prox-regular sets can be adapted to handle this situation in terms of well-posedness. We propose a numerical scheme for this contact dynamics model, based on a prediction-correction algorithm. Numerical illustrations are finally presented and discussed.

How to cite

top

Maury, Bertrand, and Venel, Juliette. "A discrete contact model for crowd motion." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 45.1 (2011): 145-168. <http://eudml.org/doc/273252>.

@article{Maury2011,
abstract = {The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the underlying mathematical framework, and we explain how recent results by J.F. Edmond and L. Thibault on the sweeping process by uniformly prox-regular sets can be adapted to handle this situation in terms of well-posedness. We propose a numerical scheme for this contact dynamics model, based on a prediction-correction algorithm. Numerical illustrations are finally presented and discussed.},
author = {Maury, Bertrand, Venel, Juliette},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
keywords = {crowd motion model; contact dynamics; convex analysis; differential inclusion; prox-regularity},
language = {eng},
number = {1},
pages = {145-168},
publisher = {EDP-Sciences},
title = {A discrete contact model for crowd motion},
url = {http://eudml.org/doc/273252},
volume = {45},
year = {2011},
}

TY - JOUR
AU - Maury, Bertrand
AU - Venel, Juliette
TI - A discrete contact model for crowd motion
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 2011
PB - EDP-Sciences
VL - 45
IS - 1
SP - 145
EP - 168
AB - The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the underlying mathematical framework, and we explain how recent results by J.F. Edmond and L. Thibault on the sweeping process by uniformly prox-regular sets can be adapted to handle this situation in terms of well-posedness. We propose a numerical scheme for this contact dynamics model, based on a prediction-correction algorithm. Numerical illustrations are finally presented and discussed.
LA - eng
KW - crowd motion model; contact dynamics; convex analysis; differential inclusion; prox-regularity
UR - http://eudml.org/doc/273252
ER -

References

top
  1. [1] N. Bellomo and C. Dogbe, On the modelling crowd dynamics from scalling to hyperbolic macroscopic models. Math. Mod. Meth. Appl. Sci.18 (2008) 1317–1345. Zbl1198.92036MR2438218
  2. [2] F. Bernicot and J. Venel, Existence of sweeping process in Banach spaces under directional prox-regularity. J. Convex Anal.17 (2010) 451–484. Zbl1204.34083MR2675657
  3. [3] V. Blue and J.L. Adler, Cellular automata microsimulation for modeling bi-directional pedestrian walkways. Transp. Res. B35 (2001) 293–312. 
  4. [4] A. Borgers and H. Timmermans, City centre entry points, store location patterns and pedestrian route choice behaviour: A microlevel simulation model. Socio-Econ. Plann. Sci. 20 (1986) 25–31. 
  5. [5] A. Borgers and H. Timmermans, A model of pedestrian route choice and demand for retail facilities within inner-cityshopping areas. Geogr. Anal.18 (1986) 115–128. 
  6. [6] M. Bounkhel and L. Thibault, On various notions of regularity of sets in nonsmooth analysis. Nonlinear Convex Anal.48 (2002) 223–246. Zbl1012.49013MR1870754
  7. [7] H. Brezis, Opérateurs Maximaux Monotones et Semi-groupes de Contractions dans les Espaces de Hilbert. AM, North Holland (1973). Zbl0252.47055MR348562
  8. [8] C. Burstedde, K. Klauck, A. Schadschneider and J. Zittartz, Simulation of pedestrian dynamics using a two-dimensional cellular automaton. Physica A295 (2001) 507–525. Zbl0978.90018
  9. [9] G. Buttazzo, C. Jimenez and E. Oudet, An optimization problem for mass transportation with congested dynamics. SIAM J. Control Optim.48 (2009) 1961–1976. Zbl1282.49035MR2516195
  10. [10] P.G. Ciarlet, Introduction à l'analyse numérique matricielle et à l'optimisation. Masson, Paris (1990). Zbl0488.65001
  11. [11] F.H. Clarke, R.J. Stern and P.R. Wolenski, Proximal smoothness and the lower-c2 property. J. Convex Anal.2 (1995) 117–144. Zbl0881.49008MR1363364
  12. [12] F.H. Clarke, Y.S. Ledyaev, R.J. Stern and P.R. Wolenski, Nonsmooth Analysis and Control Theory. Springer-Verlag, New York, Inc. (1998). Zbl1047.49500MR1488695
  13. [13] W. Daamen, Modelling passenger flows in public transport facilities. Ph.D. Thesis, Technische Universiteit Delft, The Netherlands (2004). 
  14. [14] J.A. Delgado, Blaschke's theorem for convex hypersurfaces. J. Diff. Geom.14 (1979) 489–496. Zbl0482.53044MR600609
  15. [15] C. Dogbé, On the numerical solutions of second order macroscopic models of pedestrian flows. Comput. Math. Appl.56 (2008) 1884–1898. Zbl1152.65461MR2445334
  16. [16] J.F. Edmond and L. Thibault, Relaxation of an optimal control problem involving a perturbed sweeping process. Math. Program., Ser. B 104 (2005) 347–373. Zbl1124.49010MR2179241
  17. [17] J.F. Edmond and L. Thibault, BV solutions of nonconvex sweeping process differential inclusion with perturbation. J. Diff. Equ.226 (2006) 135–179. Zbl1110.34038MR2232433
  18. [18] J.J. Fruin, Design for pedestrians: A level-of-service concept. Highway Research Record355 (1971) 1–15. 
  19. [19] S. Gwynne, E.R. Galea, P.J. Lawrence and L. Filippidis, Modelling occupant interaction with fire conditions using the buildingEXODUS evacuation model. Fire Saf. J.36 (2001) 327–357. 
  20. [20] D. Helbing, A fluid-dynamic model for the movement of pedestrians. Complex Syst.6 (1992) 391–415. Zbl0776.92016MR1211939
  21. [21] D. Helbing and P. Molnár, Social force model for pedestrians dynamics. Phys. Rev. E51 (1995) 4282–4286. 
  22. [22] D. Helbing, I.J. Farkas and T. Vicsek, Simulating dynamical features of escape panic. Nature 407 (2000) 487. 
  23. [23] L.F. Henderson, The stastitics of crowd fluids. Nature229 (1971) 381–383. 
  24. [24] S.P. Hoogendoorn and P.H.L. Bovy, Gas-kinetic modeling and simulation of pedestrian flows. Transp. Res. Rec.1710 (2000) 28–36. 
  25. [25] S.P. Hoogendoorn and P.H.L. Bovy, Pedestrian route-choice and activity scheduling theory and models. Transp. Res. B38 (2004) 169–190. 
  26. [26] S.P. Hoogendoorn and P.H.L. Bovy, Dynamic user-optimal assignment in continuous time and space. Transp. Res. B38 (2004) 571–592. 
  27. [27] R. Hughes, The flow of large crowds of pedestrians. Math. Comput. Simul.53 (2000) 367–370. 
  28. [28] R. Hughes, A continuum theory for the flow of pedestrians. Transp. Res. B36 (2002) 507–535. 
  29. [29] R. Kimmel and J. Sethian, Fast marching methods for computing distance maps and shortest paths. Technical Report 669, CPAM, Univ. of California, Berkeley (1996). Zbl0926.65106
  30. [30] A. Kirchner and A. Schadschneider, Simulation of evacuation processes using a bionics-inspired cellular automaton model for pedestrians dynamics. Physica A312 (2002) 260–276. Zbl0997.90017
  31. [31] H. Klüpfel and T. Meyer-König, Characteristics of the pedgo software for crowd movement and egress simulation, in Pedestrian and Evacuation Dynamics 2003, E. Galea Ed., University of Greenwich, CMS Press, London (2003) 331–340. 
  32. [32] A. Lefebvre, Modélisation numérique d'écoulements fluide/particules, Prise en compte des forces de lubrification. Ph.D. Thesis, Université Paris-Sud XI, Faculté des sciences d'Orsay, France (2007). 
  33. [33] A. Lefebvre, Numerical simulations of gluey particles. ESAIM: M2AN 43 (2009) 53–80. Zbl1163.76056MR2494794
  34. [34] G.G. Løvås, Modelling and simulation of pedestrian traffic flow. Transp. Res. B28 (1994) 429–443. 
  35. [35] B. Maury and J. Venel, Un modèle de mouvement de foule. ESAIM: Proc. 18 (2007) 143–152. Zbl05213262MR2404902
  36. [36] B. Maury and J. Venel, Handling of contacts on crowd motion simulations, in Trafic and Granular Flow '07, Springer (2009) 171–180. Zbl1161.90349
  37. [37] B. Maury, A. Roudneff-Chupin and F. Santambrogio, A macroscopic crowd motion model of gradient flow type. Math. Mod. Meth. Appl. Sci. (to appear). Available at http://cvgmt.sns.it/papers/maurousan09/. Zbl1223.35116
  38. [38] J.J. Moreau, Décomposition orthogonale d'un espace hilbertien selon deux cônes mutuellement polaires. C. R. Acad. Sci., Ser. I 255 (1962) 238–240. Zbl0109.08105MR139919
  39. [39] J.J. Moreau, Evolution problem associated with a moving convex set in a Hilbert space. J. Diff. Equ.26 (1977) 347–374. Zbl0356.34067MR508661
  40. [40] K. Nagel, From particle hopping models to traffic flow theory. Transp. Res. Rec.1644 (1998) 1–9. 
  41. [41] P.D. Navin and R.J. Wheeler, Pedestrian flow characteristics. Traffic Engineering39 (1969) 31–36. 
  42. [42] A. Schadschneider, Cellular automaton approach to pedestrian dynamics-theory, in Pedestrian and Evacuation Dynamics, M. Schreckenberg and S.D. Sharma Eds., Springer, Berlin (2001) 75–85. 
  43. [43] A. Schadschneider, A. Kirchner and K. Nishinari, From ant trails to pedestrian dynamics. Appl. Bionics & Biomechanics 1 (2003) 11–19. 
  44. [44] G.K. Still, New computer system can predict human behavior response to building fires. Fire84 (1993) 40–41. 
  45. [45] J. Venel, Modélisation mathématique et numérique des mouvements de foule. Ph.D. Thesis, Université Paris-Sud XI, France, available at: http://tel.archives-ouvertes.fr/tel-00346035/fr (2008). 
  46. [46] J. Venel, Integrating strategies in numerical modelling of crowd motion, in Pedestrian and Evacuation Dynamics '08, W.W.F. Klingsch, C. Rogsch, A. Schadschneider and M. Schreckenberg Eds., Springer, Berlin Heidelberg (2010) 641–646. 
  47. [47] J. Venel, Numerical scheme for a whole class of sweeping process. Available at: http://arxiv.org/abs/0904.2694v2 (submitted). 
  48. [48] U. Weidmann, Transporttechnik der fussgaenger. Technical Report 90, Schriftenreihe des Instituts für Verkehrsplanung, Transporttechnik, Strassen-und Eisenbahnbau, ETH Zürich, Switzerland (1993). 
  49. [49] S.J. Yuhaski and J.M. Macgregor Smith, Modelling circulation systems in buildings using state dependent queueing models. Queue. Syst.4 (1989) 319–338. Zbl0669.90050MR1018524

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.