Technical Report

 

A POMDP approximation algorithm that anticipates the need to observe Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/technical_reports/rx913r21h

Descriptions

Attribute NameValues
Alternative Title
Creator
Abstract
  • This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converted into an equivalent MDP, the 2MDP, whose value function, V*[subscript 2MDP], can be combined online with a 2-step lookahead search to provide a good POMDP policy. We prove that this gives an approximation to the POMDP's optimal value function that is at least as good as methods based on the optimal value function of the underlying MDP. We present experimental evidence that the method gives better policies, and we show that it can find a good policy for a POMDP with 10,000 states and observations.
  • Keywords: Partially Observable Markov Decision Problem, even-odd POMDP, POMDP
  • Keywords: Partially Observable Markov Decision Problem, even-odd POMDP, POMDP
Resource Type
Date Available
Date Issued
Series
Subject
Rights Statement
Funding Statement (additional comments about funding)
  • This research was supported by AFOSR F49620-9810375 and NSF 9626584-IRI.
Publisher
Peer Reviewed
Language
Replaces

Relationships

Parents:

This work has no parents.

Items