[1]
Walker, T. et al. 2021. Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. Proceedings of the International Symposium on Combinatorial Search. 10, 1 (Sep. 2021), 204–205. DOI:https://doi.org/10.1609/socs.v10i1.18492.