Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT.
Pavel SurynekPublished in: SOCS (2021)
Keyphrases
- path finding
- multi agent
- sat solvers
- search algorithm
- sat solving
- path planning
- robocup rescue
- sat instances
- modulo theories
- sat encodings
- propositional satisfiability
- heuristic search
- optimal path
- reinforcement learning
- backtracking search
- neural network
- constraint satisfaction
- satisfiability problem
- complexity analysis
- sat problem
- orders of magnitude
- tree search
- state space
- artificial neural networks
- boolean satisfiability
- computational complexity
- data mining