Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms

In several multirobot applications in which communication is limited, the mission could require the robots to iteratively take coordinated joint decisions on how to spread out in the environment and on how to reconnect with each other to share data and compute plans. Exploration and surveillance are examples of these applications. In this paper, we consider the problem of computing robots’ paths on a graph-represented environment for restoring connections at minimum traveling cost. We call it the multirobot reconnection problem, we show its NP-hardness and hardness of approximation on some important classes of graphs, and we provide optimal and heuristic algorithms to solve it in practical settings. The techniques we propose are then exploited to derive a new efficient planning algorithm for a relevant connectivity-constrained multirobot planning problem addressed in the literature, the multirobot informative path planning with periodic connectivity problem.

[1]  Arnoud Visser,et al.  Including communication success in the estimation of information gain for multi-robot exploration , 2008, 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops.

[2]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Nicola Basilico,et al.  A Journey Among Pairs of Vertices: Computing Robots' Paths for Performing Joint Measurements , 2018, AAMAS.

[4]  Howie Choset,et al.  Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph , 2000, Int. J. Robotics Res..

[5]  Nicola Basilico,et al.  Multirobot online construction of communication maps , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[6]  Nicola Basilico,et al.  Searching for Optimal Off-Line Exploration Paths in Grid Environments for a Robot with Limited Visibility , 2012, AAAI.

[7]  Michail G. Lagoudakis,et al.  Guaranteed-Performance Multi-robot Routing under Limited Communication Range , 2008, DARS.

[8]  Vijay Kumar,et al.  Visibility-based deployment of robot formations for communication maintenance , 2011, 2011 IEEE International Conference on Robotics and Automation.

[9]  Andreas Birk,et al.  Multi-robot exploration under the constraints of wireless networking , 2007 .

[10]  Ronald C. Arkin,et al.  Line-of-sight constrained exploration for reactive multiagent robotic teams , 2002, 7th International Workshop on Advanced Motion Control. Proceedings (Cat. No.02TH8623).

[11]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[12]  Torsten Andre.  Autonomous exploration by robot teams: coordination, communication, and collaboration / Dipl.-Ing. Torsten Andre , 2015 .

[13]  Stephen Cameron,et al.  Autonomous Multi-Robot Exploration in Communication-Limited Environments , 2010 .

[14]  Maria L. Gini,et al.  Communication-Restricted Exploration for Robot Teams , 2014 .

[15]  V. Kumar,et al.  Ad hoc networks for localization and control , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[16]  Geoffrey A. Hollinger,et al.  Multirobot Coordination With Periodic Connectivity: Theory and Experiments , 2012, IEEE Transactions on Robotics.

[17]  Petra Mutzel,et al.  The Maximum Weight Connected Subgraph Problem , 2013 .

[18]  George J. Pappas,et al.  Distributed connectivity control of mobile networks , 2007, 2007 46th IEEE Conference on Decision and Control.

[19]  David A. Anisi.  On Cooperative Surveillance, Online Trajectory Planning and Observer Based Control , 2009 .

[20]  Maria L. Gini,et al.  Communication-Restricted Exploration for Search Teams , 2014, DARS.

[21]  Jason M. O'Kane,et al.  Multirobot exploration for building communication maps with prior from communication models , 2017, 2017 International Symposium on Multi-Robot and Multi-Agent Systems (MRS).

[22]  Stefano Carpin,et al.  Extracting surveillance graphs from robot maps , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[23]  Ning Xi,et al.  Connectivity and bandwidth-aware real-time exploration in mobile robot networks , 2013, Wirel. Commun. Mob. Comput..

[24]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

[25]  M. Ani Hsieh,et al.  Maintaining network connectivity and performance in robot teams , 2008, J. Field Robotics.

[26]  Nicola Basilico,et al.  Multirobot Exploration of Communication-Restricted Environments: A Survey , 2017, IEEE Intelligent Systems.

[27]  Zhaodan Kong,et al.  A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance , 2010, J. Intell. Robotic Syst..

[28]  David A. Anisi,et al.  Cooperative surveillance missions with multiple unmanned ground vehicles (UGVs) , 2008, 2008 47th IEEE Conference on Decision and Control.

[29]  Michael M. Zavlanos,et al.  Simultaneous intermittent communication control and path optimization in networks of mobile robots , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[30]  Stephen Cameron,et al.  Time Preference for Information in Multi-agent Exploration with Limited Communication , 2013, TAROS.

[31]  K. Madhava Krishna,et al.  A two phase recursive tree propagation based multi-robotic exploration framework with fixed base station constraint , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[32]  Michael M. Zavlanos,et al.  Distributed Intermittent Connectivity Control of Mobile Robot Networks , 2017, IEEE Transactions on Automatic Control.

[33]  Nicola Basilico,et al.  Asynchronous multirobot exploration under recurrent connectivity constraints , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[34]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .