Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem.
Rik BähnemannNicholas R. J. LawranceJen Jen ChungMichael PanticRoland SiegwartJuan I. NietoPublished in: FSR (2019)
Keyphrases
- path planning
- traveling salesman problem
- complete coverage
- cd rom
- mobile robot
- combinatorial optimization
- path planning algorithm
- collision avoidance
- ant colony optimization
- dynamic environments
- advanced database
- multi robot
- obstacle avoidance
- optimization problems
- hamiltonian cycle
- traveling salesman
- dynamic and uncertain environments
- genetic local search
- robot path planning
- path planner
- valid inequalities
- degrees of freedom
- collision free
- unmanned aerial vehicles
- motion planning
- autonomous vehicles
- optimal path
- potential field
- multiple robots
- aerial vehicles
- optimal solution
- search algorithm