Abstract and Applied Analysis
- Abstr. Appl. Anal.
- Volume 2009 (2009), Article ID 103723, 17 pages.
Policy Iteration for Continuous-Time Average Reward Markov Decision Processes in Polish Spaces
We study the policy iteration algorithm (PIA) for continuous-time jump Markov decision processes in general state and action spaces. The corresponding transition rates are allowed to be unbounded, and the reward rates may have neither upper nor lower bounds. The criterion that we are concerned with is expected average reward. We propose a set of conditions under which we first establish the average reward optimality equation and present the PIA. Then under two slightly different sets of conditions we show that the PIA yields the optimal (maximum) reward, an average optimal stationary policy, and a solution to the average reward optimality equation.
Abstr. Appl. Anal., Volume 2009 (2009), Article ID 103723, 17 pages.
First available in Project Euclid: 16 March 2010
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Zhu, Quanxin; Yang, Xinsong; Huang, Chuangxia. Policy Iteration for Continuous-Time Average Reward Markov Decision Processes in Polish Spaces. Abstr. Appl. Anal. 2009 (2009), Article ID 103723, 17 pages. doi:10.1155/2009/103723. https://projecteuclid.org/euclid.aaa/1268745624