Coverage Control for Wire-Traversing Robots
This addresses the problem of efficient area coverage for robots operating on constrained networks like wires, which is incremental as it adapts existing coverage control methods to a specific domain.
The paper tackles the coverage control problem for a team of robots constrained to move along wires by proposing a solution that generates continuous motion on these one-dimensional manifolds, tested in simulation and on real robots.
In this paper we consider the coverage control problem for a team of wire-traversing robots. The two-dimensional motion of robots moving in a planar environment has to be projected to one-dimensional manifolds representing the wires. Starting from Lloyd's descent algorithm for coverage control, a solution that generates continuous motion of the robots on the wires is proposed. This is realized by means of a Continuous Onto Wires (COW) map: the robots' workspace is mapped onto the wires on which the motion of the robots is constrained to be. A final projection step is introduced to ensure that the configuration of the robots on the wires is a local minimizer of the constrained locational cost. An algorithm for the continuous constrained coverage control problem is proposed and it is tested both in simulation and on a team of mobile robots.