32 search results - page 1 / 7 » Stochastic dynamic programming with factored representations |
AI
2000
Springer
13 years 4 months ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
AIPS
2000
13 years 6 months ago
2000
NIPS
2007
13 years 6 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
AAAI
2004
13 years 6 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
AIPS
1998
13 years 6 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...