An Algorithm for Domain Axiom Plan Recognition based on Extended Goal Graph

This paper introduces a novel algorithm for domain axiom plan recognition. Using a method of domain axiom inference expansion, the algorithm can reconstruct goal graph to extend and improve original algorithm to allow plan recognition with domain axiom. The algorithm based on goal graph needs no plan library, so it can’t be suffered from the problems in the acquisition and hand-coding of large plan libraries. It also has no problem in searching the plan space of exponential size.