Combining Coordination and Independent Coverage in MultiRobot Graph Patrolling
Carlos Diaz Alvarenga,Nicola Basilico,Stefano Carpin,Carlos Diaz Alvarenga,Nicola Basilico,Stefano Carpin
Graph patrolling algorithms provide effective strategies for coordinating mobile robots in the context of autonomously surveilling valuable assets. Optimizing patrolling strategies often aims to minimize the time between subsequent visits to a vertex, a measure known in the literature as idleness. In the domain of multi-robot patrolling, two approaches have received the most attention so far. The ...
