no code implementations • 7 Mar 2024 • Allen George Philip, Zhongqiang Ren, Sivakumar Rathinam, Howie Choset
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 starts at a depot, visits a set of moving targets exactly once within their assigned time-windows, and returns to the depot.