{"id":{"repo_id":"toronto-retro","oai_identifier":"oai:utoronto.scholaris.ca:1807/123532"},"canonical_url":"https://search.dev.ndltd.org/etd/toronto-retro/oai:utoronto.scholaris.ca:1807/123532","repository":{"repo_id":"toronto-retro","name":"University of Toronto","base_url":"https://utoronto.scholaris.ca/server/oai/request"},"display":{"title":"Generalization in Planning","abstract":"The ability to generalize from past experiences in order to address new situations is one of the cornerstones of human intelligence. As such, the design of artificial intelligence systems must---at some point---consider the issues involved in generalization. In automated planning, where the objectives are to design systems that are capable of finding courses of action to achieve specific goals given a formal description of their environment, we can say that a system exhibits generalization capabilities if it can leverage its previous solution-finding efforts when addressing new problems. The pervasive use of automation in modern industries signifies that this type of generalization---generalization in planning---is a fundamental requirement for the integration of artificial intelligence techniques into real-world applications. This dissertation aims to provide a generic high-level approach that can be used when confronted with sequential decision-making problems where generalization is important. Overall, the approach works by reformulating the problems into abstract representations, finding solutions for these abstract problems, and attempting to directly use the resulting abstract solutions in the concrete problems. This satisfies the generalization requirements when multiple concrete problems can be represented in one single abstract problem, or when the insights gathered when solving one abstract problem can be transferred towards solving related problems. We instantiate this approach in three different classes of planning problems. First, we address planning problems that have propositional and numeric state variables, including problems with nonlinear numeric constraints. We then address a type of generalized planning where a family of multiple planning problems is described through the use of first-order logic quantification, obtaining a single policy that can be applied on any of the problems. Finally, we show how we can solve reinforcement learning problems where multiple different tasks must be solved in a single environment. As with all reinforcement learning problems, the exact domain dynamics are initially unknown, and solutions must be obtained by repeatedly interacting with the environment. We prove the soundness of all our approaches and present empirical results that demonstrate their efficacy across various different domains. In many cases, we see orders of magnitude improvements in overall time efficiency.","abstract_html":"The ability to generalize from past experiences in order to address new situations is one of the cornerstones of human intelligence. As such, the design of artificial intelligence systems must---at some point---consider the issues involved in generalization. In automated planning, where the objectives are to design systems that are capable of finding courses of action to achieve specific goals given a formal description of their environment, we can say that a system exhibits generalization capabilities if it can leverage its previous solution-finding efforts when addressing new problems. The pervasive use of automation in modern industries signifies that this type of generalization---generalization in planning---is a fundamental requirement for the integration of artificial intelligence techniques into real-world applications. This dissertation aims to provide a generic high-level approach that can be used when confronted with sequential decision-making problems where generalization is important. Overall, the approach works by reformulating the problems into abstract representations, finding solutions for these abstract problems, and attempting to directly use the resulting abstract solutions in the concrete problems. This satisfies the generalization requirements when multiple concrete problems can be represented in one single abstract problem, or when the insights gathered when solving one abstract problem can be transferred towards solving related problems. We instantiate this approach in three different classes of planning problems. First, we address planning problems that have propositional and numeric state variables, including problems with nonlinear numeric constraints. We then address a type of generalized planning where a family of multiple planning problems is described through the use of first-order logic quantification, obtaining a single policy that can be applied on any of the problems. Finally, we show how we can solve reinforcement learning problems where multiple different tasks must be solved in a single environment. As with all reinforcement learning problems, the exact domain dynamics are initially unknown, and solutions must be obtained by repeatedly interacting with the environment. We prove the soundness of all our approaches and present empirical results that demonstrate their efficacy across various different domains. In many cases, we see orders of magnitude improvements in overall time efficiency.","abstract_has_math":false,"creators":["Illanes, León"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computer Science","school":null,"contributors":[],"advisors":["McIlraith, Sheila Ann"],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-06","date_published":"2022-06","updated_at":"2026-07-27T21:28:18Z","subjects":["Abstraction","Automated Planning","Generalized Planning","Hierarchical Reinforcement Learning","Numeric Planning","Reinforcement Learning"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1807/123532","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["McIlraith, Sheila Ann"]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science"]},{"key":"dc:creator","label":"Author","values":["Illanes, León"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-06"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-06-29T16:33:50Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-06-29T16:33:50Z"]},{"key":"dc:date.issued","label":"Date","values":["2022-06"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Abstraction","Automated Planning","Generalized Planning","Hierarchical Reinforcement Learning","Numeric Planning","Reinforcement Learning"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1807/123532"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The ability to generalize from past experiences in order to address new situations is one of the cornerstones of human intelligence. As such, the design of artificial intelligence systems must---at some point---consider the issues involved in generalization. In automated planning, where the objectives are to design systems that are capable of finding courses of action to achieve specific goals given a formal description of their environment, we can say that a system exhibits generalization capabilities if it can leverage its previous solution-finding efforts when addressing new problems. The pervasive use of automation in modern industries signifies that this type of generalization---generalization in planning---is a fundamental requirement for the integration of artificial intelligence techniques into real-world applications. This dissertation aims to provide a generic high-level approach that can be used when confronted with sequential decision-making problems where generalization is important. Overall, the approach works by reformulating the problems into abstract representations, finding solutions for these abstract problems, and attempting to directly use the resulting abstract solutions in the concrete problems. This satisfies the generalization requirements when multiple concrete problems can be represented in one single abstract problem, or when the insights gathered when solving one abstract problem can be transferred towards solving related problems. We instantiate this approach in three different classes of planning problems. First, we address planning problems that have propositional and numeric state variables, including problems with nonlinear numeric constraints. We then address a type of generalized planning where a family of multiple planning problems is described through the use of first-order logic quantification, obtaining a single policy that can be applied on any of the problems. Finally, we show how we can solve reinforcement learning problems where multiple different tasks must be solved in a single environment. As with all reinforcement learning problems, the exact domain dynamics are initially unknown, and solutions must be obtained by repeatedly interacting with the environment. We prove the soundness of all our approaches and present empirical results that demonstrate their efficacy across various different domains. In many cases, we see orders of magnitude improvements in overall time efficiency."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph.D."]},{"key":"dc:title","label":"Title","values":["Generalization in Planning"]}]}],"canonical_facts":{"dc:contributor.advisor":["McIlraith, Sheila Ann"],"dc:contributor.department":["Computer Science"],"dc:creator":["Illanes, León"],"dc:date":["2022-06"],"dc:date.accessioned":["2022-06-29T16:33:50Z"],"dc:date.available":["2022-06-29T16:33:50Z"],"dc:date.issued":["2022-06"],"dc:description.abstract":["The ability to generalize from past experiences in order to address new situations is one of the cornerstones of human intelligence. As such, the design of artificial intelligence systems must---at some point---consider the issues involved in generalization. In automated planning, where the objectives are to design systems that are capable of finding courses of action to achieve specific goals given a formal description of their environment, we can say that a system exhibits generalization capabilities if it can leverage its previous solution-finding efforts when addressing new problems. The pervasive use of automation in modern industries signifies that this type of generalization---generalization in planning---is a fundamental requirement for the integration of artificial intelligence techniques into real-world applications. This dissertation aims to provide a generic high-level approach that can be used when confronted with sequential decision-making problems where generalization is important. Overall, the approach works by reformulating the problems into abstract representations, finding solutions for these abstract problems, and attempting to directly use the resulting abstract solutions in the concrete problems. This satisfies the generalization requirements when multiple concrete problems can be represented in one single abstract problem, or when the insights gathered when solving one abstract problem can be transferred towards solving related problems. We instantiate this approach in three different classes of planning problems. First, we address planning problems that have propositional and numeric state variables, including problems with nonlinear numeric constraints. We then address a type of generalized planning where a family of multiple planning problems is described through the use of first-order logic quantification, obtaining a single policy that can be applied on any of the problems. Finally, we show how we can solve reinforcement learning problems where multiple different tasks must be solved in a single environment. As with all reinforcement learning problems, the exact domain dynamics are initially unknown, and solutions must be obtained by repeatedly interacting with the environment. We prove the soundness of all our approaches and present empirical results that demonstrate their efficacy across various different domains. In many cases, we see orders of magnitude improvements in overall time efficiency."],"dc:description.degree":["Ph.D."],"dc:identifier.uri":["http://hdl.handle.net/1807/123532"],"dc:subject":["Abstraction","Automated Planning","Generalized Planning","Hierarchical Reinforcement Learning","Numeric Planning","Reinforcement Learning"],"dc:title":["Generalization in Planning"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T21:28:18Z"}