Attributes | Values |
---|
rdf:type
| |
Description
| - Navzdory běžné aplikace CSP technik pro řešení rozvrhovacích problémů se tyto techniky používají pouze zřídka v oblasti automatického plánování. Přestože existuje několik pokusů o aplikaci techniky splňování podmínek pro řešení plánovacích problémů, tyto techniky se nikdy nestaly dominantní pro tuto oblast, a nikdy nedosáhly úspěchů jako například plánovače založené na SAT. V této publikaci prezentujeme názor, že existující modely CSP pro plánovací problémy nevyužívají naplno možnosti technik splňování podmínek. Proto uvádíme návrh reformulace modelů, která výrazně zlepšuje jejich efektivitu (cs)
- Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint satisfaction for solving AI planning problems, these techniques never became predominant in planning; and they never reached the success of, for example, SAT-based planners. In this paper we argue that existing constraint models for classical AI planning are not fully using the power of constraint satisfaction; thus we propose a reformulation, which significantly improves their efficiency
- Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint satisfaction for solving AI planning problems, these techniques never became predominant in planning; and they never reached the success of, for example, SAT-based planners. In this paper we argue that existing constraint models for classical AI planning are not fully using the power of constraint satisfaction; thus we propose a reformulation, which significantly improves their efficiency (en)
|
Title
| - Reformulating Constraint Models for Classical Planning
- Reformulace CSP modelů pro klasické plánování (cs)
- Reformulating Constraint Models for Classical Planning (en)
|
skos:prefLabel
| - Reformulating Constraint Models for Classical Planning
- Reformulace CSP modelů pro klasické plánování (cs)
- Reformulating Constraint Models for Classical Planning (en)
|
skos:notation
| - RIV/00216208:11650/08:00106602!RIV09-MSM-11650___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - N, P(1M0545), P(GA201/07/0205), Z(MSM0021620838)
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11650/08:00106602
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - planning; constraint satisfaction; constraint models (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| - Coconut Grove, Florida, USA
|
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Barták, Roman
- Toropila, Daniel
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |