AAAI Publications, Twenty-First International Conference on Automated Planning and Scheduling

Font Size: 
Efficient Policy Construction for MDPs Represented in Probabilistic PDDL
Boris Lesner, Bruno Zanuttini

Last modified: 2011-03-22


We present a novel dynamic programming approach to computing optimal policies for Markov Decision Processes compactly represented in grounded Probabilistic PDDL. Unlike other approaches, which use an intermediate representation as Dynamic Bayesian Networks, we directly exploit the PPDDL description by introducing dedicated backup rules. This provides an alternative approach to DBNs, especially when actions have highly correlated effects on variables. Indeed, we show interesting improvements on several planning domains from the International Planning Competition. Finally, we exploit the incremental flavor of our backup rules for designing promising approaches to policy revision.

Full Text: PDF