A language for robot path planning in discrete environments: The TSP with Boolean satisfiability constraints.
Frank ImesonStephen L. SmithPublished in: ICRA (2014)
Keyphrases
- robot path planning
- boolean satisfiability
- combinatorial problems
- symmetry breaking
- traveling salesman problem
- sat solvers
- integer linear programming
- constraint programming
- path planning
- randomly generated
- constraint satisfaction
- probabilistic planning
- finite number
- global constraints
- optimal solution
- sat problem
- optimization problems
- combinatorial optimization
- motion planning
- branch and bound algorithm
- dynamic environments
- mixed integer
- ant colony optimization
- np hard
- search algorithm