Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

Christer Bäckström Peter Jonsson Sebastian Ordyniak Stefan Szeider

Published in: CIAC (2013)

Keyphrases

multi agent
planning problems
parameterized complexity
domain independent
heuristic search
state space
planning domains
lower bound
upper bound
fixed parameter tractable
planning systems
solving planning problems
global constraints
worst case
np complete
symmetry breaking
deterministic domains