Abstract
Generalized planning problems capture planning problems with uncertainties in object quantities and properties. While the generalized planning problem is incomputable in general, this thesis presents a new formalization of the problem, a study of the limits of computability of generalized plans and algorithms for solving a broad class of generalized planning problems.
Get full access to this article
View all access options for this article.