Computer Science – Artificial Intelligence
Scientific paper
2012-02-14
Computer Science
Artificial Intelligence
Scientific paper
Many real-world decision-theoretic planning problems can be naturally modeled with discrete and continuous state Markov decision processes (DC-MDPs). While previous work has addressed automated decision-theoretic planning for DCMDPs, optimal solutions have only been defined so far for limited settings, e.g., DC-MDPs having hyper-rectangular piecewise linear value functions. In this work, we extend symbolic dynamic programming (SDP) techniques to provide optimal solutions for a vastly expanded class of DCMDPs. To address the inherent combinatorial aspects of SDP, we introduce the XADD - a continuous variable extension of the algebraic decision diagram (ADD) - that maintains compact representations of the exact value function. Empirically, we demonstrate an implementation of SDP with XADDs on various DC-MDPs, showing the first optimal automated solutions to DCMDPs with linear and nonlinear piecewise partitioned value functions and showing the advantages of constraint-based pruning for XADDs.
de Barros Leliane Nunes
Delgado Karina Valdivia
Sanner Scott
No associations
LandOfFree
Symbolic Dynamic Programming for Discrete and Continuous State MDPs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Symbolic Dynamic Programming for Discrete and Continuous State MDPs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic Dynamic Programming for Discrete and Continuous State MDPs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-90677