Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning.
Dieqiao FengCarla P. GomesBart SelmanPublished in: IJCAI (2020)
Keyphrases
- ai planning
- solving hard
- search problems
- heuristic search
- reinforcement learning
- combinatorial problems
- stochastic local search
- satisfiability problem
- state space
- propositional satisfiability
- planning problems
- propositional logic
- integer programming
- web service composition
- constraint programming
- sat problem
- orders of magnitude
- constraint satisfaction
- planning domains
- search algorithm
- service composition
- phase transition
- sat instances
- markov decision processes
- sat solvers
- metaheuristic
- combinatorial optimization
- search strategies
- plan existence
- industrial applications
- temporal logic
- np complete
- action models
- branch and bound algorithm
- belief revision
- randomly generated
- petri net
- computational properties
- optimal policy
- linear programming
- learning algorithm