12 citations · 12 across the 1 of their papers we have counts for
1 paper
Jingyao Ren, Vikraman Sathiyanarayanan, Eric Ewing +2
Solving the Multi-Agent Path Finding (MAPF) problem optimally is known to be NP-Hard for both make-span and total arrival time minimization. While many algorithms have been develop…