Validation and Recognition of Hierarchical Plans

Planning is a method where we try to fulfil a certain goal or goal task by finding a sequence of actions called plan. Hierarchical Task Networks is a method of planning that decomposes tasks to subtasks until we get primitive tasks (tasks that cannot be further decomposed or actions). Plan validation takes these actions and verifies whether the goal task actually decomposes to them. Plan recognition takes prefix of these actions, finds the missing ones and verifies whether the goal task can decompose into them. In this thesis I will be creating two programs: one program that solves the plan validation and one that solves the plan recognition problem using a parsing method known in grammars