[1]
Surynek, P. 2021. Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. Proceedings of the International Symposium on Combinatorial Search. 10, 1 (Sep. 2021), 202–203. DOI:https://doi.org/10.1609/socs.v10i1.18491.