LOWER BOUNDS FOR A VEHICLE ROUTING PROBLEM WITH MOTION CONSTRAINTS
Satyanarayana G. Manyam, Sivakumar Rathinam, Swaroop Darbha, Karl J. Obermeyer · International Journal of Robotics and Automation · 2015
Given a set of targets that needs to be monitored and a vehicle, we consider a combinatorial motion planning problem where the objective is to find a path for the vehicle such that each target is visited at least once by the vehicle: the path satisfies the motion constraints of the vehicle and the length of the path is a minimum.