Coverage planning with finite resources

Abstract

The robot coverage problem, a common planning problem, consists of finding a motion path for the robot that passes over all points in a given area or space. In many robotic applications involving coverage, e.g., industrial cleaning, mine sweeping, and agricultural operations, the desired coverage area is large and of arbitrary layout. In this work, we… (More)
DOI: 10.1109/IROS.2014.6942969

Topics

10 Figures and Tables

Slides referencing similar topics