Underestimation vs. overestimation in SAT-based planning

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Planning as satisfiability is one of the main approaches to finding parallel optimal solution plans for classical planning problems. Existing high performance SAT-based planners are able to exploit either forward or backward search strategy; starting from an underestimation or overestimation of the optimal plan length, they keep increasing or decreasing the estimated plan length and, for each fixed length, they either find a solution or prove the unsatisfiability of the corresponding SAT instance. In this paper we will discuss advantages and disadvantages of the underestimating and overestimating techniques, and we will propose an effective online decision system for selecting the most appropriate technique for solving a given planning problem. Finally, we will experimentally show that the exploitation of such a decision system improves the performance of the well known SAT-based planner SatPlan.

Original languageEnglish
Title of host publicationAI*IA 2013: Advances in Artificial Intelligence - XIIIth International Conference of the Italian Association for Artificial Intelligence, Proceedings
Pages276-287
Number of pages12
Volume8249 LNAI
DOIs
Publication statusPublished - 2013
Event13th International Conference of the Italian Association for Artificial Intelligence - Turin, Italy
Duration: 4 Dec 20136 Dec 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8249 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference13th International Conference of the Italian Association for Artificial Intelligence
Abbreviated titleAI*IA 2013
CountryItaly
CityTurin
Period4/12/136/12/13

Fingerprint Dive into the research topics of 'Underestimation vs. overestimation in SAT-based planning'. Together they form a unique fingerprint.

Cite this