Optimal switching among a finite number of Markov processes |
| |
Authors: | B Doshi |
| |
Institution: | (1) Bell Laboratories, Holmdel, New Jersey;(2) Present address: New Brunswick, New Jersey |
| |
Abstract: | This paper investigates the problem of the optimal switching among a finite number of Markov processes, generalizing some of the author's earlier results for controlled one-dimensional diffusion. Under rather general conditions, it is shown that the optimal discounted cost function is the unique solution of a functional equation. Under more restrictive assumptions, this function is shown to be the unique solution of some quasi-variational inequalities. These assumptions are verified for a large class of control problems. For controlled Markov chains and controlled one-dimensional diffusion, the existence of a stationary optimal policy is established. Finally, a policy iteration method is developed to calculate an optimal stationary policy, if one exists.This research was sponsored by the Air Force Office of Scientific Research (AFSC), United States Air Force, under Contract No. F-49620-79-C-0165.The author would like to thank the referee for bringing Refs. 7, 8, and 9 to his attention. |
| |
Keywords: | Markov decision processes optimal switching discounted costs quasi-variational inequalities stationary optimal policy policy iteration |
本文献已被 SpringerLink 等数据库收录! |
|