SURYNEK, Pavel. Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. Proceedings of the International Symposium on Combinatorial Search, [S. l.], v. 10, n. 1, p. 202–203, 2021. DOI: 10.1609/socs.v10i1.18491. Disponível em: https://ojs.aaai.org/index.php/SOCS/article/view/18491. Acesso em: 27 may. 2026.