Related papers: A discrete Hughes' model for pedestrian flow on gr…
Understanding pattern formation in crossing pedestrian flows is essential for analyzing and managing high-density crowd dynamics in urban environments. This study presents two complementary methodological approaches to detect and…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
Several spatially continuous pedestrian dynamics models have been validated against empirical data. We try to reproduce the experimental fundamental diagram (velocity versus density) with simulations. In addition to this quantitative…
Since the beginning of the century, capturing trajectories of pedestrian streams precisely from video recordings has been possible. To enable measurements at high density, the heads of the pedestrians are marked and tracked, thus providing…
We provide an overview of the results on Hughes' model for pedestrian movements available in the literature. After the first successful approaches to solving a regularised version of the model, researchers focused on the structure of the…
We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase…
In this paper we investigate the ability of some recently introduced discrete kinetic models of vehicular traffic to catch, in their large time behavior, typical features of theoretical fundamental diagrams. Specifically, we address the…
The proposed stochastic model for pedestrian dynamics is based on existing approaches using cellular automata, combined with substantial extensions, to compensate the deficiencies resulting of the discrete grid structure. This agent motion…
We study discretizations of Hamiltonian systems on the probability density manifold equipped with the $L^2$-Wasserstein metric. Based on discrete optimal transport theory, several Hamiltonian systems on graph (lattice) with different…
For the modelling of pedestrian dynamics we treat persons as self-driven objects moving in a continuous space. On the basis of a modified social force model we qualitatively analyze the influence of various approaches for the interaction…
We consider a discrete-time dynamical system in a car-following context. The system was recently introduced to parsimoniously model human driving behavior based on utility maximization. The parameters of the model were calibrated using…
We present a mathematical model to predict pedestrian motion over a finite horizon, intended for use in collision avoidance algorithms for autonomous driving. The model is based on a road map structure, and assumes a rational pedestrian…
Stop-and-go waves in single-file movement are a phenomenon that is ob- served empirically in pedestrian dynamics. It manifests itself by the co-existence of two phases: moving and stopping pedestrians. We show analytically based on a…
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…
This work presents a microscopic model to describe pedestrian flows based on the social force theory. The aim of this study is twofold: (1) developing a realistic model that can be used as a tool for designing pedestrian-friendly…
This paper introduces a system of stochastic differential equations (SDE) of mean-field type that models pedestrian motion. The system lets the pedestrians spend time at, and move along, walls, by means of sticky boundaries and boundary…
We construct a data-driven model of flows in graphs that captures the essential elements of the movement of workers between jobs in the companies (firms) of entire economic systems such as countries. The model is based on the observation…
Directed graphs arise in many applications where computing persistent homology helps to encode the shape and structure of the input information. However, there are only a few ways to turn the directed graph information into an undirected…
In this work we extend a recent kinetic traffic model to the case of more than one class of vehicles, each of which is characterized by few different microscopic features. We consider a Boltzmann-like framework with only binary…
A simple algorithm for constructing an effective traffic model is presented. The algorithm uses statistically well-defined quantities extracted from the flow-density plot, and the resulting effective model naturally captures and predicts…