ICAPS 2004
Learning Probabilistic Relational Planning Rules
Abstract
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilistic STRIPS-like planning operators from examples. We demonstrate the effective learning of rule-based operators for a wide range of traditional planning domains.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- International Conference on Automated Planning and Scheduling
- Archive span
- 1990-2024
- Indexed papers
- 1573
- Paper id
- 430628830442001964