4 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.AI2019★ 4 cited
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…
cs.AI2011
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…
cs.AI2011
Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains
Daniel Harabor, Philip Kilby
The state of the art in local search for the Traveling Salesman Problem is dominated by ejection chain methods utilising the Stem-and-Cycle reference structure. Though effective su…