Search Results for author:
Found 2 papers, 0 papers with code
Tracking Progress in Multi-Agent Path Finding
Multi-Agent Path Finding (MAPF) is an important core problem for many new and emerging industrial applications.
Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour
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.
