Multi-robot Dubins Coverage with Autonomous Surface Vehicles
Authors:
- Jason M. OkaneJOJason M. Okane
- Ioannis RekleitisIRIoannis Rekleitis
- 1 May 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2373-2379
Abstract
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 km 2 lake to ensure their applicability in real world.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum TimeSensors, 2015
- A survey on coverage path planning for roboticsRobotics and Autonomous Systems, 2013
- Efficient complete coverage of a known arbitrary environment with applications to aerial operationsAutonomous Robots, 2013
- On the Dubins Traveling Salesman ProblemIEEE Transactions on Automatic Control, 2011
- Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approachAnnals of Mathematics and Artificial Intelligence, 2008
- The giving tree: constructing trees for efficient offline and online multi-robot coverageAnnals of Mathematics and Artificial Intelligence, 2008
- Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse DecompositionsThe International Journal of Robotics Research, 2002
- Distributed covering by ant-robots using evaporating tracesIEEE Transactions on Robotics and Automation, 1999
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and TangentsAmerican Journal of Mathematics, 1957