Parametrized Families of Hard Planning Problems from Phase Transitions.
Eleanor Gilbert RieffelDavide VenturelliMinh DoItay HenJeremy FrankPublished in: AAAI (2014)
Keyphrases
- planning problems
- phase transition
- random constraint satisfaction problems
- random instances
- hard problems
- heuristic search
- domain independent
- constraint satisfaction
- random sat
- state space
- np complete
- ai planning
- satisfiability problem
- randomly generated
- graph coloring
- planning systems
- pattern databases
- classical planning
- planning domains
- combinatorial problems
- search problems
- partial observability
- stochastic domains
- np complete problems
- sat problem
- htn planning
- causal graph
- cellular automata
- probabilistic planning
- constraint satisfaction problems
- solving planning problems
- domain specific