6 citations · 6 across the 4 of their papers we have counts for
4 papers
Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles
Allen George Philip, Anoop Bhat, Sivakumar Rathinam +1
The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a minimum cost trajectory for an agent that departs from a static depot, visits a set of moving targets, each within one…
A Mixed-Integer Conic Program for the Multi-Agent Moving-Target Traveling Salesman Problem
Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam +1
The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a shortest path for an agent that starts at a stationary depot, visits a set of moving targets exactly once, each within…
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…
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…