64 search results - page 2 / 13 » A dynamic programming algorithm for decentralized Markov dec... |
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...
AAAI
2006
13 years 6 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
JAIR
2010
13 years 3 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...