181 search results - page 1 / 37 » Online Planning Algorithms for POMDPs |
JAIR
2008
14 years 10 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
90
Voted
NIPS
2007
14 years 11 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
78
Voted
AAAI
2010
14 years 11 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
86
Voted
PRICAI
2000
Springer
15 years 1 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...
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— We consider the problem of optimal control in continuous and partially observable environments when the parameters of the model are not known exactly. Partially Observable Mark...