Utilizing automatically inferred invariants in graph construction and search

Maria Fox, Derek Long

Research output: Contribution to conferencePaper

9 Downloads (Pure)

Abstract

In this paper we explore the relative importance of persistent and non-persistent mutex relations in the performance of Graphplan- based planners. We also show the advantages of pre-compiling persistent mutex relations. Using TIM we are able to generate, during a pre-processing analysis, all of the persistent binary mutex relations that would be inferred by Graphplan during each graph construction. We show how the efficient storgae of, and access to, these pre-processed persistent mutexes yields a modest improvement in graph construction performance. We further demonstrate that the process by which these persistent mutexes are identified can, in certain kinds of domain, allow the exploitation of binary mutex relations which are inaccessible to Graphplan. We present The Island of Sodor, a simple planning domain characterizing a class of domains in which certain persistent mutexes are present but are not detectable by Graphplan during graph construction. We show that the exploitation of these hidden binary mutexes makes problems in this kind of domain trivially solvable by STAN, where they are intractable for other Graphplan-based planners.
Original languageEnglish
Pages102-111
Number of pages9
Publication statusPublished - Apr 2000
Event5th International Conference on Artificial Intelligence Planning Systems - Breckenridge, CO, United States
Duration: 14 Apr 200017 Apr 2000

Conference

Conference5th International Conference on Artificial Intelligence Planning Systems
Abbreviated titleAIPS 2000
CountryUnited States
CityBreckenridge, CO
Period14/04/0017/04/00

Keywords

  • graph construction
  • mutex relations
  • graphplan
  • STAN

Fingerprint Dive into the research topics of 'Utilizing automatically inferred invariants in graph construction and search'. Together they form a unique fingerprint.

Cite this