62 citations · 274 across the 22 of their papers we have counts for
3 papers · 1 filter
Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The Moving Target Traveling Salesman Problem (MT-TSP) seeks a trajectory that intercepts several moving targets, within a particular time window for each target. When generic nonli…
A Complete and Bounded-Suboptimal Algorithm for a Moving Target Traveling Salesman Problem with Obstacles in 3D
Anoop Bhat, Geordan Gutow, Bhaskar Vundurthy +3
The moving target traveling salesman problem with obstacles (MT-TSP-O) seeks an obstacle-free trajectory for an agent that intercepts a given set of moving targets, each within spe…
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…