Showing 2025Show all
2 papers · 1 filter
cs.RO2025
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…
cs.RO2025
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…