Computational Methods for Finite State Finite Valued Markovian Decision Problems.

Abstract

Markov and semi-Markov decision problems with a finite number of states and a finite number of actions are considered. A two phase computational system is developed. The first phase is an analysis phase which can be applied to an n state K action problem at a cost of betwen 5nK and 9nK multiplies and adds. The second phase of the computational method uses successive improvement of upper and lower bounds to eliminate nonoptimal actions until the optimal action is determined for one or more states. At this point, the analysis phase is used to eliminate these states and generate improved upper and lower bounds for the reduced problem. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1971
Accession Number
AD0726394

Entities

People

  • John C. Totten

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Computational Science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design