[1]
Surynek, P. et al. 2021. Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. Proceedings of the International Symposium on Combinatorial Search. 9, 1 (Sep. 2021), 99–105. DOI:https://doi.org/10.1609/socs.v9i1.18456.