Receding horizon differential dynamic programming

98Citations
Citations of this article
187Readers
Mendeley users who have this article in their library.

Abstract

The control of high-dimensional, continuous, non-linear dynamical systems is a key problem in reinforcement learning and control. Local, trajectory-based methods, using techniques such as Differential Dynamic Programming (DDP), are not directly subject to the curse of dimensionality, but generate only local controllers. In this paper,we introduce Receding Horizon DDP (RH-DDP), an extension to the classic DDP algorithm, which allows us to construct stable and robust controllers based on a library of local-control trajectories. We demonstrate the effectiveness of our approach on a series of high-dimensional problems using a simulated multi-link swimming robot. These experiments show that our approach effectively circumvents dimensionality issues, and is capable of dealing with problems of (at least) 24 state and 9 action dimensions.

Cite

CITATION STYLE

APA

Tassa, Y., Erez, T., & Smart, B. (2008). Receding horizon differential dynamic programming. In Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference. Neural Information Processing Systems.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free