Derivative-Free Trajectory Optimization with Unscented Dynamic Programming

December 2016

Derivative-Free Trajectory Optimization with Unscented Dynamic Programming

Authors:

Zac Manchester and Scott Kuindersma

Abstract:

Trajectory optimization algorithms are a core technology behind many modern nonlinear control applications. However, with increasing system complexity, the computation of dynamics derivatives during optimization creates a computational bottleneck, particularly in second-order methods. In this paper, we present a modification of the classical Differential Dynamic Programming (DDP) algorithm that eliminates the computation of dynamics derivatives while maintaining similar convergence properties. Rather than relying on naive finite difference calculations, we propose a deterministic sampling scheme inspired by the Unscented Kalman Filter that propagates a quadratic approximation of the cost-to-go function through the nonlinear dynamics at each time step. Our algorithm takes larger steps than Iterative LQR-a DDP variant that approximates the cost-to-go Hessian using only first derivatives-while maintaining the same computational cost. We present results demonstrating its numerical performance in simulated balancing and aerobatic flight experiments.
@conference{Manchester-2016-122123,
author = {Zac Manchester And Scott Kuindersma},
title = {Derivative-Free Trajectory Optimization with Unscented Dynamic Programming},
booktitle = {Proceedings of IEEE 55th Conference on Decision and Control (CDC '16)},
year = {2016},
month = {December},
pages = {3642 - 3647},
}
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.