6 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.RO2023★ 6 cited
DMS*: Minimizing Makespan for Multi-Agent Combinatorial Path Finding
Zhongqiang Ren, Anushtup Nandy, Sivakumar Rathinam +1
Multi-Agent Combinatorial Path Finding (MCPF) seeks collision-free paths for multiple agents from their initial to goal locations, while visiting a set of intermediate target locat…
cs.RO2023★ 4 cited
Heuristic Search for Path Finding with Refuelling
Shizhe Zhao, Anushtup Nandy, Howie Choset +2
This paper considers a generalization of the Path Finding (PF) problem with refuelling constraints referred to as the Gas Station Problem (GSP). Similar to PF, given a graph where…