Lower Bounds for Moving Target Traveling Salesman Motion Planning with Obstacles

NSH 3305

Abstract: We study the problem of finding a trajectory for an agent to intercept a number of moving targets while avoiding obstacles. Applications include resupplying naval ships at sea and recharging aerial vehicles with a ground vehicle. We model the problem as an extension of the traveling salesman problem, which we refer to as the [...]