| Online graph pruning for pathfinding on grid maps D Harabor, A Grastien Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 1114-1119, 2011 | 312 | 2011 |
| Improving jump point search D Harabor, A Grastien Proceedings of the International Conference on Automated Planning and …, 2014 | 73 | 2014 |
| Hierarchical path planning for multi-size agents in heterogeneous environments D Harabor, A Botea 2008 IEEE Symposium On Computational Intelligence and Games, 258-265, 2008 | 72 | 2008 |
| The JPS pathfinding system D Harabor, A Grastien International Symposium on Combinatorial Search 3 (1), 2012 | 65 | 2012 |
| Searching with consistent prioritization for multi-agent path finding H Ma, D Harabor, PJ Stuckey, J Li, S Koenig Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7643-7650, 2019 | 62 | 2019 |
| Branch-and-cut-and-price for multi-agent path finding E Lam, P Le Bodic, D Harabor, PJ Stuckey Computers & Operations Research 144, 105809, 2022 | 58 | 2022 |
| An optimal any-angle pathfinding algorithm D Harabor, A Grastien Proceedings of the International Conference on Automated Planning and …, 2013 | 49 | 2013 |
| New techniques for pairwise symmetry breaking in multi-agent path finding J Li, G Gange, D Harabor, PJ Stuckey, H Ma, S Koenig Proceedings of the International Conference on Automated Planning and …, 2020 | 44 | 2020 |
| Disjoint splitting for multi-agent path finding with conflict-based search J Li, D Harabor, PJ Stuckey, A Felner, H Ma, S Koenig Proceedings of the International Conference on Automated Planning and …, 2019 | 44* | 2019 |
| The Grid-Based Path Planning competition: 2014 entries and results SR Sturtevant, Nathan R., Jason Traish, James Tulip, Tansel Uras, Sven ... Eighth Annual Symposium on Combinatorial Search (SoCS), 2015 | 44* | 2015 |
| Symmetry-breaking constraints for grid-based multi-agent path finding J Li, D Harabor, PJ Stuckey, H Ma, S Koenig Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 6087-6095, 2019 | 43 | 2019 |
| Lazy CBS: implicit conflict-based search using lazy clause generation G Gange, D Harabor, PJ Stuckey Proceedings of the International Conference on Automated Planning and …, 2019 | 42 | 2019 |
| Breaking path symmetries on 4-connected grid maps D Harabor, A Botea Proceedings of the AAAI Conference on Artificial Intelligence and …, 2010 | 37 | 2010 |
| Optimal any-angle pathfinding in practice DD Harabor, A Grastien, D Öz, V Aksakalli Journal of Artificial Intelligence Research 56, 89-118, 2016 | 34 | 2016 |
| Path planning with compressed all-pairs shortest paths data A Botea, D Harabor Twenty-Third International Conference on Automated Planning and Scheduling, 2013 | 34 | 2013 |
| Fast first-move queries through run-length encoding B Strasser, D Harabor, A Botea International Symposium on Combinatorial Search 5 (1), 2014 | 21 | 2014 |
| Path Symmetries in Undirected Uniform-Cost Grids D Harabor, A Botea, P Kilby Proceedings of Symposium on Abstraction Reformulation and Approximation (SARA), 2011 | 21* | 2011 |
| Compressing optimal paths with run length encoding B Strasser, A Botea, D Harabor Journal of Artificial Intelligence Research 54, 593-629, 2015 | 20 | 2015 |
| Transit routing on video game maps L Antsfeld, D Harabor, P Kilby, T Walsh Proceedings of the AAAI Conference on Artificial Intelligence and …, 2012 | 20 | 2012 |
| Moving target search with compressed path databases A Botea, J Baier, D Harabor, C Hernández Proceedings of the International Conference on Automated Planning and …, 2013 | 16 | 2013 |
