Sciweavers

Share
71 search results - page 1 / 15
» First Order Decision Diagrams for Relational MDPs
Sort
View
IJCAI
2007
8 years 8 months ago
First Order Decision Diagrams for Relational MDPs
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
Chenggang Wang, Saket Joshi, Roni Khardon
AAAI
2010
8 years 8 months ago
Relational Partially Observable MDPs
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 ...
Chenggang Wang, Roni Khardon
IJCAI
2001
8 years 8 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price
AIPS
2008
8 years 9 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
JAIR
2006
120views more  JAIR 2006»
8 years 7 months ago
FluCaP: A Heuristic Search Planner for First-Order MDPs
We present a heuristic search algorithm for solving first-order Markov Decision Processes (FOMDPs). Our approach combines first-order state abstraction that avoids evaluating stat...
Steffen Hölldobler, Eldar Karabaev, Olga Skvo...
books