Asynchronous multirobot exploration under recurrent connectivity constraints

In multirobot exploration under centralized control, communication plays an important role in constraining the team exploration strategy. Recurrent connectivity is a way to define communication constraints for which robots must connect to a base station only when making new observations. This paper studies effective multirobot exploration strategies under recurrent connectivity by considering a centralized and asynchronous planning framework. We formalize the problem of selecting the optimal set of locations robots should reach, provide an exact formulation to solve it, and devise an approximation algorithm to obtain efficient solutions with a bounded loss of optimality. Experiments in simulation and on real robots evaluate our approach in a number of settings.

[1]  Petra Mutzel,et al.  The Rooted Maximum Node-Weight Connected Subgraph Problem , 2013, CPAIOR.

[2]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

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

[4]  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.

[5]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[6]  Morgan Quigley,et al.  ROS: an open-source Robot Operating System , 2009, ICRA 2009.

[7]  Daniel R. Dooly,et al.  Algorithms for the constrained maximum-weight connected graph problem , 1996 .

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

[9]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

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

[11]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[12]  Yehoshua Sagiv,et al.  New algorithms for computing Steiner trees for a fixed number of terminals , 2006 .

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

[14]  Yuval Rabani,et al.  Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems , 2007, SIAM J. Comput..

[15]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

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

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

[18]  Sergio F. Ochoa,et al.  Human-centric wireless sensor networks to improve information availability during urban search and rescue activities , 2015, Inf. Fusion.