Show simple item record

dc.contributor.authorAguilar, Cesar O.
dc.contributor.authorKrener, Arthur J.
dc.date.accessioned2014-03-25T17:36:01Z
dc.date.available2014-03-25T17:36:01Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/10945/39595
dc.description.abstractIn this paper we develop a numerical method to compute high-order approximate solutions to Bellman's dynamic programming equation that arises in the optimal regulation of discrete-time nonlinear control systems. The method uses a patchy technique to build Taylor polynomial approximations defined on small domains which are then patched together to create a piecewise-smooth approximation. Using the values of the computed cost function as the step-size, levels of patches are constructed such that their radial boundaries are level sets of the computed cost functions and their lateral boundaries are invariants sets of the closed loop dynamics. To minimize the computational effort, an adaptive scheme is used to determine the number of patches on each level depending on the relative error of the computed solutions.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleHigh-order numerical solutions to Bellman's equation of optimal controlen_US
dc.typeArticleen_US
dc.contributor.corporateNaval Postgraduate School, Monterey, California
dc.contributor.departmentApplied Mathematics


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record