collaborators

1 paper

cs.MA2023

Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic

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…