On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared.

Pavel Surynek

Browse the full ICAART paper archive.