1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Tomáš Kolárik, Stefan Ratschan, Pavel Surynek
This paper introduces a new approach to solving a continuous-time version of the multi-agent path finding problem. The algorithm translates the problem into an extension of the cla…