60 search results - page 1 / 12 » Stochastic Planning with First Order Decision Diagrams |
91
Voted
AIPS
2008
15 years 1 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
103
Voted
IJCAI
2007
15 years 10 days ago
2007
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
107
Voted
MP
2008
14 years 11 months ago
2008
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
87
Voted
AAAI
2010
15 years 11 days ago
2010
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
AIPS
2006
15 years 9 days ago
2006
We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of ...