User Equilibrium Route Assignment for Microscopic Pedestrian Simulation
This addresses route assignment for pedestrian simulation, but it appears incremental as it builds on existing methods without broad SOTA claims.
The paper tackles the problem of generating routing alternatives for microscopic pedestrian simulation by introducing a method that creates navigation data structures without movement artifacts, ensuring pedestrians locally prefer the shortest path. The result is a set of routes usable with static or dynamic assignment methods, though no concrete performance numbers are provided.
For the simulation of pedestrians a method is introduced to find routing alternatives from any origin position to a given destination area in a given geometry composed of walking areas and obstacles. The method includes a parameter which sets a threshold for the approximate minimum size of obstacles to generate routing alternatives. The resulting data structure for navigation is constructed such that it does not introduce artifacts to the movement of simulated pedestrians and that locally pedestrians prefer to walk on the shortest path. The generated set of routes can be used with iterating static or dynamic assignment methods.