A discrete Hughes model for pedestrian flow on graphs
From MaRDI portal
Publication:515179
DOI10.3934/nhm.2017004zbMath1357.90029arXiv1604.05126OpenAlexW2963792581MaRDI QIDQ515179
Adriano Festa, Fabio Camilli, Silvia Tozza
Publication date: 13 March 2017
Published in: Networks and Heterogeneous Media (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.05126
Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Traffic problems in operations research (90B20) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)
Related Items (5)
Navigation system-based routing strategies in traffic flows on networks ⋮ On existence, stability and many-particle approximation of solutions of 1D Hughes' model with linear costs ⋮ A Semi-Lagrangian Scheme for Hamilton--Jacobi--Bellman Equations on Networks ⋮ A model for a network of conveyor belts with discontinuous speed and capacity ⋮ Research on crowd dynamic risk management based on the psychological stress perception function
Cites Work
- Unnamed Item
- Viscosity solutions for junctions: well posedness and stability
- A Dijkstra-type algorithm for dynamic games
- An approximation scheme for a Hamilton-Jacobi equation defined on a network
- An easy-to-use algorithm for simulating traffic flow on networks: theoretical study
- On the Hughes' model for pedestrian flow: the one-dimensional case
- A destination-preserving model for simulating Wardrop equilibria in traffic flow on networks
- A semi-Lagrangian scheme for a modified version of the Hughes' model for Pedestrian flow
- The one-dimensional Hughes model for pedestrian flow: Riemann-type solutions
- Existence results for Hughes' model for pedestrian flows
- A comparison among various notions of viscosity solution for Hamilton-Jacobi equations on networks
- A convergent scheme for Hamilton-Jacobi equations on a junction: application to traffic
- Nonlinear elliptic partial differential equations and \(p\)-harmonic functions on graphs.
- Stationary Mean Field Games Systems Defined on Networks
- On the Modeling of Traffic and Crowds: A Survey of Models, Speculations, and Perspectives
- An Efficient Policy Iteration Algorithm for Dynamic Programming Equations
- On the Convergence of Policy Iteration in Stationary Dynamic Programming
- T<scp>HE</scp> F<scp>LOW OF</scp> H<scp>UMAN</scp> C<scp>ROWDS</scp>
- Convergence of a Difference Scheme for Conservation Laws with a Discontinuous Flux
This page was built for publication: A discrete Hughes model for pedestrian flow on graphs
