Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search

Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner. Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020. pages 7277-7284, AAAI Press, 2020. [doi]

@inproceedings{WalkerSF20,
  title = {Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search},
  author = {Thayne T. Walker and Nathan R. Sturtevant and Ariel Felner},
  year = {2020},
  url = {https://aaai.org/ojs/index.php/AAAI/article/view/6219},
  researchr = {https://researchr.org/publication/WalkerSF20},
  cites = {0},
  citedby = {0},
  pages = {7277-7284},
  booktitle = {The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020},
  publisher = {AAAI Press},
  isbn = {978-1-57735-823-7},
}