Close category search window
 

Stage-lookahead dynamic programming algorithms for stochastic problems with time-lagged control dynamics

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

2 Author(s)
Mizutani, E. ; Dept. of Ind. Manage., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Dreyfus, S.

We investigate three stochastic problems (linear dynamics quadratic criterion, minimum-cost path, equipment replacement) with time-delayed control dynamics. We show how the concept of ¿stage lookahead¿ helps to reduce the number of arguments in the optimal value function of dynamic programming in order to alleviate the so-called curse of dimensionality.

Published in:
Industrial Engineering and Engineering Management, 2009. IEEM 2009. IEEE International Conference on

Date of Conference: 8-11 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.