2019
A 2-Approximation Algorithm for the Online Tethered Coverage Problem
RSS 2019poster
We consider the problem of covering a planar environment, possibly containing unknown obstacles, using a robot of square size D x D attached to a fixed point S by a cable of finite length L. The environment is discretized into 4-connected grid cells with resolution proportional to the robot size. St…