Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements

Lukáš Chrpa, Enrico Scala, Mauro Vallati

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015
PublisherAAAI press
Pages166-170
Number of pages5
ISBN (Electronic)9781577357322
Publication statusPublished - 14 May 2015
Event8th Annual Symposium on Combinatorial Search - Ein Gedi, Israel
Duration: 11 Jun 201513 Jun 2015
Conference number: 8
http://www.ise.bgu.ac.il/socs2015/ (Link to Conference Website)

Conference

Conference8th Annual Symposium on Combinatorial Search
Abbreviated titleSoCS 2015
Country/TerritoryIsrael
CityEin Gedi
Period11/06/1513/06/15
Internet address

Fingerprint

Dive into the research topics of 'Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements'. Together they form a unique fingerprint.

Cite this