102 search results - page 1 / 21 » VDCBPI: an Approximate Scalable Algorithm for Large POMDPs |
NIPS
2004
14 years 11 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
142
Voted
PKDD
2010
Springer
14 years 8 months ago
2010
Springer
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
100
Voted
ATAL
2010
Springer
14 years 11 months 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...
86
Voted
JAIR
2006
14 years 10 months ago
2006
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
93
Voted
ISRR
2005
Springer
15 years 3 months ago
2005
Springer
POMDPs provide a rich framework for planning and control in partially observable domains. Recent new algorithms have greatly improved the scalability of POMDPs, to the point where...