Daniel Harabor

>>

Publications

Scholarly Papers

• J. A. Baier, A. Botea, D. Harabor and C. Hernández. A Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps. 2014. In Transactions on Computational Intelligence and AI in Games (TCIAIG). IEEE.
  (pdf link) (bib)
• B. Strasser, D. Harabor and A. Botea. Fast First-Move Queries through Run-Length Encoding. 2014. In Proceedings of the 7th Annual Symposium on Combinatorial Search (SoCS). Prague. Czech Republic.
  (pdf) (bib)
• D. Harabor and A. Grastien. Improving Jump Point Search. Pathfinding Algorithm. 2014. In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS). Portsmouth (NH), USA.
  (pdf) (bib)
• D. Harabor and A. Grastien. An Optimal Any-Angle Pathfinding Algorithm. 2013. In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS). Rome, Italy.
  (pdf) (bib)
• A. Botea and D. Harabor. Path Planning with Compressed All-Pairs Shortest Paths Data. 2013. In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS). Rome, Italy.
  (pdf) (bib)
• A. Botea, J. A. Baier, D. Harabor and C. Hernández. Moving Target Search With Compressed Path Databases. 2013. In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS). Rome, Italy.
  (pdf) (bib)
• L. Antsfeld, D. Harabor, P. Kilby and T. Walsh. 2012. TRANSIT Routing on Video Game Maps. In Proceedings of the 8th Annual AAAI Conference on AI and Interactive Digital Entertainment (AIIDE). Palo Alto, USA.
  (pdf) (bib)
D. Harabor and A. Grastien. 2012. The JPS Pathfinding System. In Proceedings of the 5th Symposium on Combinatorial Search (SoCS). Niagara Falls, Canada.
(pdf) (bib)
• D. Harabor and A Grastien. 2011. Online Graph Pruning for Pathfinding on Grid Maps. In Proceedings of the 25th National Conference on Artificial Intelligence (AAAI). San Francisco, USA.
  (pdf) (bib)
• D. Harabor, A. Botea and P. Kilby. 2011. Path Symmetries in Uniform-cost Grid Maps. In Proceedings of 9th Symposium on Abstraction Reformulation and Approximation (SARA). Barcelona, Spain.
  (pdf) (bib)
• D. Harabor and A. Botea. 2010. Breaking Path Symmetries in 4-connected Grid Maps. In Proceedings of the 6th Annual AAAI Conference on AI and Interactive Digital Entertainment (AIIDE). Stanford University, Palo Alto, CA, USA.
  (pdf) (bib)
• A. Bauer, V. Botea, M. Brown, M. Gray, D. Harabor and J. K. Slaney. 2010. An Integrated Modelling, Debugging, and Visualisation Environment for G12. In Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP) St. Andrews, Scotland.
  (pdf) (bib)
• D. Harabor and A. Botea. 2008. Hierarchical Path Planning with Multi-Size Agents in Heterogenous Environments. In Proceedings of the IEEE Symposium on Computational Intelligence and Games (CIG). Perth, Australia.
  (pdf) (bib)

Industry Papers

• D. Harabor. 2012. Fast Pathfinding via Symmetry Breaking. In AiGameDev.com
  (pdf)
• D. Harabor. 2009. Clearance-based Pathfinding and Hierarchical Annotated A* Search. In AiGameDev.com.
  (pdf)

Workshop Papers

• A. Botea, D. Harabor and K-H. C. Wang. 2012. Towards Search-Free Multiagent Pathfinding. In AAAI Workshop on Multiagent Pathfinding (WoMP). Toronto, Canada.
  (pdf)
• D. Harabor. 2011. Graph Pruning and Symmetry Breaking on Grid Maps. In IJCAI Doctoral Consortium (IJCAI-DC). Barcelona, Spain.
  (pdf)
• D. Harabor and A. Botea. 2008. Hierarchical Path Planning with Multi-Size Agents in Heterogenous Environments. In ICAPS Workshop on Knowledge Engineering for Planning and Scheduling (KEPS). Sydney, Australia.
  (pdf)

Technical Reports

• D. Harabor, A. Botea and P. Kilby. 2011. Symmetry-based Search Space Reduction For Grid Maps. In arXiv:1106.4083v1
  (pdf) (bib)
• D. Harabor and P. Kilby. 2011. Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains. In arXiv:1103.3904.
  (pdf) (bib)