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

Diego Cattaruzza 1 Luce Brotcorne 1 Nathalie Mitton 2 Tahiry Razafindralambo 2 Frédéric Semet 3
1 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : 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 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.
Document type :
Conference papers
Complete list of metadatas

Contributor : Nathalie Mitton <>
Submitted on : Tuesday, March 1, 2016 - 3:05:09 PM
Last modification on : Friday, March 22, 2019 - 1:34:55 AM
Long-term archiving on : Tuesday, May 31, 2016 - 10:59:44 AM


Files produced by the author(s)


  • HAL Id : hal-01256730, version 1


Diego Cattaruzza, Luce Brotcorne, Nathalie Mitton, Tahiry Razafindralambo, Frédéric Semet. A two-phase matheuristic for the multi-robot routing problem under connectivity constraints. Congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Feb 2016, Compiègne, France. ⟨hal-01256730⟩



Record views


Files downloads