Maria Fox and Derek Long
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 preprocessing analysis, all of the persistent binary mutex relations that would be inferred by Graphplan during graph construction. We show how the efficient storage 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.