Multi-robot Dubins Coverage with Autonomous Surface Vehicles

In large scale coverage operations, such as marine exploration or aerial monitoring, single robot approaches are not ideal, as they may take too long to cover a large area. In such scenarios, multi-robot approaches are preferable. Furthermore, several real world vehicles are non-holonomic, but can be modeled using Dubins vehicle kinematics. This paper focuses on environmental monitoring of aquatic environments using Autonomous Surface Vehicles (ASVs). In particular, we propose a novel approach for solving the problem of complete coverage of a known environment by a multi-robot team consisting of Dubins vehicles. It is worth noting that both multi-robot coverage and Dubins vehicle coverage are NP-complete problems. As such, we present two heuristics methods based on a variant of the traveling salesman problem-k-TSP-formulation and clustering algorithms that efficiently solve the problem. The proposed methods are tested both in simulations to assess their scalability and with a team of ASVs operating on a 200 km2 lake to ensure their applicability in real world.

[1]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[2]  Hrvoje Gold,et al.  Vehicle Routing Problem , 2008, Encyclopedia of GIS.

[3]  Zhiyang Yao,et al.  Finding Efficient Robot Path for the Complete Coverage of A Known Space , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Lyuba Alboul,et al.  Multi Robot Cooperative Area Coverage, Case Study: Spraying , 2016, TAROS.

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

[6]  Howie Choset,et al.  Coverage of Known Spaces: The Boustrophedon Cellular Decomposition , 2000, Auton. Robots.

[7]  Guilherme A. S. Pereira,et al.  Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time , 2015, Sensors.

[8]  Ioannis M. Rekleitis,et al.  Efficient complete coverage of a known arbitrary environment with applications to aerial operations , 2013, Autonomous Robots.

[9]  Howie Choset,et al.  Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse Decompositions , 2002, Int. J. Robotics Res..

[10]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..

[11]  Wesley H. Huang Optimal line-sweep-based decompositions for coverage algorithms , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

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

[13]  Lyuba Alboul,et al.  Multi-Agent Cooperative Area Coverage: Case Study Ploughing (Extended Abstract) , 2016, AAMAS.

[14]  Ioannis M. Rekleitis,et al.  Efficient multi-robot coverage of a known environment , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[15]  Bin Xin,et al.  Coordinated motion planning of multiple robots in multi-point dynamic aggregation task , 2016, 2016 12th IEEE International Conference on Control and Automation (ICCA).

[16]  Howie Choset,et al.  Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach , 2008, Annals of Mathematics and Artificial Intelligence.

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

[18]  Ioannis M. Rekleitis,et al.  Optimal coverage of a known arbitrary environment , 2010, 2010 IEEE International Conference on Robotics and Automation.

[19]  Emilio Frazzoli,et al.  On the Dubins Traveling Salesman Problem , 2012, IEEE Transactions on Automatic Control.

[20]  F. Bullo,et al.  On the point-to-point and traveling salesperson problems for Dubins' vehicle , 2005, Proceedings of the 2005, American Control Conference, 2005..

[21]  Noam Hazon,et al.  Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[22]  Philippe Pasquier,et al.  Complete and robust cooperative robot area coverage with limited range , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[23]  Israel A. Wagner,et al.  Distributed covering by ant-robots using evaporating traces , 1999, IEEE Trans. Robotics Autom..

[24]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[25]  Gregory Dudek,et al.  Collaborative Sampling Using Heterogeneous Marine Robots Driven by Visual Cues , 2017, 2017 14th Conference on Computer and Robot Vision (CRV).

[26]  Xin Yu,et al.  Coverage path planning based on a multiple sweep line decomposition , 2015, IECON 2015 - 41st Annual Conference of the IEEE Industrial Electronics Society.

[27]  Elias B. Kosmatopoulos,et al.  Distributed multi-robot coverage using micro aerial vehicles , 2013, 21st Mediterranean Conference on Control and Automation.

[28]  Emilio Frazzoli,et al.  The coverage problem for loitering Dubins vehicles , 2007, 2007 46th IEEE Conference on Decision and Control.

[29]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

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

[31]  L. Dubins On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[32]  Jason M. O'Kane,et al.  Semi-boustrophedon coverage with a dubins vehicle , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[33]  Antonios Tsourdos,et al.  Decentralised submodular multi-robot Task Allocation , 2015, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).