Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability.
Pavel SurynekPublished in: CoRR (2016)
Keyphrases
- path finding
- propositional satisfiability
- solving hard
- optimal path
- optimal solution
- path planning
- sat solvers
- constraint programming
- propositional logic
- sat instances
- heuristic search
- stochastic local search
- variable ordering
- search algorithm
- automated reasoning
- bayesian networks
- dynamic programming
- lower bound
- industrial applications
- combinatorial problems
- scheduling problem
- combinatorial optimization
- constraint satisfaction
- first order logic