Abstract
The initial position and velocity of a robot is given, and the problem posed is to make it stop at the origin in the shortest possible time, given a maximum acceleration and speed. The optimization problem for the acceleration direction is solved numerically and analytically with both local and global optimization techniques.