Probabilistic Hierarchical Planning over Markov Decision Processes
Conference Paper, Proceedings of 10th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS '11), Vol. 1, pp. 296 - 297, May, 2011
Abstract
In this paper, we propose a new approach to using probabilistic hierarchical task networks (HTNs) as an effective method for agents to plan in conditions in which their problem-solving knowledge is uncertain, and the environment is non-deterministic. In such situations it is natural to model the environment as a Markov decision process (MDP). We show that using Earley graphs, it is possible to bridge the gap between HTNs and MDPs. We prove that the size of the Earley graph created for given HTNs is bounded by the total number of tasks in the HTNs and show that from the Earley graph we can then construct a plan for a given task that has the maximum expected value when it is executed in an MDP environment.
BibTeX
@conference{Tang-2011-7288,author = {Yuqing Tang and Felipe Meneguzzi and Katia Sycara and Simon Parsons},
title = {Probabilistic Hierarchical Planning over Markov Decision Processes},
booktitle = {Proceedings of 10th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS '11)},
year = {2011},
month = {May},
volume = {1},
pages = {296 - 297},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.