Pavel Surynek. Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). In Pavel Surynek, William Yeoh 0001, editors, Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019. pages 200-201, AAAI Press, 2019. [doi]
@inproceedings{Surynek19-0,
title = {Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT)},
author = {Pavel Surynek},
year = {2019},
url = {https://aaai.org/ocs/index.php/SOCS/SOCS19/paper/view/18387},
researchr = {https://researchr.org/publication/Surynek19-0},
cites = {0},
citedby = {0},
pages = {200-201},
booktitle = {Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019},
editor = {Pavel Surynek and William Yeoh 0001},
publisher = {AAAI Press},
isbn = {978-1-57735-808-4},
}