Abstract
Case-Based planning can fruitfully exploit knowledge gained by solving a large number of problems, storing the corresponding solutions in a plan library and reusing them for solving similar planning problems in the future. Case-based planning is extremely effective when similar reuse candidates can be efficiently chosen. In this paper, we study an innovative technique based on planning problem features for efficiently retrieving solved planning problems (and relative plans) from large plan libraries. Since existing planning features are not always able to effectively distinguish between problems within the same planning domain, we introduce a new class of features. Our experimental analysis shows that the proposed features-based retrieval approach can significantly improve the performance of a state-of-theart case-based planning system.
Original language | English |
---|---|
Title of host publication | Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015) |
Editors | Ronen Brafman, Carmel Domshlak, Patrik Haslum, Shlomo Zilberstein |
Publisher | AAAI press |
Pages | 239-243 |
Number of pages | 5 |
ISBN (Electronic) | 9781577357315 |
Publication status | Published - Apr 2015 |
Event | 25th International Conference on Automated Planning and Scheduling - Jerusalem, Israel Duration: 7 Jun 2015 → 11 Jun 2015 Conference number: 25 http://icaps15.icaps-conference.org (Link to Conference Website ) |
Conference
Conference | 25th International Conference on Automated Planning and Scheduling |
---|---|
Abbreviated title | ICAPS 2015 |
Country/Territory | Israel |
City | Jerusalem |
Period | 7/06/15 → 11/06/15 |
Internet address |
|