26 citations · 34 across the 6 of their papers we have counts for
7 papers · 1 filter
Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search
Jiaoyang Li, Daniel Harabor, Peter J. Stuckey +1
Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks us to plan collision-free paths for a team of cooperative agents. In this work, we show that one of…
Symmetry Breaking for k-Robust Multi-Agent Path Finding
Zhe Chen, Daniel Harabor, Jiaoyang Li +1
During Multi-Agent Path Finding (MAPF) problems, agents can be delayed by unexpected events. To address such situations recent work describes k-Robust Conflict-BasedSearch (k-CBS):…
Position Paper: From Multi-Agent Pathfinding to Pipe Routing
Gleb Belov, Liron Cohen, Maria Garcia de la Banda +3
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D e…
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…
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…
Symmetry-Based Search Space Reduction For Grid Maps
Daniel Harabor, Adi Botea, Philip Kilby
In this paper we explore a symmetry-based search space reduction technique which can speed up optimal pathfinding on undirected uniform-cost grid maps by up to 38 times. Our techni…