|
|
Click here for Daniel's personal webpage.
- S.-H. Chan, Z. Chen, D.-L. Lin, Y. Zhang, D. Harabor, S. Koenig, T.-W. Huang and T. Phan. Anytime Multi-Agent Path Finding Using Operation Parallelism in Large Neighborhood Search. In International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), (in print), 2024.
- S.-H. Chan, Z. Chen, T. Guo, H. Zhang, Y. Zhang, D. Harabor, S. Koenig, C. Wu and J. Yu. The League of Robot Runners: Competition Goals, Designs, and Implementation [System Demonstration]. In International Conference on Automated Planning and Scheduling (ICAPS), (in print), 2024.
- E. Lam, P. Stuckey and D. Harabor. Optimal Multi-Agent Pickup and Delivery Using Branch-and-Cut-and-Price Algorithms. Transportation Science, (in print), 2024.
- J. Morag, Y. Zhang, D. Koyfman, Z. Chen, A. Felner, D. Harabor and R. Stern. Prioritised Planning with Guarantees. In International Symposium on Combinatorial Search (SoCS), 82-90, 2024.
- Y. Zhang, Z. Chen, D. Harabor, P. Le Bodic and P.J. Stuckey. Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. In International Conference on Automated Planning and Scheduling (ICAPS), 2024.
- Z. Chen, D. Harabor, J. Li and P. Stuckey. Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence (AAAI), 20674-20682, 2024.
- E. Lam, D. Harabor, P. Stuckey and J. Li. Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. In International Conference on Automated Planning and Scheduling (ICAPS), 254-258, 2023.
- B. Shen, Z. Chen, J. Li, M. A. Cheema, D. Harabor and P. Stuckey. Beyond Pairwise Reasoning in Multi-Agent Path Finding. In International Conference on Automated Planning and Scheduling (ICAPS), 384-392, 2023.
- J. Li, Z. Chen, D. Harabor, P. Stuckey and S. Koenig. MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. In AAAI Conference on Artificial Intelligence (AAAI), 2022.
- S.-H. Chan, J. Li, G. Gange, D. Harabor, P. Stuckey and S. Koenig. Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence (AAAI), 2022.
- Z. Chen, J. Li, D. Harabor, P. Stuckey and S. Koenig. Multi-Train Path Finding Revisited. In Symposium on Combinatorial Search (SoCS), 38-46, 2022.
- E. Lam, P. Le Bodic, D. Harabor and P. Stuckey. Branch-and-Cut-and-Price for Multi-Agent Path Finding. Computers and Operations Research, 2022.
- J. Li, D. Harabor, P. Stuckey, H. Ma, G. Gange and S. Koenig. Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search. Artificial Intelligence, 301, 103574, 2021.
- E. Boyarski, A. Felner, P. Le Bodic, D. Harabor, P. Stuckey and S. Koenig. f-Aware Conflict Prioritization & Improved Heuristics for Conflict-Based Search. In AAAI Conference on Artificial Intelligence (AAAI), 12241-12248, 2021.
- J. Li, Z. Chen, Y. Zheng, S.-H. Chan, D. Harabor, P. Stuckey, H. Ma and S. Koenig. Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. In International Conference on Automated Planning and Scheduling (ICAPS), 477-485, 2021.
- E. Boyarski, A. Felner, P. Le Bodic, D. Harabor, P. Stuckey and S. Koenig. Further Improved Heuristics for Conflict-Based Search [Doctoral Dissertation Abstract]. In Symposium on Combinatorial Search (SoCS), 213-215, 2021.
- Z. Chen, D. Harabor, J. Li and P. Stuckey. Symmetry Breaking for k-Robust Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence (AAAI), 12267-12274, 2021.
- E. Boyarski, A. Felner, D. Harabor, P. Stuckey, L. Cohen, J. Li and S. Koenig. Iterative-Deepening Conflict-Based Search. In International Joint Conference on Artificial Intelligence (IJCAI), (in print), 2020.
- G. Belov, W. Du, M. Garcia de la Banda, D. Harabor, S. Koenig and X. Wei. From Multi-Agent Pathfinding to 3D Pipe Routing. In Symposium on Combinatorial Search (SoCS), (in print), 2020.
- J. Li, G. Gange, D. Harabor, P. Stuckey, H. Ma and S. Koenig. New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. In International Conference on Automated Planning and Scheduling (ICAPS), (in print), 2020.
- S.-H. Chan, J. Li, D. Harabor, P. Stuckey, G. Gange, L. Cohen and S. Koenig. Nested ECBS for Bounded-Suboptimal Multi-Agent Path Finding. In IJCAI Workshop on Multi-Agent Path Finding, 2020.
- H. Ma, D. Harabor, P. Stuckey, J. Li and S. Koenig. Searching with Consistent Prioritization for Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence (AAAI), (in print), 2019.
- J. Li, D. Harabor, P. Stuckey, H. Ma and S. Koenig. Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. In AAAI Conference on Artificial Intelligence (AAAI), (in print), 2019.
- J. Li, D. Harabor, P. Stuckey, A. Felner, H. Ma and S. Koenig. Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. In International Conference on Automated Planning and Scheduling (ICAPS), (in print), 2019.
- E. Lam, P. Le Bodic, D. Harabor and P. Stuckey. Branch-and-Cut-and-Price for Multi-Agent Pathfinding. In International Joint Conference on Artificial Intelligence (IJCAI), (in print), 2019.
- G. Gange, D. Harabor and P. Stuckey. Lazy CBS: Implict Conflict-Based Search Using Lazy Clause Generation. In International Conference on Automated Planning and Scheduling (ICAPS), 2019.
- A. Botea, D. Harabor and K. Wang. Towards Search-Free Multiagent Pathfinding. In AAAI-12 Workshop on Multiagent Pathfinding, 2012.
|
