Kompilácia plánovacích problémo

Kompilácia plánovacích problémo

Constraint satisfaction techniques are used frequently for solving scheduling problems, but they are still seldom in AI planning. There exist several attempts to apply constraint satisfaction for solving AI planning problems, however, these techniques never became prevailing in planning and did not...

Full description

Bibliographic Details
Main Author: Toropila, Daniel
Other Authors: Chrpa, Lukáš
Format: Dissertation
Language:English
Published: 2008
Online Access:http://www.nusl.cz/ntk/nusl-287606
id ndltd-nusl.cz-oai-invenio.nusl.cz-287606
record_format oai_dc
spelling ndltd-nusl.cz-oai-invenio.nusl.cz-2876062017-06-27T04:41:21Z Kompilácia plánovacích problémo Compiling Planning Problems Chrpa, Lukáš Toropila, Daniel Barták, Roman Constraint satisfaction techniques are used frequently for solving scheduling problems, but they are still seldom in AI planning. There exist several attempts to apply constraint satisfaction for solving AI planning problems, however, these techniques never became prevailing in planning and did not reach the success of, for example, SATbased planners. In this work we argue that the existing constraint models for classical AI planning are indeed not exploiting fully the power of constraint satisfaction and we propose their reformulation which significantly improves efficiency. 2008 info:eu-repo/semantics/masterThesis http://www.nusl.cz/ntk/nusl-287606 eng info:eu-repo/semantics/restrictedAccess
collection NDLTD
language English
format Dissertation
sources NDLTD
description Constraint satisfaction techniques are used frequently for solving scheduling problems, but they are still seldom in AI planning. There exist several attempts to apply constraint satisfaction for solving AI planning problems, however, these techniques never became prevailing in planning and did not reach the success of, for example, SATbased planners. In this work we argue that the existing constraint models for classical AI planning are indeed not exploiting fully the power of constraint satisfaction and we propose their reformulation which significantly improves efficiency.
author2 Chrpa, Lukáš
author_facet Chrpa, Lukáš
Toropila, Daniel
author Toropila, Daniel
spellingShingle Toropila, Daniel
Kompilácia plánovacích problémo
author_sort Toropila, Daniel
title Kompilácia plánovacích problémo
title_short Kompilácia plánovacích problémo
title_full Kompilácia plánovacích problémo
title_fullStr Kompilácia plánovacích problémo
title_full_unstemmed Kompilácia plánovacích problémo
title_sort kompilácia plánovacích problémo
publishDate 2008
url http://www.nusl.cz/ntk/nusl-287606
work_keys_str_mv AT toropiladaniel kompilaciaplanovacichproblemo
AT toropiladaniel compilingplanningproblems
_version_ 1718469472266747904

Similar Items