Browsing Technical Reports (Electrical Engineering and Computer Science) by Subject "Approximation algorithms"

Now showing items 1-3 of 3

A POMDP approximation algorithm that anticipates the need to observe

Oregon State University. Dept. of Computer Science; Bayer, Valentina; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2000)

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, whos ...
A POMDP approximation algorithm that anticipates the need to observe

Oregon State University. Dept. of Computer Science; Zubek, Valentina Bayer; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2004-07-05)

This paper introduces the even-odd POMDP an approximation to POMDPs Partially Observable Markov Decision Problems in which the world is assumed to be fully observable every other time step. This approximation works wel ...
Two heuristics for solving POMDPs having a delayed need to observe

Oregon State University. Dept. of Computer Science; Zubek, Valentina Bayer; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2004)

A common heuristic for solving Partially Observable Markov Decision Problems POMDPs is to first solve the underlying Markov Decision Process MDP and then construct a POMDP policy by performing a fixed depth lookahead sea ...