In this paper, we consider the problem of maintaining and restoring connectivity among a set of agents (humans or robots) by incrementally redeploying a team of mobile robots acting as communication relays. This problem is relevant in numerous scenarios where humans and robots are jointly deployed for tasks like urban search and rescue, surveillance, and the like. In this case, as the humans move in the environment, connectivity may be broken, and consequently, robots need to reposition themselves to restore it. We study the computational complexity of the problem, also in terms of approximation hardness, and present an Integer Linear Programming formulation to compute optimal solutions. We then analyze the performance of the proposed resolution approach against a heuristic algorithm taken from the literature, and we demonstrate how our method favorably compares in terms of solution quality and scalability.
Optimal Redeployment of Multirobot Teams for Communication Maintenance / J. Banfi, N. Basilico, S. Carpin (PROCEEDINGS OF THE ... IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS). - In: 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)[s.l] : IEEE, 2018. - ISBN 9781538680940. - pp. 3757-3764 (( Intervento presentato al 25. convegno IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) tenutosi a Madrid nel 2018 [10.1109/IROS.2018.8593532].
Optimal Redeployment of Multirobot Teams for Communication Maintenance
J. Banfi;N. Basilico;
2018
Abstract
In this paper, we consider the problem of maintaining and restoring connectivity among a set of agents (humans or robots) by incrementally redeploying a team of mobile robots acting as communication relays. This problem is relevant in numerous scenarios where humans and robots are jointly deployed for tasks like urban search and rescue, surveillance, and the like. In this case, as the humans move in the environment, connectivity may be broken, and consequently, robots need to reposition themselves to restore it. We study the computational complexity of the problem, also in terms of approximation hardness, and present an Integer Linear Programming formulation to compute optimal solutions. We then analyze the performance of the proposed resolution approach against a heuristic algorithm taken from the literature, and we demonstrate how our method favorably compares in terms of solution quality and scalability.File | Dimensione | Formato | |
---|---|---|---|
08593532.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
680.37 kB
Formato
Adobe PDF
|
680.37 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.