Format

Send to

Choose Destination
IEEE Trans Neural Netw. 2011 Dec;22(12):2392-8. doi: 10.1109/TNN.2011.2165729. Epub 2011 Sep 26.

Approximate dynamic programming for optimal stationary control with control-dependent noise.

Author information

1
Department of Electrical and Computer Engineering, Polytechnic Institute of New York University, Brooklyn, NY 11201, USA. yu.jiang@nyu.edu

Abstract

This brief studies the stochastic optimal control problem via reinforcement learning and approximate/adaptive dynamic programming (ADP). A policy iteration algorithm is derived in the presence of both additive and multiplicative noise using Itô calculus. The expectation of the approximated cost matrix is guaranteed to converge to the solution of some algebraic Riccati equation that gives rise to the optimal cost value. Moreover, the covariance of the approximated cost matrix can be reduced by increasing the length of time interval between two consecutive iterations. Finally, a numerical example is given to illustrate the efficiency of the proposed ADP methodology.

PMID:
21954203
DOI:
10.1109/TNN.2011.2165729
[Indexed for MEDLINE]

Supplemental Content

Full text links

Icon for IEEE Engineering in Medicine and Biology Society
Loading ...
Support Center