By Topic

Parallel Data Vault Methods for Larger Scale Stochastic Dynamic Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xu, H.H. ; Laboratory for Advanced Computing, Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, P. O. Box 4348; M/C 249, Chicago, IL 60680 ; Jarvis, D.J. ; Hanson, F.B.

The decomposition of the finite difference approximation to stochastic dynamic programming problems is described for the optimal control of nonlinear, continuous time dynamical systems. The stochastic components include both Gaussian and Poisson random white noise. A parallel data vault mass storage method is developed to take advantage of the decomposition, and therefore to help alleviate Bellman's curse of dimensionality in dynamic programming computations. It is shown that data vault memory on the data parallel Connection Machine type computational model can be enhance the efficiency of the decomposition performance. Extension of the data vault technique to a more general stochastic optimal control problem is discussed. Performance on the Connection Machine for larger scale stochastic dynamic programming problems, such as resource management problems with up to a projected six states, are illustrated and discussed.

Published in:

American Control Conference, 1992

Date of Conference:

24-26 June 1992