Home /Research /CHOMP: Covariant Hamiltonian optimization for motion planning
MANIPULATION

CHOMP: Covariant Hamiltonian optimization for motion planning

Matt Zucker, Nathan Ratliff, Anca D. Dragan, Mihail Pivtoraiko, Matthew Klingensmith, Christopher M. Dellin, J. Andrew Bagnell, Siddhartha S Srinivasa

Year
2013
Citations
738

Abstract

In this paper, we present CHOMP (covariant Hamiltonian optimization for motion planning), a method for trajectory optimization invariant to reparametrization. CHOMP uses functional gradient techniques to iteratively improve the quality of an initial trajectory, optimizing a functional that trades off between a smoothness and an obstacle avoidance component. CHOMP can be used to locally optimize feasible trajectories, as well as to solve motion planning queries, converging to low-cost trajectories even when initialized with infeasible ones. It uses Hamiltonian Monte Carlo to alleviate the problem of convergence to high-cost local minima (and for probabilistic completeness), and is capable of respecting hard constraints along the trajectory. We present extensive experiments with CHOMP on manipulation and locomotion tasks, using seven-degree-of-freedom manipulators and a rough-terrain quadruped robot.

Keywords

Motion planningMaxima and minimaProbabilistic roadmapCovariant transformationTrajectory optimizationMathematical optimizationProbabilistic logicComputer scienceObstacle avoidanceMathematics

Related papers

Browse all MANIPULATION papers