2 papers
cs.AI2019
Reachability and Coverage Planning for Connected Agents: Extended Version
Tristan Charrier, Arthur Queffelec, Ocan Sankur +1
Motivated by the increasing appeal of robots in information-gathering missions, we study multi-agent path planning problems in which the agents must remain interconnected. We model…
cs.MA2018
Dynamic Connected Cooperative Coverage Problem
Tristan Charrier, François Schwarzentruber, Eva Soulier
We study the so-called dynamic coverage problem by agents located in some topological graph. The agents must visit all regions of interest but they also should stay connected to th…