Publications

9 results for Daniel Harabor

Cutting the size of compressed path databases with wildcards and redundant symbols
- - Mattia Chiari
  - Shizhe Zhao
  - et al.
- 2019
- ICAPS 2019
Two-oracle optimal path planning on grid maps
- - Matteo Salvetti
  - Adi Botea
  - et al.
- 2018
- ICAPS 2018
Compressing optimal paths with run length encoding
- - Ben Strasser
  - Adi Botea
  - et al.
- 2015
- JAIR
The grid-based path planning competition: 2014 entries and results
- - Nathan R. Sturtevant
  - Tansel Uras
  - et al.
- 2015
- SoCS 2015
Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps
- - Jorge A. Baier
  - Adi Botea
  - et al.
- 2015
- IEEE T-CIAIG
Complexity results for compressing optimal paths
- - Adi Botea
  - Ben Strasser
  - et al.
- 2015
- AAAI/IAAI 2015
Fast First-Move Queries through Run-Length Encoding ^∗
- - Ben Strasser
  - Daniel Harabor
  - et al.
- 2014
- SoCS 2014
Path planning with compressed all-pairs shortest paths data
- - Adi Botea
  - Daniel Harabor
- 2013
- ICAPS 2013
Moving target search with compressed path databases
- - Adi Botea
  - Jorge A. Baier
  - et al.
- 2013
- ICAPS 2013