A two-phase matheuristic for the multi-robot routing problem under connectivity constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

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

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.
Fichier principal
Vignette du fichier
robots_ROADEF2016.pdf (257.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01256730 , version 1 (01-03-2016)

Identifiers

  • HAL Id : hal-01256730 , version 1

Cite

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⟩
220 View
103 Download

Share

Gmail Facebook Twitter LinkedIn More