Anylogic: How to get the distance of the route pedestrian choose

user_17899865 0
Viewed 112

I am using the PedGoTo block in Anylogic pedestrian library to direct pedestrians to the nearest exit (TargetLine). But since there are walls between pedestrians and exits, I can't just calculate straight line distance. In PedGoTo Anylogic official reference guide, it says

In Reach target mode the path is automatically calculated by the library.

I wonder if there's a function to calculate this path like path = getPath(ped, targetLine), and I can get the distance of this route, like path.getDistance()?

anylogic
2 Answers

Afaik there is no such method. The reason is that the Ped library constantly re-evaluates the path taken and adjusts it based on new conditions.

So if you want to compute the nearest exits, you have to do it manually. Easiest would be to use paths, as Jaco-Ben suggested.

However: This may not actually be a good idea, depending on your actual scenario. In reality, people also do NOT know the nearest exit, typically (unless it is trivial).

PS: Also check the example model on fire exit behavior

user_21647280

I don't think there is an API for the pedestrian library similar to what you have with the GIS map.

You can however record the distance as the pedestrian is traveling - and once you have these distances you can perhaps use them in a future scenario? You will need to manually record all the distances in a separate run and then store the values to be used in a next run.

Here is a simple examplke in case it helps you.

enter image description here

What I would do then is to run this for a number of locations that pedestrians will be at when they need to choose an exit. Store the final distance in a separate txt file with a starting location as the key... and then in the next run of your simulation, you use these distances as an approximation of the distance to the exits and let the pedestrain then decide where to go to based on their current location and shortest distance to the exist...

So for every agent, you find the nearest point you have a distance to exists for and then use that, plus the distance to the exists

This seems like a lot of work... but for now I don't see any other way. Would love to see if anyone gets a better solution!

user_40190940
Related