Login / Signup
On Computational Complexity of Automorphism Groups in Classical Planning.
Alexander Shleyfman
Published in:
ICAPS (2019)
Keyphrases
</>
classical planning
computational complexity
planning problems
domain independent
heuristic search
larger problems
planning domains
special case
decision problems
ai planning
initial state
dynamic programming
probabilistic planning
orders of magnitude
simulated annealing
np hard
temporal planning