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