A dynamic programming algorithm in stochastic systems
β Scribed by V.V. Baranov
- Publisher
- Elsevier Science
- Year
- 1978
- Weight
- 841 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## A dynamic programming procedure for determining the optimal just-in-time (JIT) production schedule for a mixed-model facility is presented. Compared to previously available optimization methods it substantially reduces computation and storage requirements, enabling practical-sized problems to b
A time domain input estimation algorithm for linear systems with general time-varying parameters is developed. The algorithm is an extension of an existing approach for time-invariant state space models and several new features, such as higher order input approximations and an extended time-variant
## Abstract In this paper we develop a simulationβbased approach to stochastic dynamic programming. To solve the Bellman equation we construct Monte Carlo estimates of __Q__βvalues. Our method is scalable to high dimensions and works in both continuous and discrete state and decision spaces while a