Computer Science – Multiagent Systems
Scientific paper
2009-11-19
Computer Science
Multiagent Systems
Accepted as contribution to "Traffic and Granular Flow 09" proceedings. This is a slightly extended version
Scientific paper
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.
No associations
LandOfFree
Applications of the Dynamic Distance Potential Field Method does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Applications of the Dynamic Distance Potential Field Method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applications of the Dynamic Distance Potential Field Method will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-452669