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.
Content
![](https://www.cambridge.org/engage/api-gateway/miir/assets/orp/resource/item/6316592e03e27df507ca3fe9/largeThumb/finding-the-limits-of-machine-learning-in-optimization.jpg)