Please use this identifier to cite or link to this item: https://idr.l4.nitk.ac.in/jspui/handle/123456789/11418
Title: GM-VPC: An Algorithm for Multi-robot Coverage of Known Spaces Using Generalized Voronoi Partition
Authors: Nair, V.G.
Guruprasad, K.R.
Issue Date: 2019
Citation: Robotica, 2019, Vol., , pp.-
Abstract: In this paper we address the problem of coverage path planning (CPP) for multiple cooperating mobile robots. We use a 'partition and cover' approach using Voronoi partition to achieve natural passive cooperation between robots to avoid task duplicity. We combine two generalizations of Voronoi partition, namely geodesic-distance-based Voronoi partition and Manhattan-distance-based Voronoi partition, to address contiguity of partition in the presence of obstacles and to avoid partition-boundary-induced coverage gap. The region is divided into 2D 2D grids, where D is the size of the robot footprint. Individual robots can use any of the single-robot CPP algorithms. We show that with the proposed Geodesic-Manhattan Voronoi-partition-based coverage (GM-VPC), a complete and non-overlapping coverage can be achieved at grid level provided that the underlying single-robot CPP algorithm has similar property.We demonstrated using two representative single-robot coverage strategies, namely Boustrophedon-decomposition-based coverage and Spanning Tree coverage, first based on so-called exact cellular decomposition and second based on approximate cellular decomposition, that the proposed partitioning scheme completely eliminates coverage gaps and coverage overlaps. Simulation experiments using Matlab and V-rep robot simulator and experiments with Fire Bird V mobile robot are carried out to validate the proposed coverage strategy. Copyright Cambridge University Press 2019.
URI: http://idr.nitk.ac.in/jspui/handle/123456789/11418
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.