# anyangle
2022 / Dual Euclidean Shortest Path Search (Extended Abstract)
Hechenberger, R., Stuckey, P. J., Bodic, P. L., & Harabor, D. D. (2022). Dual Euclidean Shortest Path Search (Extended Abstract). In L. Chrpa & A. Saetti (Eds.), Proceedings of the Fifteenth International Symposium on Combinatorial Search, SOCS 2022, Vienna, Austria, July 21-23, 2022 (pp. 285–287). AAAI Press. https://doi.org/10.1609/SOCS.V15I1.217872022 / Fast Optimal and Bounded Suboptimal Euclidean Pathfinding
Shen, B., Cheema, M. A., Harabor, D. D., & Stuckey, P. J. (2022). Fast Optimal and Bounded Suboptimal Euclidean Pathfinding. Artificial Intelligence, 302, 103624. https://doi.org/https://doi.org/10.1016/j.artint.2021.1036242021 / Multi-Target Search in Euclidean Space with Ray Shooting
Hechenberger, R., Harabor, D., Cheema, M. A., Stuckey, P. J., & Bodic, P. L. (2021). Multi-Target Search in Euclidean Space with Ray Shooting. In H. Ma & I. Serina (Eds.), Proceedings of the Fourteenth International Symposium on Combinatorial Search, SOCS 2021, Virtual Conference [Jinan, China], July 26-30, 2021 (pp. 176–178). AAAI Press. https://doi.org/10.1609/SOCS.V12I1.185752020 / 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.2020 / Online Computation of Euclidean Shortest Paths in Two Dimensions
Hechenberger, R., Stuckey, P. J., Harabor, D., Bodic, P. L., & Cheema, M. A. (2020). Online Computation of Euclidean Shortest Paths in Two Dimensions. 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. 134–142). AAAI Press. https://aaai.org/ojs/index.php/ICAPS/article/view/66542018 / Fast k-Nearest Neighbor on a Navigation Mesh
Zhao, S., Taniar, D., & Harabor, D. D. (2018). Fast k-Nearest Neighbor on a Navigation Mesh. Proceedings of the Eleventh International Symposium on Combinatorial Search (SOCS), 124–132.2017 / Compromise-free Pathfinding on a Navigation Mesh
Cui, M. L., Harabor, D. D., & Grastien, A. (2017). Compromise-free Pathfinding on a Navigation Mesh. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI-17), 496–502. http://www.ijcai.org/proceedings/2017/0070.pdf2016 / Optimal Any-Angle Pathfinding In Practice
Harabor, D. D., Grastien, A., Öz, D., & Aksakalli, V. (2016). Optimal Any-Angle Pathfinding In Practice. Journal of Artificial Intelligence Research, 56, 89–118.2013 / An Optimal Any-Angle Pathfinding Algorithm
Harabor, D. D., & Grastien, A. (2013). An Optimal Any-Angle Pathfinding Algorithm. ICAPS.