26 citations · 37 across the 10 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.AI2018★ 2 cited
Searching with Consistent Prioritization for Multi-Agent Path Finding
Hang Ma, Daniel Harabor, Peter J. Stuckey +2
We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixe…
cs.AI2018★ 1 cited
Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour
Shizhe Zhao, Daniel D. Harabor, David Taniar
We are interested in the problem of finding nearest neighbours in the plane and in the presence of polygonal obstacles (). Widely used algorithms for OkNN are ba…