Applications of the Dynamic Distance Potential Field Method
classification
💻 cs.MA
keywords
methoddynamicdistancefieldintroducedpotentialagentsapplications
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.