# cpd
2021 / Contracting and Compressing Shortest Path Databases
Shen, B., Cheema, M. A., Harabor, D. D., & Stuckey, P. J. (2021). Contracting and Compressing Shortest Path Databases. In S. Biundo, M. Do, R. Goldman, M. Katz, Q. Yang, & H. H. Zhuo (Eds.), Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, Guangzhou, China (virtual), August 2-13, 2021 (pp. 322–330). AAAI Press. https://ojs.aaai.org/index.php/ICAPS/article/view/159772020 / Bounded Suboptimal Path Planning with Compressed Path Databases
Zhao, S., Chiari, M., Botea, A., Gerevini, A. E., Harabor, D., Saetti, A., & Stuckey, P. J. (2020). Bounded Suboptimal Path Planning with Compressed Path Databases. In J. C. Beck, O. Buffet, J. Hoffmann, E. Karpas, & S. Sohrabi (Eds.), Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, Nancy, France, October 26-30, 2020 (pp. 333–342). AAAI Press. https://aaai.org/ojs/index.php/ICAPS/article/view/66782020 / Eucliean Pathfinding with Compressed Path Databases
Shen, B., Cheema, M. A., Harabor, D. D., & Stuckey, P. J. (2020). Eucliean Pathfinding with Compressed Path Databases. Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2019, Yokohama, Japan.2019 / Cutting the Size of Compressed Path Databases With Wildcards and Redundant Symbols
Mattia Chiari, & Stuckey, P. J. (2019). Cutting the Size of Compressed Path Databases With Wildcards and Redundant Symbols. Proceedings of International Conference on Automated Planning and Scheduling (ICAPS).2019 / Path Planning with CPD Heuristics
Bono, M., Gerevini, A. E., Harabor, D. D., & Stuckey, P. J. (2019). Path Planning with CPD Heuristics. Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, 1199–1205. https://doi.org/10.24963/ijcai.2019/1672018 / Two-Oracle Optimal Path Planning on Grid Maps
Salvetti, M., Botea, A., Gerevini, A. E., Harabor, D., & Saetti, A. (2018). Two-Oracle Optimal Path Planning on Grid Maps. Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS), 227–231.2015 / Complexity Results for Compressing Optimal Paths
Botea, A., Strasser, B., & Harabor, D. (2015). Complexity Results for Compressing Optimal Paths. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., 1100–1106. http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/96662015 / Compressing Optimal Paths with Run Length Encoding
Strasser, B., Botea, A., & Harabor, D. (2015). Compressing Optimal Paths with Run Length Encoding. J. Artif. Intell. Res., 54, 593–629. https://doi.org/10.1613/JAIR.49312014 / Fast First-Move Queries through Run-Length Encoding
Strasser, B., Harabor, D., & Botea, A. (2014). Fast First-Move Queries through Run-Length Encoding. SoCS.2013 / Moving Target Search With Compressed Path Databases
Botea, A., Baier, J. A., Harabor, D., & Hernández, C. (2013). Moving Target Search With Compressed Path Databases. ICAPS.2013 / Path Planning with Compressed All-Pairs Shortest Paths Data
Botea, A., & Harabor, D. D. (2013). Path Planning with Compressed All-Pairs Shortest Paths Data. ICAPS.