Home/Constrained CHOMP using Dual Projected Newton Method

Constrained CHOMP using Dual Projected Newton Method

Sanjiban Choudhury and Sebastian Scherer
Tech. Report, CMU-RI-TR-16-17, Robotics Institute, Carnegie Mellon University, May, 2016

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.


CHOMP is a popular trajectory optimization algorithm that uses covari- ant gradient techniques to produce high quality solutions. In its original formulation, it solves an unconstrained sequentially quadratic problem with extensions for handling equality constraints. In this paper we present an approach to solve sequentially quadratic problem with linear inequality con- straints. We present a dual projected newton method to efficiently solve this problem. The proposed method alternates between primal and dual up- dates thus leading to faster convergence than solving a constrained quadratic program at each iteration.

BibTeX Reference
title = {Constrained CHOMP using Dual Projected Newton Method},
author = {Sanjiban Choudhury and Sebastian Scherer},
school = {Robotics Institute , Carnegie Mellon University},
month = {May},
year = {2016},
number = {CMU-RI-TR-16-17},
address = {Pittsburgh, PA},