计算机科学
机器人学
任务(项目管理)
机器人
领域(数学)
运动规划
人工智能
点(几何)
路径(计算)
窗口(计算)
人机交互
系统工程
万维网
几何学
数学
纯数学
工程类
程序设计语言
作者
Enric Galceran,Marc Carreras
标识
DOI:10.1016/j.robot.2013.09.004
摘要
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
科研通智能强力驱动
Strongly Powered by AbleSci AI