Abstract: Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since solving the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results