Abstract
Many microscopic models for crowd dynamics use floor fields to navigate agents through geometries. Recently, dynamic floor fields were introduced which adapt to changes in geometry and the density of crowds. They significantly increase the realism of floor field-based simulations. However, the computation of floor fields is time consuming. In case of multiple or dynamic floor fields, which require frequent recomputations, the total simulation run time is dominated by their computation. We present an algorithm to construct floor fields for continuous space models that uses unstructured meshes. Due to the geometrical flexibility of unstructured meshes, our method reduces the computational complexity by using fewer but well-positioned mesh points.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Devillers, O.: The Delaunay hierarchy. Int. J. Found. Comput. Sci. 13(02), 163–180 (2002)
Devillers, O., Pion, S., Teillaud, M.: Walking in a triangulation. In: 17th Annual ACM Symposium on Computational Geometry (SCG), Boston, June 2001, pp. 106–114 (2001)
Hartmann, D., Mille, J., Pfaffinger, A., Royer, C.: Dynamic medium scale navigation using dynamic floor fields. In: Weidmann, U., Kirsch, U., Schreckenberg, M. (eds.) Pedestrian and Evacuation Dynamics 2012, pp. 1237–1249. Springer, Cham (2014)
Jeong, W.-K., Whitaker, R.T.: A fast iterative method for eikonal equations. SIAM J. Sci. Comput. 30(5), 2512–2534 (2008)
Kimmel, R., Sethian, J.A.: Computing geodesic paths on manifolds. In: Proceedings of the National Academy of Sciences of the United States of America, vol. 95, pp. 8431–8435. National Academy of Sciences, Washington (1998)
Köster, G., Zönnchen, B.: Queuing at bottlenecks using a dynamic floor field for navigation. In: The Conference in Pedestrian and Evacuation Dynamics 2014, Delft. Transportation Research Procedia, pp. 344–352, (2014)
Persson, P.-O., Strang, G.: A simple mesh generator in matlab. SIAM Rev. 46(2), 329–345 (2004)
Seitz, M.J., Köster, G.: Natural discretization of pedestrian movement in continuous space. Phys. Rev. E 86(4), 046108 (2012)
Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93(4), 1591–1595 (1996)
Thompson, J.F., Soni, B.K., Weatherill, N.P.: Handbook of Grid Generation. CRC-Press, Boca Raton (1999)
Treuille, A., Cooper, S., Popović, Z.: Continuum crowds. ACM Trans. Graph. (SIGGRAPH 2006) 25(3), 1160–1168 (2006)
VADERE-team: VADERE simulation framework (2016). www.vadere.org
Zhao, H.: A fast sweeping method for eikonal equations. Math. Comput. 74(250), 603–627 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zönnchen, B., Laubinger, M., Köster, G. (2019). Towards Faster Navigation Algorithms on Floor Fields. In: Hamdar, S. (eds) Traffic and Granular Flow '17. TGF 2017. Springer, Cham. https://doi.org/10.1007/978-3-030-11440-4_34
Download citation
DOI: https://doi.org/10.1007/978-3-030-11440-4_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11439-8
Online ISBN: 978-3-030-11440-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)