Search Results for author: Daniel D. Harabor

Found 2 papers, 0 papers with code

Tracking Progress in Multi-Agent Path Finding

no code implementations15 May 2023 Bojie Shen, Zhe Chen, Muhammad Aamir Cheema, Daniel D. Harabor, Peter J. Stuckey

Multi-Agent Path Finding (MAPF) is an important core problem for many new and emerging industrial applications.

Multi-Agent Path Finding

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

no code implementations13 Aug 2018 Shizhe Zhao, Daniel D. Harabor, David Taniar

We are interested in the problem of finding $k$ nearest neighbours in the plane and in the presence of polygonal obstacles ($\textit{OkNN}$).

Cannot find the paper you are looking for? You can Submit a new open access paper.