425 citations · 982 across the 23 of their papers we have counts for
3 papers · 1 filter
Multi-Agent Path Finding with Capacity Constraints
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
In multi-agent path finding (MAPF) the task is to navigate agents from their starting positions to given individual goals. The problem takes place in an undirected graph whose vert…
Automatic Algorithm Selection In Multi-agent Pathfinding
Devon Sigurdson, Vadim Bulitko, Sven Koenig +2
In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms,…
Position Paper: From Multi-Agent Pathfinding to Pipe Routing
Gleb Belov, Liron Cohen, Maria Garcia de la Banda +3
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D e…