Semi-Boustrophedon Coverage with a Dubins Vehicle
Jeremy Lewis, William Edwards, Kelly Benson, Ioannis Rekleitis, Jason O'Kane
In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2017.
Abstract
This paper addresses the problem of generating coverage paths---that is, paths that pass within some sensor footprint of every point in an environment---for vehicles with Dubins motion constraints. We extend previous work that solves this coverage problem as a traveling salesman problem (TSP) by introducing a practical heuristic algorithm to reduce runtime while maintaining near-optimal path length. Furthermore, we show that generating an optimal coverage path is NP-hard by reducing from the Exact Cover problem, which provides justification for our algorithm's conversion of Dubins coverage instances to TSP instances. Extensive experiments demonstrate that the algorithm does indeed produce length paths comparable to optimal in significantly less time.
Download
Video
BibTeX
@inproceedings{LewisIROS2017,
author = {Jeremy Lewis and William Edwards and Kelly Benson and
Ioannis Rekleitis and Jason O'Kane},
title = {Semi-Boustrophedon Coverage with a Dubins Vehicle},
booktitle = {IEEE/RSJ International Conference on Intelligent Robots
and Systems (IROS)},
year = {2017},
pages = {5630 - 5637},
month = {Sep.},
address = {Vancouver, BC, Canada}
}
Thu Apr 18 06:21:02 EDT 2024