On state-dominance criteria in fork-decoupled search

Alvaro Torralba, Daniel Gnad, Patrick Dubbert, Jorg Hoffmann

Research output: Contribution to journalConference article in JournalResearchpeer-review

4 Citations (Scopus)

Abstract

Fork-decoupled search is a recent approach to classical planning that exploits fork structures, where a single center component provides preconditions for several leaf components. The decoupled states in this search consist of a center state, along with a price for every leaf state. Given this, when does one decoupled state dominate another? Such statedominance criteria can be used to prune dominated search states. Prior work has devised only a trivial criterion. We devise several more powerful criteria, show that they preserve optimality, and establish their interrelations. We show that they can yield exponential reductions. Experiments on IPC benchmarks attest to the possible practical benefits.

Original languageEnglish
JournalIJCAI International Joint Conference on Artificial Intelligence
Volume2016-January
Pages (from-to)3265-3271
Number of pages7
ISSN1045-0823
Publication statusPublished - 2016
Externally publishedYes
Event25th International Joint Conference on Artificial Intelligence, IJCAI 2016 - New York, United States
Duration: 9 Jul 201615 Jul 2016

Conference

Conference25th International Joint Conference on Artificial Intelligence, IJCAI 2016
Country/TerritoryUnited States
CityNew York
Period09/07/201615/07/2016
SponsorAI Journal, Arizona State University, Baidu, et al., IBM Watson, Sony Group Corporation

Keywords

  • Planning and scheduling
  • Artificial Intelligence (AI)

Fingerprint

Dive into the research topics of 'On state-dominance criteria in fork-decoupled search'. Together they form a unique fingerprint.

Cite this