Abstract: We study the problem of multi-agent path finding with earliness-tardiness costs (MAPF-ET), which encourages agents to finish their tasks just-in-time, neither too early nor too late. Given ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results