Effective bounded-suboptimal algorithm of solving multi-agent pathfinding problem

The paper considers the problem of finding a combination of collision-free trajectories for a set of agents capable of performing actions of arbitrary duration. To solve this problem, two boundedsuboptimal modifications of the continuous-time conflict-based search algorithm are proposed. The results of the carried out model experimental studies have demonstrated the high computational efficiency of the proposed modifications.