ICAPS 2000
Learning Plan Rewriting Rules
Abstract
Planning byRewriting (PbR) is a newparadigm forefficient high-quality plavningthat exploits plan rewriting rules and etficiel, t local search techniquesto tran~ form an easy-to-generate, butpossibly suboptimal, initial planintoa high-quality plan. Dcspitc theadvantages of PbRin termsof scalability, planquality, and anytime behavior, PbRrequires the user to define a set of domain-specific plan rewriting rules which can be difficult and time-consuming. This paper presents an approach to automatically learning the plaal rewriting rules basedon comparinginitial aJId oI>timai plans. Wereport results for several pla~nningdomains showingthat the learned rules are competitive with manually-specified ones, amdin several cases the lear. n~g zdgoritkmdiscovered novel rewriting rules.
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
- 400775336549758530