Computational comparison of value iteration algorithms for discounted Markov decision processes
MetadataShow full item record
This note describes the results of a computational comparison of value iteration algorithms suggested for solving finite state discounted Markov decision processes. Such a process visits a set of states S = (1,2,...M). In Section two we describe the schemes examined and the various bounds that can be used for stopping them. Section three concentrates on one scheme that did well in the comparison - ordinary value iteration - and looks at various methods for eliminating non-optimal actions both permanently and temporarily
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
NPS Report NumberNPS55-82-034
Showing items related by title, author, creator and subject.
Batteson, Bruce (Monterey, CA; Naval Postgraduate School, 2019-09);Fast neutron detection is critical to the interdiction of illicit special nuclear material, among other potential applications. The use of heavy oxide scintillators to detect fast neutrons is one technology requiring little ...
Brodehl, Richard Brian (Monterey, California. U.S. Naval Postgraduate School, 1967-09);This paper is concerned with the comparison of four different non-divergent wind fields obtained from a single geopotential height field over a dense data area. After developing the divergence equation of the non-divergent ...
Russell, Gary P. (Monterey, CaliforniaNaval Postgraduate School, 1999-12);The "Weimar Russia" analogy is based on a comparison between the failures of the Weimar Republic in Germany (1918-33) and the current problems of post-Soviet Russia. The premise of the analogy is that initial advances ...