Learning for Classical Planning

This thesis is mainly about classical planning for artificial intelligence (AI). In planning, we deal with searching for a sequence of actions that changes the environment from a given initial state to a goal state. Planning problems in general are ones of the hardest problems not only in the area o...

Full description

Bibliographic Details
Main Author: Chrpa, Lukáš
Other Authors: Barták, Roman
Format: Doctoral Thesis
Language:English
Published: 2009
Online Access:http://www.nusl.cz/ntk/nusl-280546
id ndltd-nusl.cz-oai-invenio.nusl.cz-280546
record_format oai_dc
spelling ndltd-nusl.cz-oai-invenio.nusl.cz-2805462018-12-10T04:16:14Z Learning for Classical Planning Learning for Classical Planning Chrpa, Lukáš Barták, Roman Železný, Filip Berka, Petr This thesis is mainly about classical planning for artificial intelligence (AI). In planning, we deal with searching for a sequence of actions that changes the environment from a given initial state to a goal state. Planning problems in general are ones of the hardest problems not only in the area of AI, but in the whole computer science. Even though classical planning problems do not consider many aspects from the real world, their complexity reaches EXPSPACE-completeness. Nevertheless, there exist many planning systems (not only for classical planning) that were developed in the past, mainly thanks to the International Planning Competitions (IPC). Despite the current planning systems are very advanced, we have to boost these systems with additional knowledge provided by learning. In this thesis, we focused on developing learning techniques which produce additional knowledge from the training plans and transform it back into planning do mains and problems. We do not have to modify the planners. The contribution of this thesis is included in three areas. First, we provided theoretical background for plan analysis by investigating action dependencies or independencies. Second, we provided a method for generating macro-operators and removing unnecessary primitive operators. Experimental evaluation of this... 2009 info:eu-repo/semantics/doctoralThesis http://www.nusl.cz/ntk/nusl-280546 eng info:eu-repo/semantics/restrictedAccess
collection NDLTD
language English
format Doctoral Thesis
sources NDLTD
description This thesis is mainly about classical planning for artificial intelligence (AI). In planning, we deal with searching for a sequence of actions that changes the environment from a given initial state to a goal state. Planning problems in general are ones of the hardest problems not only in the area of AI, but in the whole computer science. Even though classical planning problems do not consider many aspects from the real world, their complexity reaches EXPSPACE-completeness. Nevertheless, there exist many planning systems (not only for classical planning) that were developed in the past, mainly thanks to the International Planning Competitions (IPC). Despite the current planning systems are very advanced, we have to boost these systems with additional knowledge provided by learning. In this thesis, we focused on developing learning techniques which produce additional knowledge from the training plans and transform it back into planning do mains and problems. We do not have to modify the planners. The contribution of this thesis is included in three areas. First, we provided theoretical background for plan analysis by investigating action dependencies or independencies. Second, we provided a method for generating macro-operators and removing unnecessary primitive operators. Experimental evaluation of this...
author2 Barták, Roman
author_facet Barták, Roman
Chrpa, Lukáš
author Chrpa, Lukáš
spellingShingle Chrpa, Lukáš
Learning for Classical Planning
author_sort Chrpa, Lukáš
title Learning for Classical Planning
title_short Learning for Classical Planning
title_full Learning for Classical Planning
title_fullStr Learning for Classical Planning
title_full_unstemmed Learning for Classical Planning
title_sort learning for classical planning
publishDate 2009
url http://www.nusl.cz/ntk/nusl-280546
work_keys_str_mv AT chrpalukas learningforclassicalplanning
_version_ 1718799962688454656