A survey on coverage path planning for robotics
dc.contributor.author
dc.date.accessioned
2014-05-07T08:15:34Z
dc.date.available
2014-05-07T08:15:34Z
dc.date.issued
2013-12
dc.identifier.issn
0921-8890
dc.identifier.uri
dc.description.abstract
Coverage Path Planning (CPP) is the task of determining a path that passes over all points of an area or volume of interest while avoiding obstacles. This task is integral to many robotic applications, such as vacuum cleaning robots, painter robots, autonomous underwater vehicles creating image mosaics, demining robots, lawn mowers, automated harvesters, window cleaners and inspection of complex structures, just to name a few. A considerable body of research has addressed the CPP problem. However, no updated surveys on CPP reflecting recent advances in the field have been presented in the past ten years. In this paper, we present a review of the most successful CPP methods, focusing on the achievements made in the past decade. Furthermore, we discuss reported field applications of the described CPP methods. This work aims to become a starting point for researchers who are initiating their endeavors in CPP. Likewise, this work aims to present a comprehensive review of the recent breakthroughs in the field, providing links to the most interesting and successful works
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
Elsevier
dc.relation.isformatof
Versió preprint del document publicat a: http://dx.doi.org/10.1016/j.robot.2013.09.004
dc.relation.ispartof
© Robotics and Autonomous Systems, 2013, vol. 61, núm. 12, p. 1258-1276
dc.relation.ispartofseries
Articles publicats (D-ATC)
dc.rights
Tots els drets reservats
dc.subject
dc.title
A survey on coverage path planning for robotics
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.embargo.terms
Cap
dc.type.version
info:eu-repo/semantics/submittedVersion
dc.identifier.doi