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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | English |
| Published: |
2008
|
| Online Access: | http://www.nusl.cz/ntk/nusl-287606 |
| Summary: | 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. |
|---|