Towards Faster Navigation Algorithms on Floor Fields

Benedikt Zönnchen (), Matthias Laubinger () and Gerta Köster ()
Additional contact information
Benedikt Zönnchen: Munich University of Applied Sciences
Matthias Laubinger: Munich University of Applied Sciences
Gerta Köster: Munich University of Applied Sciences

A chapter in Traffic and Granular Flow '17, 2019, pp 307-315 from Springer

Abstract: 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.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-11440-4_34

Ordering information: This item can be ordered from
http://www.springer.com/9783030114404

DOI: 10.1007/978-3-030-11440-4_34

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().