89 search results - page 1 / 18 » A POMDP Approximation Algorithm That Anticipates the Need to... |
PRICAI
2000
Springer
13 years 8 months ago
2000
Springer
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 converte...
IJCAI
2001
13 years 6 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
13 years 6 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
IJRR
2010
13 years 3 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...