First order decision diagrams for relational MDPs

Authors:
Chenggang Wang;Saket Joshi;Roni Khardon
Affiliations:
Department of Computer Science, Tufts University, Medford, MA;Department of Computer Science, Tufts University, Medford, MA;Department of Computer Science, Tufts University, Medford, MA
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 9
Cited 5

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Algebraic decision diagrams and their applications

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Top-down induction of first-order logical decision trees

Artificial Intelligence
Markov Decision Processes: Discrete Stochastic Dynamic Programming

Markov Decision Processes: Discrete Stochastic Dynamic Programming
Learning Decision Lists

Machine Learning
Bellman goes relational

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Generalizing plans to new environments in relational MDPs

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Symbolic dynamic programming for first-order MDPs

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
SPUDD: stochastic planning using decision diagrams

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Non-parametric policy gradients: a unified treatment of propositional and relational domains

Proceedings of the 25th international conference on Machine learning
Practical solution techniques for first-order MDPs

Artificial Intelligence
First order decision diagrams for relational MDPs

Journal of Artificial Intelligence Research
Intensional dynamic programming. A Rosetta stone for structured dynamic programming

Journal of Algorithms
Towards relational POMDPs for adaptive dialogue management

ACLstudent '10 Proceedings of the ACL 2010 Student Research Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams suitable for describing value functions, transition probabilities, and domain dynamics of First Order or Relational MDPs (FOMDP). By developing appropriate operations for such diagrams the paper shows how value iteration can be performed compactly for such problems. This improves on previous approaches since the representation combines compact form with efficient operations. The work also raises interesting issues on suitability of different representations to different FOMDPs tasks.