SURYNEK, Pavel. Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). Proceedings of the International Symposium on Combinatorial Search, [S. l.], v. 10, n. 1, p. 200–201, 2021. DOI: 10.1609/socs.v10i1.18490. Disponível em: https://ojs.aaai.org/index.php/SOCS/article/view/18490. Acesso em: 27 may. 2026.