Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning.
Dieqiao FengCarla P. GomesBart SelmanPublished in: CoRR (2020)
Keyphrases
- solving hard
- ai planning
- search problems
- heuristic search
- reinforcement learning
- combinatorial problems
- satisfiability problem
- stochastic local search
- state space
- planning problems
- propositional logic
- propositional satisfiability
- integer programming
- constraint programming
- service composition
- sat problem
- phase transition
- constraint satisfaction
- search algorithm
- combinatorial optimization
- constraint satisfaction problems
- planning domains
- machine learning
- web service composition
- metaheuristic
- optimal policy
- global constraints
- search space
- markov decision processes
- dynamic programming
- traveling salesman problem
- sat instances
- np complete
- sat solvers
- temporal logic
- action models
- plan existence
- max sat
- randomly generated
- domain independent
- orders of magnitude
- optimization problems
- np hard
- learning algorithm