首页 | 本学科首页   官方微博 | 高级检索  
     


Approximate dynamic programming for stochastic linear control problems on compact state spaces
Authors:Stefan Woerner  Marco Laumanns  Rico Zenklusen  Apostolos Fertis
Affiliation:1. IBM Research, Saeumerstrasse 4, 8803 Rueschlikon, Switzerland;2. ETH Zurich, Raemistrasse 101, 8092 Zurich, Switzerland;3. SMA und Partner AG, Gubelstrasse 28, 8050 Zurich, Switzerland
Abstract:This paper addresses Markov Decision Processes over compact state and action spaces. We investigate the special case of linear dynamics and piecewise-linear and convex immediate costs for the average cost criterion. This model is very general and covers many interesting examples, for instance in inventory management. Due to the curse of dimensionality, the problem is intractable and optimal policies usually cannot be computed, not even for instances of moderate size.
Keywords:Dynamic programming   Markov processes   Inventory   Dual sourcing   Multiple sourcing
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号