Concise finite-domain representations for PDDL planning tasks (Q835819)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5600146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concise finite-domain representations for PDDL planning tasks |
scientific article; zbMATH DE number 5600146 |
Statements
Concise finite-domain representations for PDDL planning tasks (English)
0 references
31 August 2009
0 references
automated planning
0 references
problem reformulation
0 references
PDDL
0 references
SAS\(^{+}\)
0 references
0 references
0.7540622353553772
0 references
0.7374844551086426
0 references
0.7286639213562012
0 references
