26 citations · 37 across the 10 of their papers we have counts for
3 papers · 1 filter
Bi-objective Search with Bi-directional A*
Saman Ahmadi, Guido Tack, Daniel Harabor +1
Bi-objective search is a well-known algorithmic problem, concerned with finding a set of optimal solutions in a two-dimensional domain. This problem has a wide variety of applicati…
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):…