Learn More
Multi-agent pathfinding is a challenging combinato-rial problem that involves multiple agents moving on a graph from a set of initial nodes to a set of desired goals without inter-agent collisions. Searching the composite space of all agents has exponential complexity and does not scale well. Decoupled methods are more efficient but are generally(More)
Motivated by efficient algorithms for solving combina-torial and discrete instances of the multi-agent pathfind-ing problem, this report investigates ways to utilize such solutions to solve similar problems in the continuous domain. While a simple discretization of the space which allows the direct application of combina-torial algorithms seems like a(More)
  • 1