Abstract
Restricting the search space has shown to be an effective approach for improving the performance of automated planning systems. A planner-independent technique for pruning the search space is domain and problem reformulation. Recently, Outer Entanglements, which are relations between planning operators and initial or goal predicates, have been introduced as a reformulation technique for eliminating potential undesirable instances of planning operators, and thus restricting the search space. Reformulation techniques, however, have been mainly applied in classical planning, although many real-world planning applications require to deal with numerical information. In this paper, we investigate the usefulness of reformulation approaches in planning with numerical fluents. In particular, we propose and extension of the notion of outer entanglements for handling numeric fluents. An empirical evaluation, which involves 150 instances from 5 domains, shows promising results.
Original language | English |
---|---|
Title of host publication | Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015 |
Publisher | AAAI press |
Pages | 166-170 |
Number of pages | 5 |
ISBN (Electronic) | 9781577357322 |
Publication status | Published - 14 May 2015 |
Event | 8th Annual Symposium on Combinatorial Search - Ein Gedi, Israel Duration: 11 Jun 2015 → 13 Jun 2015 Conference number: 8 http://www.ise.bgu.ac.il/socs2015/ (Link to Conference Website) |
Conference
Conference | 8th Annual Symposium on Combinatorial Search |
---|---|
Abbreviated title | SoCS 2015 |
Country/Territory | Israel |
City | Ein Gedi |
Period | 11/06/15 → 13/06/15 |
Internet address |
|