|
|
Comparison of Classical Planning Methods
Černianska, Rebeka ; Zbořil, František (referee) ; Zbořil, František (advisor)
This bachelor's thesis deals with the topic of automated planning and the methods which deal with its problems. The analysis and comparison of the methods STRIPS, Graphplan and HTN takes place, which implement different approaches to planning. Their performance is tested on typical planning problems, which focus on various planning challenges. The goal was to find suitable planning problems for each of the methods, as well as their strong and weak points regarding the given problem. For testing purposes, existing implementations of the methods were used, which showcase their behaviour.
|
|
|
Comparison of Classical Planning Methods
Černianska, Rebeka ; Zbořil, František (referee) ; Zbořil, František (advisor)
This bachelor's thesis deals with the topic of automated planning and the methods which deal with its problems. The analysis and comparison of the methods STRIPS, Graphplan and HTN takes place, which implement different approaches to planning. Their performance is tested on typical planning problems, which focus on various planning challenges. The goal was to find suitable planning problems for each of the methods, as well as their strong and weak points regarding the given problem. For testing purposes, existing implementations of the methods were used, which showcase their behaviour.
|
|
|
Validation and Recognition of Hierarchical Plans
Ondrčková, Simona ; Barták, Roman (advisor) ; Gemrot, Jakub (referee)
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.
|
guest ::
