Say I have an image, represented as a 2D array of pixel values. Also, say I have a set of points on that image where each has a current (x, y) position and a Destination (x, y) associated with it. I want to find a path for each point to its Destination so that the points do not collide with each other in (x, y, t) where t is time.
Imagine dots moving continuously across a screen so that they go to their respective destinations and do not hit into each other. The paths do not need to be the shortest paths.
How do people recommend going about this problem? I have heard the options of an A* search and running a simulation, where dots feel a "repulsive force" when they become too close to each other. Thanks!