# symmetrybreaking
2024 / Avoiding Node Re-Expansions Can Break Symmetry Breaking
Carlson, M., Harabor, D., & Stuckey, P. J. (2024). Avoiding Node Re-Expansions Can Break Symmetry Breaking. Proceedings of the International Symposium on Combinatorial Search, 17, 20–27.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.272172021 / 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 / Symmetry Breaking for k-Robust Multi-Agent Path Finding
Chen, Z., Harabor, D. D., Li, J., & Stuckey, P. J. (2021). Symmetry Breaking for k-Robust Multi-Agent Path Finding. 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, 12267–12274. https://doi.org/10.1609/AAAI.V35I14.174562020 / 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 / Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding
Li, J., Harabor, D., Stuckey, P., Ma, H., & Koenig, S. (2019). Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. Proceedings of the National Conference on Artificial Intelligence (AAAI).2011 / Graph Pruning and Symmetry Breaking on Grid Maps
Harabor, D. (2011). Graph Pruning and Symmetry Breaking on Grid Maps. In T. Walsh (Ed.), IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (pp. 2816–2817). IJCAI/AAAI. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-4802011 / Online Graph Pruning for Pathfinding On Grid Maps
Harabor, D. D., & Grastien, A. (2011). Online Graph Pruning for Pathfinding On Grid Maps. AAAI.2011 / Path Symmetries in Undirected Uniform-Cost Grids
Harabor, D. D., Botea, A., & Kilby, P. (2011). Path Symmetries in Undirected Uniform-Cost Grids. SARA.2010 / Breaking Path Symmetries in 4-connected Grid Maps
Harabor, D., & Botea, A. (2010). Breaking Path Symmetries in 4-connected Grid Maps. Proceedings of the AI and Interactive Digital Entertainment Conference AIIDE-10, 33–38.