Constrained CHOMP using Dual Projected Newton Method - Robotics Institute Carnegie Mellon University

Constrained CHOMP using Dual Projected Newton Method

Tech. Report, CMU-RI-TR-16-17, Robotics Institute, Carnegie Mellon University, May, 2016

Abstract

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

@techreport{Choudhury-2016-5506,
author = {Sanjiban Choudhury and Sebastian Scherer},
title = {Constrained CHOMP using Dual Projected Newton Method},
year = {2016},
month = {May},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-16-17},
}