Pathfinding in multi goal, multi agent environment
- by Rohan Agrawal
I have an environment in which I have multiple agents (a), multiple goals (g) and obstacles (o).
. . . a o . . .
. . . . o . g .
. a . . . . . .
. . . . o . . .
. o o o o . g .
. o . . . . . .
. o . . . . o .
. . . o o o o a
What would an appropriate algorithm for pathfinding in this environment?
The only thing I can think of right now, is to Run a separate version of A* for each goal separately, but i don't think that's very efficient.