[OC] Kürzeste Wege von mehreren Robotern zu einem einzelnen Ziel mithilfe des Dijkstra-Algorithmus

CODE, article and higher resolution full video (at the end): [https://community.wolfram.com/groups/-/m/t/3343868](https://community.wolfram.com/groups/-/m/t/3343868)

DATA: simulated, set of random points in 2D plane

TOOLS: Wolfram Language

Point ROBOTs’ shortest path in point obstacle field mapped by Dijkstra’s algorithm:

1. Build Voronoi diagram of the obstacles
2. Transform Voronoi diagram into a graph
3. Make sure edges are weighted by distance
4. Find shortest path on the graph using Dijkstra

You’ve made slime mold lol this is close to how it feeds and moves!

The obstacles you generatred from the voronoi graph seem like something one could do in a video game to add “flavor” to an enemy’s pathfinding.

So if you didnt want an enemy that follows a player to always move in a straight line, then they could follow this variance by instead navigating the path made by the obstacles.

To be clear, Im imagining this as “invisible” obstacles, used purely to make a unique, random, set of paths for enemies to follow. You could also apply true obstacles over top the generated obstacle path to have varying paths + build in avoidance of genuine walls, etc.

Very cool and thought provoking visual, thanks so much for sharing!