Validation of Hierarchical Plans via Parsing of Attribute Grammars

An important problem of automated planning is validating if a plan complies with the planning domain model. Such validation is straightforward for classical sequential planning but until recently there was no such validation approach for Hierarchical Task Networks (HTN) planning. In this paper we propose a novel technique for validating HTN plans that is based on representing the HTN model as an attribute grammar and using a special parsing algorithm to verify if the plan can be generated by the grammar.

[1]  James A. Hendler,et al.  Complexity results for HTN planning , 1994, Annals of Mathematics and Artificial Intelligence.

[2]  Donald E. Knuth,et al.  Semantics of context-free languages , 1968, Mathematical systems theory.

[3]  Derek Long,et al.  VAL's progress: the automatic validation tool for PDDL2.1 used in the International planning competition , 2003 .

[4]  Dana S. Nau,et al.  SHOP2: An HTN Planning System , 2003, J. Artif. Intell. Res..

[5]  Susanne Biundo-Stephan,et al.  Language Classification of Hierarchical Planning Problems , 2014, ECAI.

[6]  Roman Barták,et al.  Attribute grammars with set attributes and global constraints as a unifying framework for planning domain models , 2017, PPDP.

[7]  Giorgio Satta,et al.  Partially ordered multiset context-free grammars and ID/LP parsing , 2003 .

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  Christopher Geib,et al.  Lexicalized Reasoning about Actions , 2016 .

[11]  John Maraist,et al.  String Shuffling over a Gap between Parsing and Plan Recognition , 2017, AAAI Workshops.

[12]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[13]  Jorge A. Baier,et al.  Exploiting Procedural Domain Control Knowledge in State-ofthe-Art Planners ( extended version ) , 2008 .

[14]  Susanne Biundo-Stephan,et al.  This Is a Solution! (... But Is It Though?) - Verifying Solutions of Hierarchical Planning Problems , 2017, ICAPS.

[15]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .