Location of Repository

Learning Partial Models for Hierarchical Planning

By Neville Mehta and Prasad Tadepalli

Abstract

AI planning research typically assumes that complete action models are given. On the other hand, popular approaches in reinforcement learning such as Q-learning completely eschew models and planning. Neither of these approaches is satisfactory to achieve robust human-level AI that includes planning and learning in rich structured domains. In this paper, we introduce the idea of planning with partial models. While complete action models may be exponentially large, some domains may still have polynomial size partial models which are adequate for hierarchical planning. We describe algorithms for planning with partial models in the context of serializable domains, and for learning them from observation. Empirically, we demonstrate the effectiveness of partial models for learning and hierarchical planning in versions of the taxi domain.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.188.769
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.umd.edu/%7Eukute... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.