CHOMP: Covariant Hamiltonian optimization for motion planning

Matt Zucker(Swarthmore College), Nathan Ratliff(Google (United States)), Anca D. Dragan(Carnegie Mellon University), Mihail Pivtoraiko(University of Pennsylvania), Matthew Klingensmith(Carnegie Mellon University), Christopher M. Dellin(Carnegie Mellon University), J. Andrew Bagnell(Carnegie Mellon University), Siddhartha S Srinivasa(Carnegie Mellon University)
The International Journal of Robotics Research
August 1, 2013
Cited by 738Open Access
Full Text

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.


Related Papers

No related papers found

Powered by citation graph analysis