Towards Faster Navigation Algorithms on Floor Fields

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.