62 citations · 370 across the 54 of their papers we have counts for
5 papers · 1 filter
Heuristic for Min-Max Heterogeneous Multi-Vehicle Multi-Depot Traveling Salesman Problem
Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha +1
In this article, a heuristic is proposed for a min-max heterogeneous multi-vehicle multi-depot traveling salesman problem (TSP), wherein heterogeneous vehicles start from given dep…
Assisted Path Planning for a UGV-UAV Team Through a Stochastic Network
Abhay Singh Bhadoriya, Sivakumar Rathinam, Swaroop Darbha +2
In this article, we consider a multi-agent path planning problem in a stochastic environment. The environment, which can be an urban road network, is represented by a graph where t…
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…
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…