SURYNEK, P. Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. Proceedings of the International Symposium on Combinatorial Search, [S. l.], v. 12, n. 1, p. 200-202, 2021. DOI: 10.1609/socs.v12i1.18583. Disponível em: https://ojs.aaai.org/index.php/SOCS/article/view/18583. Acesso em: 5 may. 2026.