181 search results - page 8 / 37 » Online Planning Algorithms for POMDPs |
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
104
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
113
click to vote
ATAL
2010
Springer
15 years 25 days ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
101
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
ECML
2005
Springer
15 years 5 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...