Semi-Markov decision processes
Abstract
This chapter presents basic concepts and results of the theory of semi-Markov decision processes. The algorithm of optimization of a SM decision process with a finite number of state changes is discussed here. The algorithm is based on a dynamic programming method. To clarify it, the SM decision model for the maintenance operation is shown. The optimization problem for the infinite duration SM process and the Howard algorithm, which enables us to find the optimal stationary strategy, is also discussed here. To explain this algorithm, a decision problem for a renewable series system is presented.
Keywords
Semi-Markov decision processes
Optimization
Dynamic programming
Howard algorithm
15.1 Introduction ...
Get Semi-Markov Processes now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
