STOMP: Stochastic trajectory optimization for motion planning
Citations Over TimeTop 1% of 2011 papers
Abstract
We present a new approach to motion planning using a stochastic trajectory optimization framework. The approach relies on generating noisy trajectories to explore the space around an initial (possibly infeasible) trajectory, which are then combined to produced an updated trajectory with lower cost. A cost function based on a combination of obstacle and smoothness cost is optimized in each iteration. No gradient information is required for the particular optimization algorithm that we use and so general costs for which derivatives may not be available (e.g. costs corresponding to constraints and motor torques) can be included in the cost function. We demonstrate the approach both in simulation and on a mobile manipulation system for unconstrained and constrained tasks. We experimentally show that the stochastic nature of STOMP allows it to overcome local minima that gradient-based methods like CHOMP can get stuck in.
Related Papers
- → Locating the local minima in lens design with machine learning(2021)3 cited
- → A Strategy to Solve the Local Minima Problem for Autonomous Mechanical Vehicles(2012)1 cited
- → Eliminating all bad Local Minima from Loss Landscapes without even adding an Extra Unit(2019)3 cited
- A USEFUL BP ALGORITHM TO OVERCOME LOCAL MINIMA(1995)
- Faster escaping from local minima for back-propagation algorithm(2008)