Here’s a demo of the A* Pathfinding Project.
It uses quadtrees, spline smoothing and full simplification (multithreading is turned off).
This scene contains 100 seekers, a script loops through them and orders one unit every half second to move to a random position on the map (shown by the red dot).
How would it be possible to prevent collision between the seekers so that they avoid eachother when they are on a collision course?
That’s a very hard thing to do, in fact, I haven’t been able to solve it in a good way yet.
Sorry for answering late, I have been (and am) on holiday, but I’m home for one day so I will try to answer as many comments as possible.