62 citations · 370 across the 54 of their papers we have counts for
5 papers · 1 filter
Heterogeneous Min-Max Multi-Vehicle Multi-Depot Traveling Salesman Problem: Heuristics and Computational Results
Deepak Prakash Kumar, Sivakumar Rathinam, Swaroop Darbha +1
In this paper, a heuristic for a heterogeneous min-max multi-vehicle multi-depot traveling salesman problem is proposed, wherein heterogeneous vehicles start from given depot locat…
A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The moving target traveling salesman problem with obstacles (MT-TSP-O) is a generalization of the traveling salesman problem (TSP) where, as its name suggests, the targets are movi…
The Persistent Robot Charging Problem for Long-Duration Autonomy
Nitesh Kumar, Jaekyung Jackie Lee, Sivakumar Rathinam +3
This paper introduces a novel formulation aimed at determining the optimal schedule for recharging a fleet of heterogeneous robots, with the primary objective of minimizing res…
for Graphs of Convex Sets
Kaarthik Sundar, Sivakumar Rathinam
We present a novel algorithm that fuses the existing convex-programming based approach with heuristic information to find optimality guarantees and near-optimal paths for the Short…
A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets
Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam +1
This paper introduces a new formulation that finds the optimum for the Moving-Target Traveling Salesman Problem (MT-TSP), which seeks to find a shortest path for an agent, that sta…