Carnegie Mellon University
Browse

Trajectory-Based Dynamic Programming

Download (876.44 kB)
journal contribution
posted on 2013-01-01, 00:00 authored by Christopher G. Atkeson, Chenggang Liu

This paper reviews a variety of ways to use trajectory optimization to accelerate dynamic programming. Dynamic programming provides a way to design globally optimal control laws for nonlinear systems. However, the curse of dimensionality, the exponential dependence of space and computation resources needed on the dimensionality of the state and control, limits the application of dynamic programming in practice. We explore trajectory-based dynamic programming, which combines many local optimizations to accelerate the global optimization of dynamic programming

History

Publisher Statement

The final publication is available at Springer via http://dx.doi.org/

Date

2013-01-01

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC