An approach to generate MDPs using HTN representations

Felipe Meneguzzi, Katia Sycara, Yuqing Tang, Simon Parsons

Research output: Chapter in Book/Report/Conference proceedingPublished conference contribution


Planning for deterministic and probabilistic domains differ significantly in representations they require, the algorithms that solve them and the way in which results are represented. Hierarchical Task Networks (HTN) and Markov Decision Process (MDPs) are representative formalisms of, respectively, deterministic and stochastic planning. Stochastic domain specifications can easily become opaque to a human designer, especially as the domain size increases. Our research aims to develop algorithms for lossless and automatic mapping of HTN models that are easily intelligible to humans into MDPs. In this paper we develop algorithms to convert deterministic planning domains with HTN domain knowledge and an action error model into MDPs that can then be solved, while maintaining a bound on the number of MDP states.
Original languageEnglish
Title of host publicationDecision Making in Partially Observable, Uncertain Worlds: Exploring Insights from Multiple Communities
Number of pages6
Publication statusPublished - 2011
Externally publishedYes


Dive into the research topics of 'An approach to generate MDPs using HTN representations'. Together they form a unique fingerprint.

Cite this