Optimizing Motion-Planning Problem Setup via Bounded Evaluation with Application to Following Surgical Trajectories.

A motion-planning problem's setup can drastically affect the quality of solutions returned by the planner. In this work we consider optimizing these setups, with a focus on doing so in a computationally-efficient fashion. Our approach interleaves optimization with motion planning, which allows us to consider the actual motions required of the robot.