Solving the Direction Field for Discrete Agent Motion
arXiv:1008.3990 · doi:10.1007/978-3-642-15979-4_52
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.
8 pages, 4 figures