Multi-robot Informative Path Planning with Continuous Connectivity Constraints

We consider the problem of information collection from a polygonal environment using a multi-robot system, subject to continuous connectivity constraints. In particular, the robots, having a common radius of communication range, must remain connected throughout the exploration maximizing the information collection. The information gained through the exploration of the terrain is wirelessly transmitted to a base station. The base station performs the centralized planning of informative paths for the robots based on the information collected by them and thereafter, the robots follow these paths. This paper formulates the problem of multi-robot informative path planning under continuous connectivity constraints as an integer program leveraging the ideas of bipartite graph matching and minimal node separators. Theoretical analysis of the proposed solution proves that the informative paths will be collision-free and will be free of both livelock and deadlock. Experimental results demonstrate the low computational requirements of our algorithm for planning the informative paths, taking only about 0.75 sec. for planning a joint set of collision-free informative locations for 10 robots.

[1]  Gaurav S. Sukhatme,et al.  Informative path planning for an autonomous underwater vehicle , 2010, 2010 IEEE International Conference on Robotics and Automation.

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

[3]  Emilio Frazzoli,et al.  Anytime Motion Planning using the RRT* , 2011, 2011 IEEE International Conference on Robotics and Automation.

[4]  Geoffrey A. Hollinger,et al.  Multi-robot coordination with periodic connectivity , 2010, 2010 IEEE International Conference on Robotics and Automation.

[5]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[6]  Kian Hsiang Low,et al.  Multi-robot informative path planning for active sensing of environmental phenomena: a tale of two algorithms , 2013, AAMAS.

[7]  Jean-François Lalande,et al.  Implementation of exponential and parametrized algorithms in the AGAPE project , 2012, ArXiv.

[8]  Anne Berry,et al.  Generating All the Minimal Separators of a Graph , 1999, Int. J. Found. Comput. Sci..

[9]  Prithviraj Dasgupta,et al.  Bipartite graph matching-based coordination mechanism for multi-robot path planning under communication constraints , 2017, 2017 IEEE International Conference on Robotics and Automation (ICRA).

[10]  Miguel Constantino,et al.  Imposing Connectivity Constraints in Forest Planning Models , 2013, Oper. Res..

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

[12]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[13]  Andreas Krause,et al.  Near-optimal sensor placements in Gaussian processes , 2005, ICML.

[14]  Nicola Basilico,et al.  Strategies for coordinated multirobot exploration with recurrent connectivity constraints , 2017, Autonomous Robots.

[15]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

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

[17]  Arturo Gil,et al.  A comparison of path planning strategies for autonomous exploration and mapping of unknown environments , 2012, Auton. Robots.

[18]  Andreas Krause,et al.  Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.

[19]  Weisheng Yan,et al.  Mutual Information-Based Multi-AUV Path Planning for Scalar Field Sampling Using Multidimensional RRT* , 2016, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[20]  Sarit Kraus,et al.  Maintaining Communication in Multi-Robot Tree Coverage , 2017, IJCAI.

[21]  Geoffrey A. Hollinger,et al.  Sampling-based robotic information gathering algorithms , 2014, Int. J. Robotics Res..

[22]  Serge Gaspers,et al.  On the number of minimal separators in graphs , 2018, J. Graph Theory.