Unbounded Sub-Optimal Conflict-Based Search in Complex Domains

Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner. Unbounded Sub-Optimal Conflict-Based Search in Complex Domains. 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 204-205, AAAI Press, 2019. [doi]

@inproceedings{WalkerSF19,
  title = {Unbounded Sub-Optimal Conflict-Based Search in Complex Domains},
  author = {Thayne T. Walker and Nathan R. Sturtevant and Ariel Felner},
  year = {2019},
  url = {https://aaai.org/ocs/index.php/SOCS/SOCS19/paper/view/18389},
  researchr = {https://researchr.org/publication/WalkerSF19},
  cites = {0},
  citedby = {0},
  pages = {204-205},
  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},
}