Ok, i find a good way to do it.
I use “Find Path to Location Synchronisly”. The result is a array of waypoints. Then take the last waypoint, it is the nearest, and repeat “Find Path to Location Synchronosly”. My function is recursively 
Ok, i find a good way to do it.
I use “Find Path to Location Synchronisly”. The result is a array of waypoints. Then take the last waypoint, it is the nearest, and repeat “Find Path to Location Synchronosly”. My function is recursively