Utilizing Automatically Inferred Invariants in Graph Construction and Search

@inproceedings{Fox2000UtilizingAI,
  title={Utilizing Automatically Inferred Invariants in Graph Construction and Search},
  author={Maria Fox and Derek Long},
  booktitle={AIPS},
  year={2000}
}
In this paper we explore the relative importance of persistent mid non-persistent mutex relations in the perfornmnce of Graphpl~m-based planners. We also show tlm advantages of pre-compiling persistent mutex reindons. ITsing TIM we are able to generate, during a prepr.cessing analysis, all of the persistent Ifinary nmtex relations that would be infi,rred by Graphplan during graph construction. We show how the efficient storage of: mtd access to, these pre-processed persistent xnutexes yiehts a… CONTINUE READING