Chrpa, Lukáš, Scala, Enrico and Vallati, Mauro (2015) Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements. In: Symposium on Combinatorial Search (SoCS 2015), 11th-13th June 2015, Ein Gedi, The Dead Sea, Israel. (Unpublished)
- Accepted Version
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
|Schools:||School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
|Depositing User:||Lukas Chrpa|
|Date Deposited:||14 May 2015 15:28|
|Last Modified:||05 Dec 2016 18:29|
Downloads per month over past year
Repository Staff Only: item control page