Deploying a multi-robot team in confined environments poses multiple challenges that involve task and motion planning, localization and mapping, safe navigation, coordination of robots and also communications among all of them. In recent years, increasing attention has been paid to these challenges by the robotics community, but many problems remain unresolved. In this paper we address a technique for planning the deployment of a robot team in so-called fading environments, such as tunnels or galleries, where signal propagation presents specific characteristics. In order to maintain constant connectivity and high signal quality in the communication network formed by the robots and the base station, the robot deployment is driven by real-time signal measurements. First, an analysis of the signal propagation to obtain the general characteristic parameters of the signals in this kind of environment is carried out. Second, a technique which uses these parameters to drive the deployment is developed. A general strategy for this kind of environment in which the signals exhibit similar behavior is implemented. A complete system involving all of the above-mentioned robotics tasks has been developed. Finally, the system has been evaluated by means of simulation and in a real scenario.

Many multi-robot problems require the achievement of formations as part of the overall mission. This work considers a scenario in which unlabeled homogeneous robots must adopt a given formation pattern buildable anywhere in the environment. This involves finding the relative pose of the formation in regard to the initial robot positions, understood as a translation and a rotation; and the optimal assignment of the role of each robot within the formation. This paper provides an optimal solution for the combined parameters of translation, rotation and assignment that minimizes total displacement. To achieve this objective we first formally prove that the three decision variables are separable. Since computing the optimal assignment without accounting for the rotation is a computationally expensive problem, we propose an algorithm that efficiently computes the optimal roles together with the rotation. The algorithm is provably correct and finds the optimal solution in finite time. A distributed implementation is also discussed. Simulation results characterize the complexity of our solution and demonstrate its effectiveness. (C) 2017 Elsevier Ltd. All rights reserved.