OPTIMUM POLICIES FOR PARTIALLY OBSERVABLE MARKOV SYSTEMS

Abstract

The problem considered is the monitoring of a discrete-state Markov process through a noisy channel with associated costs. Dynamic programming techniques are used to establish the optimal monitoring decision policies for both transient and steady-state situations. Examples are included.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1965
Accession Number
AD0480213

Entities

People

  • James S. Kakalik

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Contracts
  • Dynamic Programming
  • Engineering
  • Equations
  • Governments
  • Markov Processes
  • Massachusetts
  • Military Research
  • Operations Research
  • Probabilistic Models
  • Probability

Fields of Study

  • Engineering

Readers

  • Mathematical Modeling and Probability Theory.
  • Radio communications and signal processing.