Daniel Harabor
Daniel Harabor
Dirección de correo verificada de monash.edu - Página principal
Título
Citado por
Citado por
Año
Online graph pruning for pathfinding on grid maps
D Harabor, A Grastien
Proceedings of the AAAI Conference on Artificial Intelligence 25 (1), 2011
2322011
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
702008
Improving jump point search
D Harabor, A Grastien
Proceedings of the International Conference on Automated Planning and …, 2014
552014
The JPS Pathfinding System.
DD Harabor, A Grastien
SOCS, 2012
482012
An optimal any-angle pathfinding algorithm
D Harabor, A Grastien
Proceedings of the International Conference on Automated Planning and …, 2013
422013
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
38*2015
Breaking path symmetries on 4-connected grid maps
D Harabor, A Botea
Proceedings of the AAAI Conference on Artificial Intelligence and …, 2010
362010
Branch-and-Cut-and-Price for Multi-Agent Pathfinding.
E Lam, P Le Bodic, DD Harabor, PJ Stuckey
IJCAI, 1289-1296, 2019
332019
Path planning with compressed all-pairs shortest paths data
A Botea, D Harabor
Proceedings of the International Conference on Automated Planning and …, 2013
322013
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
292019
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
272019
Optimal any-angle pathfinding in practice
DD Harabor, A Grastien, D Öz, V Aksakalli
Journal of Artificial Intelligence Research 56, 89-118, 2016
272016
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
23*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
222019
Path Symmetries in Undirected Uniform-Cost Grids
D Harabor, A Botea, P Kilby
Proceedings of Symposium on Abstraction Reformulation and Approximation (SARA), 2011
19*2011
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
182020
Transit routing on video game maps
L Antsfeld, D Harabor, P Kilby, T Walsh
Proceedings of the AAAI Conference on Artificial Intelligence and …, 2012
182012
Fast First-Move Queries through Run-Length Encoding.
B Strasser, D Harabor, A Botea
SOCS, 2014
172014
Compressing optimal paths with run length encoding
B Strasser, A Botea, D Harabor
Journal of Artificial Intelligence Research 54, 593-629, 2015
152015
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
142013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20