62 citations · 274 across the 22 of their papers we have counts for
5 papers · 1 filter
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…
C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam +1
We introduce a new bounding approach called Continuity* C*, which provides optimality guarantees for the Moving-Target Traveling Salesman Problem (MT-TSP). Our approach relaxes the…
Multi-Agent Combinatorial Path Finding with Heterogeneous Task Duration
Yuanhang Zhang, Xuemian Wu, Hesheng Wang +1
Multi-Agent Combinatorial Path Finding (MCPF) seeks collision-free paths for multiple agents from their initial locations to destinations, visiting a set of intermediate target loc…
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…
Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree
Yimin Tang, Zhongqiang Ren, Jiaoyang Li +1
Combined Target-Assignment and Path-Finding problem (TAPF) requires simultaneously assigning targets to agents and planning collision-free paths for agents from their start locatio…