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

Pavel Surynek. On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared. In Ana Paula Rocha 0001, Luc Steels, H. Jaap van den Herik, editors, Proceedings of the 12th International Conference on Agents and Artificial Intelligence, ICAART 2020, Volume 2, Valletta, Malta, February 22-24, 2020. pages 182-193, SCITEPRESS, 2020. [doi]

Abstract

Abstract is missing.