A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Planning and Rescheduling
This thesis presents results in two areas. The first area is automated planning. Approaches to the domain-independent automated planning can be divided into two groups: STRIPS-like planning (based on operators) and HTN-like planning (based on hierarchical decomposition). It is widely believed, that the expressivity of STRIPS-like planning is lower than the expressivity of HTN-like planning. This would mean that HTN-like planning can solve more problems than STRIPS-like planning. In this thesisfatcat:txeqmstfajazpkm2zqwf73u5qu