Abstract
Hierarchical planning extends classical planning by capturing the hierarchical structure of tasks via decomposition of tasks to subtasks. Hierarchical plan verification is the problem of determining whether a given plan is valid according to that structure. As decomposition trees in totally ordered hierarchical planning domains resemble parsing trees of context-free grammars, one may exploit the techniques for context-free grammars also for hierarchical plans. In this paper, we study how the Earley parser, proposed for checking whether a given word belongs to a language defined by context-free grammar, can be extended to verification of totally ordered hierarchical plans.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.