Daniel Harabor
Title
Cited by
Cited by
Year
Online graph pruning for pathfinding on grid maps
DD Harabor, A Grastien
Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011
1962011
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
672008
Improving jump point search
DD Harabor, A Grastien
Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014
442014
An optimal any-angle pathfinding algorithm
DD Harabor, A Grastien
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
422013
The JPS Pathfinding System.
DD Harabor, A Grastien
SOCS, 2012
422012
The grid-based path planning competition: 2014 entries and results
NR Sturtevant, J Traish, J Tulip, T Uras, S Koenig, B Strasser, A Botea, ...
Eighth Annual Symposium on Combinatorial Search, 2015
352015
Breaking path symmetries on 4-connected grid maps
D Harabor, A Botea
Sixth Artificial Intelligence and Interactive Digital Entertainment Conference, 2010
332010
Path planning with compressed all-pairs shortest paths data
A Botea, D Harabor
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
262013
Optimal any-angle pathfinding in practice
DD Harabor, A Grastien, D Öz, V Aksakalli
Journal of Artificial Intelligence Research 56, 89-118, 2016
242016
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, 7643-7650, 2019
182019
Transit routing on video game maps
L Antsfeld, DD Harabor, P Kilby, T Walsh
Eighth Artificial Intelligence and Interactive Digital Entertainment Conference, 2012
182012
Path Symmetries in Undirected Uniform-Cost Grids
D Harabor, A Botea, P Kilby
Proceedings of Symposium on Abstraction Reformulation and Approximation (SARA), 2011
17*2011
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, 6087-6095, 2019
162019
Branch-and-Cut-and-Price for Multi-Agent Pathfinding.
E Lam, P Le Bodic, DD Harabor, PJ Stuckey
IJCAI, 1289-1296, 2019
152019
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
15*2019
Fast first-move queries through run-length encoding
B Strasser, D Harabor, A Botea
Seventh Annual Symposium on Combinatorial Search, 2014
152014
Compressing optimal paths with run length encoding
B Strasser, A Botea, D Harabor
Journal of Artificial Intelligence Research 54, 593-629, 2015
132015
Moving target search with compressed path databases
A Botea, JA Baier, D Harabor, C Hernández
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
132013
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
112019
Compromise-free Pathfinding on a Navigation Mesh.
M Cui, DD Harabor, A Grastien, C Data61
IJCAI, 496-502, 2017
112017
The system can't perform the operation now. Try again later.
Articles 1–20