The growing interest in robot teams for surveillance or rescue missions entails new technological challenges. Robots have to move to complete their tasks while maintaining communication among themselves and with their human operators, in many cases without the aid of a communication infrastructure. Guaranteeing connectivity enables robots to explicitly exchange information needed in collaborative task execution, and allows operators to monitor or manually control any robot at all times. Network paths should be multi-hop, so as not to unnecessarily restrict the team's range. In this work we contribute a complete system which integrates three research aspects, usually studied separately, to achieve these characteristics: a multi-robot cooperative motion control technique based on a virtual spring-damper model which prevents communication network splits, a task allocation algorithm that takes advantage of network link information in order to ensure autonomous mission completion, and a network layer which works over wireless 802.11 devices, capable of sustaining hard real-time traffic and changing topologies. Link quality among peers is the key metric used to cooperatively move the robots and maintain uninterrupted connectivity, and the basis for novel ideas presented in each subsystem. Simulations and experimental results with real robots are presented and discussed.KEY WORDS-cooperative navigation, link-quality-based communication, multi-robot task allocation, networked robot systems.

Abstract-Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A central problem in such domains is multi-robot routing, namely the problem of coordinating a team of robots in terms of the locations they should visit and the routes they should follow in order to accomplish their common mission. A typical assumption made in prior work on multi-robot routing is that robots are able to communicate uninterruptedly at all times independently of their locations. In this paper, we investigate the multi-robot routing problem under communication constraints, reflecting on the fact that real mobile robots have a limited range of communication and the requirement that connectivity must remain intact (even through relaying) during the entire mission. We propose four algorithms for this problem, all based on the same reactive framework, ranging from greedy to deliberative approaches. All algorithms are tested in various scenarios implemented using the Player-Stage robot simulation environment. Our results demonstrate that effective multi-robot routing can be achieved even under limited communication range with moderate loss compared to the case of infinite communication range.

No abstract

No abstract

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.