9 search results - page 1 / 2 » Point-based backup for decentralized POMDPs: complexity and ... |
ATAL
2010
Springer
13 years 7 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...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
AAMAS
2010
Springer
13 years 6 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
AIPS
2007
13 years 8 months ago
2007
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity ...