Recently the dynamic distance potential field (DDPF) was introduced as a computationally efficient method to make agents in a simulation of pedestrians move rather on the quickest path than the shortest. It can be considered to be an estimated-remaining-journey-time-based one-shot dynamic assignment method for pedestrian route choice on the operational level of dynamics. In this contribution the method is shortly introduced and the effect of the method on RiMEA's test case 11 is investigated.
Cite
@article{arxiv.0911.3723,
title = {Applications of the Dynamic Distance Potential Field Method},
author = {Tobias Kretz},
journal= {arXiv preprint arXiv:0911.3723},
year = {2009}
}
Comments
Accepted as contribution to "Traffic and Granular Flow 09" proceedings. This is a slightly extended version