Concise Finite-Domain Representations for Factored MA-PDDL Planning Tasks.
Daniel FiserAntonín KomendaPublished in: ICAART (2) (2018)
Keyphrases
- planning tasks
- finite domain
- constraint satisfaction problems
- constraint programming
- constraint propagation
- state space
- constraint logic programming
- satisfiability problem
- state variables
- constraint solving
- constraint solver
- bounded treewidth
- planning problems
- planning systems
- answer set programming
- constraint satisfaction
- straight forward
- integer programming
- search algorithm
- np complete
- belief space
- planning process
- multi valued