Portal de Periódicos da CAPES

Strategies for coordinated multirobot exploration with recurrent connectivity constraints

2017; Springer Science+Business Media; Volume: 42; Issue: 4 Linguagem: Inglês

10.1007/s10514-017-9652-y

1573-7527

Jacopo Banfi, Alberto Quattrini Li, Ioannis Rekleitis, Francesco Amigoni, Nicola Basilico,

Optimization and Search Problems

During several applications, such as search and rescue, robots must discover new information about the environment and, at the same time, share operational knowledge with a base station through an ad hoc network. In this paper, we design exploration strategies that allow robots to coordinate with teammates to form such a network in order to satisfy recurrent connectivity constraints—that is, data must be shared with the base station when making new observations at the assigned locations. Current approaches lack in flexibility due to the assumptions made about the communication model. Furthermore, they are sometimes inefficient because of the synchronous way they work: new plans are issued only once all robots have reached their goals. This paper introduces two novel asynchronous strategies that work with arbitrary communication models. In this paper, 'asynchronous' means that it is possible to issue new plans to subgroups of robots, when they are ready to receive them. First, we propose a single-stage strategy based on Integer Linear Programming for selecting and assigning robots to locations. Second, we design a two-stage strategy to improve computational efficiency, by separating the problem of locations' selection from that of robot-location assignments. Extensive testing both in simulation and with real robots show that the proposed strategies provide good situation awareness at the base station while efficiently exploring the environment.