Papers › The shortest time and/or the shortest path strategies in a CA FF pedestrian dynamics model
The shortest time and/or the shortest path strategies in a CA FF pedestrian dynamics model
Ekaterina Kirik, Tat'yana Yurgel'yan, Dmitriy Krouglov
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper deals with a mathematical model of a pedestrian movement. A stochastic cellular automata (CA) approach is used here. The Floor Field (FF) model is a basis model. FF models imply that virtual people follow the shortest path strategy. But people are followed by a strategy of the shortest time as well. This paper is focused on how to mathematically formalize and implement to a model these features of the pedestrian movement. Some results of a simulation are presented.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections