Covering the working space of mobile robot
Jiri Krejsa, Stanislav Věchet · 2014
Equally distributed covering of working space is essential in some mobile robot applications, such as presentation robotics or security robot patrol. This paper explores a method for such covering based on rapidly exploring random trees (RRT) algorithm. RRTs can cover the working space close to completeness while uncovered areas are quickly reduced. The algorithm can be modified to emphasize certain areas of interest by appropriately generating corresponding goals. Method performance is compared to random walk in simulation experiments.