Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Christer BäckströmPeter JonssonSebastian OrdyniakStefan SzeiderPublished in: CoRR (2012)
Keyphrases
- planning problems
- parameterized complexity
- heuristic search
- domain independent
- state space
- upper bound
- fixed parameter tractable
- lower bound
- global constraints
- planning domains
- planning systems
- worst case
- deterministic domains
- computational problems
- symmetry breaking
- solving planning problems
- binary decision diagrams
- approximation algorithms
- model checking
- first order logic
- linear programming