Solving the direction field for discrete agent motion

Authors:
Michael Schultz;Tobias Kretz;Hartmut Fricke
Affiliations:
Institute of Logistics and Aviation, Technische Universität Dresden, Dresden, Germany;PTV Planung Transport Verkehr AG, Karlsruhe, Germany;Institute of Logistics and Aviation, Technische Universität Dresden, Dresden, Germany
Venue:
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Year:
2010

Citing 4
Cited 0

Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations

Journal of Computational Physics
Robot Motion Planning

Robot Motion Planning
Computational Study of Fast Methods for the Eikonal Equation

SIAM Journal on Scientific Computing
Continuum crowds

ACM SIGGRAPH 2006 Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Models for pedestrian dynamics are often based on microscopic approaches allowing for individual agent navigation. To reach a given destination, the agent has to consider environmental obstacles. We propose a direction field calculated on a regular grid with a Moore neighborhood, where obstacles are represented by occupied cells. Our developed algorithm exactly reproduces the shortest path with regard to the Euclidean metric.