The shortest time and/or the shortest path strategies in a CA FF pedestrian dynamics model

TL;DR

This paper presents a mathematical formalization of pedestrian movement strategies in a cellular automata model, focusing on shortest path and shortest time approaches, with simulation results demonstrating the implementation.

Contribution

It introduces a novel way to incorporate shortest time strategy into the Floor Field pedestrian model, extending beyond the traditional shortest path approach.

Findings

Simulation results validate the formalization of shortest time strategy.

The model effectively compares shortest path and shortest time strategies.

Potential applications in crowd management and evacuation planning.

Abstract

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.