What I would do is designate a target store as a destination, and then find the shortest path. Djikstra's algorithm to find the nearest path to that store, but you could probably implement a naive approach as you are on a grid. You could also have it turn toward the nearest cross street, then turn towards the destination and snap north or South, go up to the cross Street, turn toward the destination and snap east or west and go to the next store. Because you have a grid you will have to do some way finding.
Is the turtle having trouble leaving the store?
When I get occultations it is often because the destination is dynamic (like "nearest") rather than set once and saved until the turtle reaches the destination.
--
You received this message because you are subscribed to the Google Groups "netlogo-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to netlogo-user...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/netlogo-users/ffdee2dc-e7ec-4ab2-b0ba-c67c53947e82n%40googlegroups.com.