Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem
Authors:
- 13 January 2021
- book chapter
- Published by Springer Nature
- p. 277-290
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Survey on Coverage Path Planning with Unmanned Aerial VehiclesDrones, 2019
- A decentralized multi-agent unmanned aerial system to search, pick up, and relocate objects2017
- On minimizing turns in robot coverage path planning2016
- Coverage Path Planning with Real-time Replanning and Surface Reconstruction for Inspection of Three-dimensional Underwater Structures using Autonomous Underwater VehiclesJournal of Field Robotics, 2014
- A survey on coverage path planning for roboticsRobotics and Autonomous Systems, 2013
- A memetic algorithm for the generalized traveling salesman problemNatural Computing, 2009
- Spanning-tree based coverage of continuous areas by a mobile robotAnnals of Mathematics and Artificial Intelligence, 2001
- Coverage Path Planning: The Boustrophedon Cellular Decomposition1998
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman ProblemOperations Research, 1997
- Computational Geometry1997