Moving in the dark : Mathematics of complex pedestrian flows

Sammanfattning: The field of mathematical modelling for pedestrian dynamics has attracted significant scientific attention, with various models proposed from perspectives such as kinetic theory, statistical mechanics, game theory and partial differential equations. Often such investigations are seen as being a part of a new branch of study in the domain of applied physics, called sociophysics. Our study proposes three models that are tailored to specific scenarios of crowd dynamics. Our research focuses on two primary issues. The first issue is centred around pedestrians navigating through a partially dark corridor that impedes visibility, requiring the calculation of the time taken for evacuation using a Markov chain model. The second issue is posed to analyse how pedestrians move through a T-shaped junction. Such a scenario is motivated by the 2022 crowd-crush disaster took place in the Itaewon district of Seoul, Korea. We propose a lattice-gas-type model that simulates pedestrians’ movement through the grid by obeying a set of rules as well as a parabolic equation with special boundary conditions. By the means of numerical simulations, we investigate a couple of evacuation scenarios by evaluating the mean velocity of pedestrians through the dark corridor, varying both the length of the obscure region and the amount of uncertainty induced by the darkness. Additionally, we propose an agent-based-modelling and cellular automata inspired model that simulates the movement of pedestrians through a T-shaped grid, varying the initial number of pedestrians. We measure the final density and time taken to reach a steady pedestrian traffic state. Finally, we propose a parabolic equation with special boundary conditions that mimic the dynamic of the pedestrian populations in a T-junction. We solve the parabolic equation using a random walk numerical scheme and compare it with a finite difference approximation. Furthermore, we prove rigorously the convergence of the random walk scheme to a corresponding finite difference scheme approximation of the solution.