The use of dynamic distance potential fields for pedestrian flow around corners

TL;DR

This paper introduces a heuristic method to model pedestrian movement that balances shortest and quickest path considerations, addressing complex flow around corners.

Contribution

It presents a novel one-shot heuristic approach to incorporate the desire for quickest routes in pedestrian flow modeling.

Findings

Effective modeling of pedestrian flow around corners.

Demonstrates differences between shortest and quickest path behaviors.

Provides a new tool for realistic pedestrian simulation.

Abstract

This contribution investigates situations in pedestrian dynamics, where trying to walk the shortest path leads to largely different results than trying to walk the quickest path. A heuristic one-shot method to model the influence of the will to walk the quickest path is introduced.