A two-phase matheuristic for the multi-robot routing problem under connectivity constraints

Session : COM / Télécommunications
Vendredi 12 février 10:30 - 11:50 Salle : RP13
Diego Cattaruzza, Luce Brotcorne, Nathalie Mitton, Tahiry Razafindralambo et Frédéric Semet

Routing a fleet of robots in a known surface is a complex problem. It consists in the determination of the exact trajectory each robot has to follow to collect information. The objective is to maximize the exploration of the given surface. To ensure that the robots can execute the mission in a collaborative manner, connectivity constraints are considered. These constraints guarantee that robots can communicate among each other and share the collected information. Moreover, the trajectories of the robots need to respect autonomy constraints. Applications of this problem can be found in space scattered sensor visit problems for data collection and/or power up purposes. Again, robots can be used to restock particular resources to precise locations as, for instance, water in emergency areas or informations to soldiers in war zones

Mots clés : matheuristic, multi-robot, routing