The Hardness of Minimizing Design Cost Subject to Planning Problems.

Fatemeh Zahra Saberifar Jason M. O'Kane Dylan A. Shell

Published in: WAFR (2018)

Keyphrases

planning problems
domain independent
state space
np hard
general purpose
np complete
heuristic search
computational complexity
dynamic programming
planning systems
probabilistic planning
partial observability