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.
Origin : Files produced by the author(s)