Click here for Pierre's personal webpage.
- 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.
- 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.
- 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.
- 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.
- E. Lam and P. Le Bodic. New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. In International Conference on Automated Planning and Scheduling (ICAPS), 184-192, 2020.
- 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.
