Multirobot Coverage Search in Three Dimensions

Searching for objects and observing parts of a known environment efficiently is a fundamental problem in many real-world robotic applications, e.g., household robots searching for objects, inspection robots searching for leaking pipelines, and rescue robots searching for survivors after a disaster. We consider the problem of identifying and planning sequences of sensor locations from which robot sensors can observe and cover complex three-dimensional 3D environments while traveling only short distances. Our approach is based on sampling and ranking a large number of sensor locations for a 3D environment represented by an OctoMap. The visible area from these sensor locations induces a minimal partition of the 3D environment that we exploit for planning sequences of sensor locations with short travel times efficiently. We present multiple planning algorithms designed for single robots and for multirobot teams. These algorithms include variants that are greedy, optimal, or based on decomposing the planning problem into a set cover and traveling salesman problem. We evaluated and compared these algorithms empirically in simulation and real-world robot experiments with up to four robots. Our results demonstrate that, despite the intractability of the overall problem, computing and executing effective solutions for multirobot coverage search in real 3D environments is feasible and ready for real-world applications.

[1]  Brian A. Weiss,et al.  Evolution of a Performance Metric for Urban Search and Rescue Robots (2003) , 2003 .

[2]  Michel Devy,et al.  Perception planning for an exploration task of a 3D environment , 2002, Object recognition supported by user interaction for service robots.

[3]  Brian Yamauchi,et al.  A frontier-based approach for autonomous exploration , 1997, Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation'.

[4]  Katia P. Sycara,et al.  Pursuit-evasion in 2.5d based on team-visibility , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Gerd Hirzinger,et al.  Capturing robot workspace structure: representing robot capabilities , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[6]  Howie Choset,et al.  Limited communication, multi-robot team based coverage , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[7]  Joachim Hertzberg,et al.  An autonomous mobile robot with a 3D laser range finder for 3D exploration and digitalization of indoor environments , 2003, Robotics Auton. Syst..

[8]  Ioannis M. Rekleitis,et al.  Distributed coverage with multi-robot system , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[9]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[10]  Steven M. LaValle,et al.  Visibility-Based Pursuit-Evasion in an Unknown Planar Environment , 2004, Int. J. Robotics Res..

[11]  Alexei Makarenko,et al.  Information based adaptive robotic exploration , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[12]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

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

[14]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[15]  Wolfram Burgard,et al.  OctoMap: an efficient probabilistic 3D mapping framework based on octrees , 2013, Autonomous Robots.

[16]  Juliane Jung,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[17]  Franz S. Hover,et al.  Three-dimensional coverage planning for an underwater inspection robot , 2013, Int. J. Robotics Res..

[18]  Bernhard Nebel,et al.  Semantic Attachments for Domain-Independent Planning Systems , 2009, ICAPS.

[19]  Andreas Krause,et al.  Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization , 2010, J. Artif. Intell. Res..

[20]  Svetlana Lazebnik,et al.  Visibility-Based Pursuit-Evasion in Three-Dimensional Environments , 2011 .

[21]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[22]  Alexander Kleiner,et al.  Coverage search in 3D , 2013, 2013 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR).

[23]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[24]  Noa Agmon,et al.  The giving tree: constructing trees for efficient offline and online multi-robot coverage , 2008, Annals of Mathematics and Artificial Intelligence.

[25]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[26]  Geoffrey A. Hollinger,et al.  Search and pursuit-evasion in mobile robotics , 2011, Auton. Robots.

[27]  Katia P. Sycara,et al.  Hierarchical visibility for guaranteed search in large-scale outdoor terrain , 2011, Autonomous Agents and Multi-Agent Systems.

[28]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[29]  Mongi A. Abidi,et al.  Best-next-view algorithm for three-dimensional scene reconstruction using range images , 1995, Other Conferences.

[30]  Wolfram Burgard,et al.  Coordinated exploration with marsupial teams of robots using temporal symbolic planning , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[31]  Wolfram Burgard,et al.  The Interactive Museum Tour-Guide Robot , 1998, AAAI/IAAI.

[32]  T. M. Murali,et al.  Planning Robot Motion Strategies for Efficient Model Construction , 2000 .

[33]  Wolfram Burgard,et al.  Autonomous Exploration for 3D Map Learning , 2007, AMS.

[34]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[35]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[36]  Alexander Kleiner,et al.  A frontier-void-based approach for autonomous exploration in 3d , 2011 .

[37]  Elias B. Kosmatopoulos,et al.  Multi-robot 3D coverage of unknown terrains , 2011, IEEE Conference on Decision and Control and European Control Conference.

[38]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[39]  Nicholas Roy,et al.  Efficient Optimization of Information-Theoretic Exploration in SLAM , 2008, AAAI.