Quickest Paths in Simulations of Pedestrians
Tobias Kretz, Andree Grosse, Stefan Hengst, Lukas Kautzsch, Andrej, Pohlmann, Peter Vortisch

TL;DR
This paper introduces a method to simulate pedestrians walking along quickest paths based on estimated travel time, addressing limitations of traditional models that assume shortest paths, especially for time-sensitive travelers.
Contribution
A novel model element integrated into the Social Force Model that enables simulation of pedestrians following quickest, rather than shortest, paths based on travel time.
Findings
The proposed element effectively guides agents along quickest paths.
Simulation results show improved accuracy for late travelers.
The method enhances pedestrian flow modeling in time-critical scenarios.
Abstract
This contribution proposes a method to make agents in a microscopic simulation of pedestrian traffic walk approximately along a path of estimated minimal remaining travel time to their destination. Usually models of pedestrian dynamics are (implicitly) built on the assumption that pedestrians walk along the shortest path. Model elements formulated to make pedestrians locally avoid collisions and intrusion into personal space do not produce motion on quickest paths. Therefore a special model element is needed, if one wants to model and simulate pedestrians for whom travel time matters most (e.g. travelers in a station hall who are late for a train). Here such a model element is proposed, discussed and used within the Social Force Model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
