Recognizing Plans with Loops Represented in a Lexicalized Grammar


  • Christopher Geib University of Edinburgh
  • Robert Goldman SIFT, LLC


This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to parse lexicalized grammars, and demonstrate its effectiveness empirically. To do this, the paper first shows how encoding plan libraries as context free grammars permits the application of standard rewriting techniques to remove left recursion and ε-productions, thereby enabling polynomial time parsing. However, these techniques alone fail to provide efficient algorithms for plan recognition. We show how the loop-handling methods from formal grammars can be extended to the more general plan recognition problem and provide a method for encoding loops in an existing plan recognition system that scales linearly in the number of loop iterations.




How to Cite

Geib, C., & Goldman, R. (2011). Recognizing Plans with Loops Represented in a Lexicalized Grammar. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 958-963. Retrieved from



Reasoning about Plans, Processes and Actions