# cbs
2023 / Beyond Pairwise Reasoning in Multi-Agent Path Finding
Shen, B., Chen, Z., Li, J., Cheema, M. A., Harabor, D. D., & Stuckey, P. J. (2023). Beyond Pairwise Reasoning in Multi-Agent Path Finding. In S. Koenig, R. Stern, & M. Vallati (Eds.), Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, July 8-13, 2023, Prague, Czech Republic (pp. 384–392). AAAI Press. https://doi.org/10.1609/ICAPS.V33I1.272172022 / Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding
Chan, S.-H., Li, J., Gange, G., Harabor, D., Stuckey, P. J., & Koenig, S. (2022). Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, 9313–9322. https://doi.org/10.1609/AAAI.V36I9.211622021 / Further Improved Heuristics For Conflict-Based Search
Boyarski, E., Felner, A., Bodic, P. L., Harabor, D., Stuckey, P. J., & Koenig, S. (2021). Further Improved Heuristics For Conflict-Based Search. In H. Ma & I. Serina (Eds.), Proceedings of the Fourteenth International Symposium on Combinatorial Search, SOCS 2021, Virtual Conference [Jinan, China], July 26-30, 2021 (pp. 213–215). AAAI Press. https://doi.org/10.1609/SOCS.V12I1.185872021 / Pairwise symmetry reasoning for multi-agent path finding search
Li, J., Harabor, D., Stuckey, P. J., Ma, H., Gange, G., & Koenig, S. (2021). Pairwise symmetry reasoning for multi-agent path finding search. Artif. Intell., 301, 103574. https://doi.org/10.1016/j.artint.2021.1035742021 / f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search
Boyarski, E., Felner, A., Bodic, P. L., Harabor, D. D., Stuckey, P. J., & Koenig, S. (2021). f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, 12241–12248. https://ojs.aaai.org/index.php/AAAI/article/view/174532020 / F-Cardinal Conflicts in Conflict-Based Search
Boyarski, E., Harabor, D., Stuckey, P. J., Bodic, P. L., & Felner, A. (2020). F-Cardinal Conflicts in Conflict-Based Search. In D. Harabor & M. Vallati (Eds.), Proceedings of the Thirteenth International Symposium on Combinatorial Search, SOCS 2020, Online Conference [Vienna, Austria], 26-28 May 2020 (pp. 123–124). AAAI Press. https://doi.org/10.1609/SOCS.V11I1.185192020 / Iterative Deepening Conflict-Based Search
Boyarski, E., Felner, A., Harabor, D. D., Stuckey, P. J., Cohen, L., Li, J., & Koenig, S. (2020). Iterative Deepening Conflict-Based Search. Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2019, Yokohama, Japan.2020 / New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding
Jiaoyang Li, & Koenig, S. (2020). New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. Proceedings of International Conference on Automated Planning and Scheduling (ICAPS).2019 / Disjoint Splitting for Conflict-Based Search for Multi-Agent Path Finding
Li, J., Harabor, D., Stuckey, P., Felner, A., Ma, H., & Koenig, S. (2019). Disjoint Splitting for Conflict-Based Search for Multi-Agent Path Finding. Proceedings of International Conference on Automated Planning and Scheduling (ICAPS).2019 / Lazy CBS: Implict Conflict-Based Search Using Lazy Clause Generation
Gange, G., Harabor, D., & Stuckey, P. J. (2019). Lazy CBS: Implict Conflict-Based Search Using Lazy Clause Generation. Proceedings of International Conference on Automated Planning and Scheduling (ICAPS).